java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:12:09,672 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:12:09,674 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:12:09,696 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:12:09,696 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:12:09,699 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:12:09,701 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:12:09,712 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:12:09,716 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:12:09,721 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:12:09,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:12:09,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:12:09,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:12:09,726 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:12:09,728 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:12:09,730 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:12:09,731 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:12:09,733 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:12:09,734 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:12:09,740 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:12:09,744 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:12:09,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:12:09,750 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:12:09,751 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:12:09,753 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:12:09,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:12:09,753 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:12:09,755 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:12:09,757 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:12:09,758 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:12:09,758 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:12:09,761 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:12:09,762 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:12:09,763 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:12:09,765 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:12:09,765 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:12:09,766 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:12:09,766 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:12:09,766 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:12:09,767 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:12:09,768 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:12:09,769 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-13 21:12:09,803 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:12:09,804 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:12:09,807 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:12:09,807 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:12:09,808 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:12:09,808 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:12:09,808 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:12:09,808 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:12:09,808 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:12:09,809 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:12:09,809 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:12:09,812 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:12:09,812 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:12:09,813 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:12:09,813 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:12:09,813 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:12:09,813 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:12:09,814 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:12:09,814 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:12:09,814 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:12:09,815 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:12:09,815 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:12:09,815 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:12:09,816 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:12:09,816 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:12:09,816 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:12:09,816 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:12:09,816 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:12:09,817 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-13 21:12:10,121 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:12:10,136 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:12:10,140 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:12:10,141 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:12:10,142 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:12:10,142 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-10-13 21:12:10,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a32e29c/d51b53e11b0e4c96b50c3498d88396a8/FLAG396f1906e [2019-10-13 21:12:10,851 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:12:10,851 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec9_product11.cil.c [2019-10-13 21:12:10,876 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a32e29c/d51b53e11b0e4c96b50c3498d88396a8/FLAG396f1906e [2019-10-13 21:12:11,032 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b8a32e29c/d51b53e11b0e4c96b50c3498d88396a8 [2019-10-13 21:12:11,045 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:12:11,049 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:12:11,055 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:11,055 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:12:11,060 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:12:11,061 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:11" (1/1) ... [2019-10-13 21:12:11,065 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35a8eca5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:11, skipping insertion in model container [2019-10-13 21:12:11,065 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:12:11" (1/1) ... [2019-10-13 21:12:11,075 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:12:11,168 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:12:11,908 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:11,937 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:12:12,098 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:12:12,166 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:12:12,167 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12 WrapperNode [2019-10-13 21:12:12,167 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:12:12,168 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:12:12,168 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:12:12,169 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:12:12,189 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,189 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,263 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,263 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,334 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,382 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,405 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (1/1) ... [2019-10-13 21:12:12,438 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:12:12,438 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:12:12,439 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:12:12,439 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:12:12,443 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (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-13 21:12:12,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:12:12,528 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:12:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:12:12,529 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:12:12,530 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:12:12,530 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:12:12,531 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:12:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:12:12,532 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:12:12,533 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:12:12,533 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:12:12,533 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:12:12,534 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:12:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:12:12,535 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:12:12,537 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:12:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:12:12,538 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:12:12,539 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:12:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:12:12,540 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:12:12,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:12,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:12,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:12,541 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:12:12,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:12:12,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:12:12,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:12,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:12,542 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:12:12,543 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:12:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:12:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:12:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:12:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:12:12,544 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:12:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:12:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:12:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:12:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:12:12,545 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:12:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:12:12,546 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:12:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:12:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:12:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:12:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:12:12,547 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:12:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:12:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:12:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:12:12,548 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:12:12,549 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:12,549 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:12,549 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:12:12,549 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:12:12,550 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:12:12,550 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:12:12,550 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:12:12,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:12:12,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:12:12,551 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:12:12,551 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:12:12,551 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:12:12,552 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:12:12,552 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:12:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:12:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:12:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:12:12,553 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:12:12,553 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:12:12,554 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:12:12,554 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:12:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:12:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:12:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:12:12,555 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:12:12,556 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:12:12,556 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:12:12,557 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:12:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:12:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:12:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:12:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:12:12,558 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:12:12,559 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:12:12,560 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:12:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:12:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__1 [2019-10-13 21:12:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__4 [2019-10-13 21:12:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:12:12,561 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:12:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:12:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:12:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:12:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:12:12,562 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:12:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:12:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:12:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:12:12,563 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:12:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:12:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:12:12,564 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:12:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:12:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:12:12,565 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:12:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:12:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:12:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:12:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:12:12,566 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:12:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:12:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:12:12,567 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:12:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:12:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:12:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__2 [2019-10-13 21:12:12,568 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification9_spec__3 [2019-10-13 21:12:12,570 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:12:12,573 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:12:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:12:12,577 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:12:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:12:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:12:12,578 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:12:12,579 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:12:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:12:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:12:12,587 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:12:12,588 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:12:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:12:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:12:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:12:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:12:12,589 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:12:12,590 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:12:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:12:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:12:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:12:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:12:12,591 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:12:15,022 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:12:15,022 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:12:15,025 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15 BoogieIcfgContainer [2019-10-13 21:12:15,025 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:12:15,026 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:12:15,027 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:12:15,030 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:12:15,031 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:12:11" (1/3) ... [2019-10-13 21:12:15,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eea69ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:12:12" (2/3) ... [2019-10-13 21:12:15,032 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7eea69ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:12:15, skipping insertion in model container [2019-10-13 21:12:15,032 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:12:15" (3/3) ... [2019-10-13 21:12:15,034 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec9_product11.cil.c [2019-10-13 21:12:15,046 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:12:15,057 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:12:15,072 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:12:15,105 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:12:15,105 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:12:15,105 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:12:15,105 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:12:15,106 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:12:15,106 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:12:15,106 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:12:15,106 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:12:15,145 INFO L276 IsEmpty]: Start isEmpty. Operand 756 states. [2019-10-13 21:12:15,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:12:15,179 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:15,180 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] [2019-10-13 21:12:15,183 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:15,189 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:15,189 INFO L82 PathProgramCache]: Analyzing trace with hash -1577724025, now seen corresponding path program 1 times [2019-10-13 21:12:15,200 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:15,200 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406327187] [2019-10-13 21:12:15,200 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,201 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:15,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:15,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,000 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-13 21:12:16,001 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406327187] [2019-10-13 21:12:16,002 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,003 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:16,003 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331050679] [2019-10-13 21:12:16,010 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:16,012 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:16,029 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:16,031 INFO L87 Difference]: Start difference. First operand 756 states. Second operand 4 states. [2019-10-13 21:12:16,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,300 INFO L93 Difference]: Finished difference Result 1175 states and 1903 transitions. [2019-10-13 21:12:16,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:16,302 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:12:16,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,338 INFO L225 Difference]: With dead ends: 1175 [2019-10-13 21:12:16,338 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:16,351 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-13 21:12:16,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:16,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:16,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:16,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 953 transitions. [2019-10-13 21:12:16,469 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 953 transitions. Word has length 135 [2019-10-13 21:12:16,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,470 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 953 transitions. [2019-10-13 21:12:16,470 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:16,470 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 953 transitions. [2019-10-13 21:12:16,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:12:16,476 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,477 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-13 21:12:16,477 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,478 INFO L82 PathProgramCache]: Analyzing trace with hash -1074929416, now seen corresponding path program 1 times [2019-10-13 21:12:16,478 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,478 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318756609] [2019-10-13 21:12:16,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,478 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,479 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:16,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:16,717 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-13 21:12:16,717 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318756609] [2019-10-13 21:12:16,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:16,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:16,718 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211074548] [2019-10-13 21:12:16,722 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:16,723 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:16,723 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:16,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:16,724 INFO L87 Difference]: Start difference. First operand 596 states and 953 transitions. Second operand 4 states. [2019-10-13 21:12:16,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:16,812 INFO L93 Difference]: Finished difference Result 1155 states and 1864 transitions. [2019-10-13 21:12:16,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:16,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:12:16,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:16,819 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:12:16,820 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:16,823 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-13 21:12:16,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:16,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:16,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:16,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 952 transitions. [2019-10-13 21:12:16,887 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 952 transitions. Word has length 138 [2019-10-13 21:12:16,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:16,889 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 952 transitions. [2019-10-13 21:12:16,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:16,890 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 952 transitions. [2019-10-13 21:12:16,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:12:16,902 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:16,903 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-13 21:12:16,903 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:16,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:16,904 INFO L82 PathProgramCache]: Analyzing trace with hash 894123030, now seen corresponding path program 1 times [2019-10-13 21:12:16,904 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:16,904 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [3128084] [2019-10-13 21:12:16,904 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,905 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:16,905 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,127 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-13 21:12:17,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [3128084] [2019-10-13 21:12:17,128 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,128 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,128 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716440008] [2019-10-13 21:12:17,131 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,132 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,132 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,132 INFO L87 Difference]: Start difference. First operand 596 states and 952 transitions. Second operand 4 states. [2019-10-13 21:12:17,214 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,215 INFO L93 Difference]: Finished difference Result 1155 states and 1863 transitions. [2019-10-13 21:12:17,215 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,215 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:12:17,216 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,222 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:12:17,222 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:17,226 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-13 21:12:17,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:17,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:17,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:17,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 951 transitions. [2019-10-13 21:12:17,263 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 951 transitions. Word has length 139 [2019-10-13 21:12:17,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,264 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 951 transitions. [2019-10-13 21:12:17,264 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,264 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 951 transitions. [2019-10-13 21:12:17,270 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:12:17,270 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,270 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-13 21:12:17,271 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,271 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,271 INFO L82 PathProgramCache]: Analyzing trace with hash 558643508, now seen corresponding path program 1 times [2019-10-13 21:12:17,271 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,272 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1016646121] [2019-10-13 21:12:17,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,272 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,272 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,428 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-13 21:12:17,428 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1016646121] [2019-10-13 21:12:17,429 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,429 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,429 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1444633422] [2019-10-13 21:12:17,431 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,431 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,431 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,432 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,432 INFO L87 Difference]: Start difference. First operand 596 states and 951 transitions. Second operand 4 states. [2019-10-13 21:12:17,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,500 INFO L93 Difference]: Finished difference Result 1155 states and 1862 transitions. [2019-10-13 21:12:17,501 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,501 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:12:17,501 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,509 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:12:17,509 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:17,512 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-13 21:12:17,514 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:17,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:17,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:17,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 950 transitions. [2019-10-13 21:12:17,544 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 950 transitions. Word has length 140 [2019-10-13 21:12:17,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,544 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 950 transitions. [2019-10-13 21:12:17,545 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,545 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 950 transitions. [2019-10-13 21:12:17,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:12:17,549 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,549 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-13 21:12:17,550 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,550 INFO L82 PathProgramCache]: Analyzing trace with hash 1797117010, now seen corresponding path program 1 times [2019-10-13 21:12:17,550 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,550 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656403408] [2019-10-13 21:12:17,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,551 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,551 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:17,700 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-13 21:12:17,701 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656403408] [2019-10-13 21:12:17,702 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:17,702 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:17,702 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513662132] [2019-10-13 21:12:17,703 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:17,703 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:17,703 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:17,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:17,704 INFO L87 Difference]: Start difference. First operand 596 states and 950 transitions. Second operand 4 states. [2019-10-13 21:12:17,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:17,815 INFO L93 Difference]: Finished difference Result 1155 states and 1861 transitions. [2019-10-13 21:12:17,816 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:17,816 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 141 [2019-10-13 21:12:17,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:17,821 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:12:17,821 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:17,824 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-13 21:12:17,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:17,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:17,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:17,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 949 transitions. [2019-10-13 21:12:17,848 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 949 transitions. Word has length 141 [2019-10-13 21:12:17,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:17,848 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 949 transitions. [2019-10-13 21:12:17,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:17,849 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 949 transitions. [2019-10-13 21:12:17,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:12:17,856 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:17,859 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-13 21:12:17,864 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:17,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:17,865 INFO L82 PathProgramCache]: Analyzing trace with hash 2124369551, now seen corresponding path program 1 times [2019-10-13 21:12:17,865 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:17,865 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [894938340] [2019-10-13 21:12:17,865 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,866 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:17,866 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,019 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-13 21:12:18,020 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [894938340] [2019-10-13 21:12:18,021 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,021 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:12:18,021 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [571372113] [2019-10-13 21:12:18,022 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:12:18,022 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,022 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:12:18,022 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:12:18,023 INFO L87 Difference]: Start difference. First operand 596 states and 949 transitions. Second operand 4 states. [2019-10-13 21:12:18,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,088 INFO L93 Difference]: Finished difference Result 1155 states and 1860 transitions. [2019-10-13 21:12:18,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:12:18,089 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 142 [2019-10-13 21:12:18,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,100 INFO L225 Difference]: With dead ends: 1155 [2019-10-13 21:12:18,100 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:12:18,106 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-13 21:12:18,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:12:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 596. [2019-10-13 21:12:18,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 596 states. [2019-10-13 21:12:18,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 596 states to 596 states and 948 transitions. [2019-10-13 21:12:18,129 INFO L78 Accepts]: Start accepts. Automaton has 596 states and 948 transitions. Word has length 142 [2019-10-13 21:12:18,129 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,129 INFO L462 AbstractCegarLoop]: Abstraction has 596 states and 948 transitions. [2019-10-13 21:12:18,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:12:18,130 INFO L276 IsEmpty]: Start isEmpty. Operand 596 states and 948 transitions. [2019-10-13 21:12:18,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:12:18,133 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,134 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-13 21:12:18,134 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,134 INFO L82 PathProgramCache]: Analyzing trace with hash 288526704, now seen corresponding path program 1 times [2019-10-13 21:12:18,135 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,135 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052949065] [2019-10-13 21:12:18,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,135 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,135 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,348 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-13 21:12:18,348 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052949065] [2019-10-13 21:12:18,348 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,349 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:12:18,349 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890513847] [2019-10-13 21:12:18,349 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:12:18,350 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:12:18,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:12:18,351 INFO L87 Difference]: Start difference. First operand 596 states and 948 transitions. Second operand 10 states. [2019-10-13 21:12:18,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:18,513 INFO L93 Difference]: Finished difference Result 1107 states and 1772 transitions. [2019-10-13 21:12:18,514 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:12:18,514 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 142 [2019-10-13 21:12:18,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:18,521 INFO L225 Difference]: With dead ends: 1107 [2019-10-13 21:12:18,522 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:12:18,525 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-13 21:12:18,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:12:18,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:12:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:12:18,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 935 transitions. [2019-10-13 21:12:18,549 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 935 transitions. Word has length 142 [2019-10-13 21:12:18,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:18,550 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 935 transitions. [2019-10-13 21:12:18,550 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:12:18,550 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 935 transitions. [2019-10-13 21:12:18,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:12:18,554 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:18,554 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-13 21:12:18,555 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:18,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:18,555 INFO L82 PathProgramCache]: Analyzing trace with hash 647383892, now seen corresponding path program 1 times [2019-10-13 21:12:18,555 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:18,556 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656734297] [2019-10-13 21:12:18,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,556 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:18,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:18,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:18,879 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-13 21:12:18,879 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656734297] [2019-10-13 21:12:18,879 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:18,880 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:18,880 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [762078273] [2019-10-13 21:12:18,880 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:18,881 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:18,881 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:18,881 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:18,881 INFO L87 Difference]: Start difference. First operand 590 states and 935 transitions. Second operand 6 states. [2019-10-13 21:12:19,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,124 INFO L93 Difference]: Finished difference Result 1101 states and 1759 transitions. [2019-10-13 21:12:19,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,124 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:12:19,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,131 INFO L225 Difference]: With dead ends: 1101 [2019-10-13 21:12:19,131 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:12:19,135 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-13 21:12:19,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:12:19,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:12:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:12:19,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 931 transitions. [2019-10-13 21:12:19,161 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 931 transitions. Word has length 143 [2019-10-13 21:12:19,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,163 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 931 transitions. [2019-10-13 21:12:19,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,163 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 931 transitions. [2019-10-13 21:12:19,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:12:19,171 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,172 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-13 21:12:19,172 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2083725933, now seen corresponding path program 1 times [2019-10-13 21:12:19,173 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,173 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599514362] [2019-10-13 21:12:19,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,173 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,174 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,367 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-13 21:12:19,368 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599514362] [2019-10-13 21:12:19,368 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,369 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,370 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249972621] [2019-10-13 21:12:19,371 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,371 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,371 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,372 INFO L87 Difference]: Start difference. First operand 590 states and 931 transitions. Second operand 6 states. [2019-10-13 21:12:19,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:19,629 INFO L93 Difference]: Finished difference Result 1101 states and 1755 transitions. [2019-10-13 21:12:19,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:19,630 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:12:19,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:19,635 INFO L225 Difference]: With dead ends: 1101 [2019-10-13 21:12:19,635 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:12:19,638 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-13 21:12:19,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:12:19,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:12:19,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:12:19,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-13 21:12:19,660 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 144 [2019-10-13 21:12:19,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:19,661 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-13 21:12:19,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:19,661 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-13 21:12:19,666 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:12:19,666 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:19,666 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-13 21:12:19,667 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:19,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:19,667 INFO L82 PathProgramCache]: Analyzing trace with hash 1728817657, now seen corresponding path program 1 times [2019-10-13 21:12:19,667 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:19,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955423343] [2019-10-13 21:12:19,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,668 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:19,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:19,924 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-13 21:12:19,924 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955423343] [2019-10-13 21:12:19,925 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:19,926 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:19,926 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825197491] [2019-10-13 21:12:19,927 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:19,927 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:19,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:19,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:19,928 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-13 21:12:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,163 INFO L93 Difference]: Finished difference Result 1101 states and 1751 transitions. [2019-10-13 21:12:20,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,164 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:12:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,170 INFO L225 Difference]: With dead ends: 1101 [2019-10-13 21:12:20,171 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:12:20,178 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-13 21:12:20,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:12:20,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:12:20,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:12:20,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 923 transitions. [2019-10-13 21:12:20,208 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 923 transitions. Word has length 145 [2019-10-13 21:12:20,209 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,209 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 923 transitions. [2019-10-13 21:12:20,209 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,209 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 923 transitions. [2019-10-13 21:12:20,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:12:20,216 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,216 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-13 21:12:20,217 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,217 INFO L82 PathProgramCache]: Analyzing trace with hash 1465419385, now seen corresponding path program 1 times [2019-10-13 21:12:20,217 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,218 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1348288392] [2019-10-13 21:12:20,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,218 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,218 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,417 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-13 21:12:20,417 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1348288392] [2019-10-13 21:12:20,417 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,417 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:12:20,418 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788042668] [2019-10-13 21:12:20,419 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:12:20,419 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:12:20,420 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:20,420 INFO L87 Difference]: Start difference. First operand 590 states and 923 transitions. Second operand 7 states. [2019-10-13 21:12:20,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,525 INFO L93 Difference]: Finished difference Result 1101 states and 1747 transitions. [2019-10-13 21:12:20,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:12:20,526 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 145 [2019-10-13 21:12:20,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,531 INFO L225 Difference]: With dead ends: 1101 [2019-10-13 21:12:20,532 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:12:20,535 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-13 21:12:20,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:12:20,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:12:20,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:12:20,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 889 transitions. [2019-10-13 21:12:20,560 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 889 transitions. Word has length 145 [2019-10-13 21:12:20,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,560 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 889 transitions. [2019-10-13 21:12:20,560 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:12:20,561 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 889 transitions. [2019-10-13 21:12:20,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:12:20,570 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,570 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-13 21:12:20,571 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,571 INFO L82 PathProgramCache]: Analyzing trace with hash -2058780392, now seen corresponding path program 1 times [2019-10-13 21:12:20,571 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,572 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357584738] [2019-10-13 21:12:20,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,572 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,572 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:20,742 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-13 21:12:20,743 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357584738] [2019-10-13 21:12:20,743 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:20,743 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:20,744 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1378540604] [2019-10-13 21:12:20,744 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:20,745 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:20,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:20,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:20,745 INFO L87 Difference]: Start difference. First operand 569 states and 889 transitions. Second operand 6 states. [2019-10-13 21:12:20,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:20,852 INFO L93 Difference]: Finished difference Result 1080 states and 1713 transitions. [2019-10-13 21:12:20,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:20,853 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 146 [2019-10-13 21:12:20,853 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:20,858 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 21:12:20,858 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:12:20,861 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-13 21:12:20,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:12:20,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:12:20,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:12:20,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 888 transitions. [2019-10-13 21:12:20,888 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 888 transitions. Word has length 146 [2019-10-13 21:12:20,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:20,890 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 888 transitions. [2019-10-13 21:12:20,890 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:20,890 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 888 transitions. [2019-10-13 21:12:20,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:12:20,894 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:20,895 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-13 21:12:20,895 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:20,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:20,896 INFO L82 PathProgramCache]: Analyzing trace with hash -932600674, now seen corresponding path program 1 times [2019-10-13 21:12:20,896 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:20,896 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127368431] [2019-10-13 21:12:20,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,897 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:20,897 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:20,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,073 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-13 21:12:21,074 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127368431] [2019-10-13 21:12:21,074 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,074 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:21,074 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1762927331] [2019-10-13 21:12:21,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:21,076 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:21,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:21,077 INFO L87 Difference]: Start difference. First operand 569 states and 888 transitions. Second operand 6 states. [2019-10-13 21:12:21,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,179 INFO L93 Difference]: Finished difference Result 1080 states and 1712 transitions. [2019-10-13 21:12:21,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:21,180 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 147 [2019-10-13 21:12:21,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,185 INFO L225 Difference]: With dead ends: 1080 [2019-10-13 21:12:21,186 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:12:21,189 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-13 21:12:21,190 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:12:21,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:12:21,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:12:21,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 887 transitions. [2019-10-13 21:12:21,210 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 887 transitions. Word has length 147 [2019-10-13 21:12:21,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,212 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 887 transitions. [2019-10-13 21:12:21,212 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:21,212 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 887 transitions. [2019-10-13 21:12:21,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 149 [2019-10-13 21:12:21,218 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,219 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:21,219 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,220 INFO L82 PathProgramCache]: Analyzing trace with hash -2098132835, now seen corresponding path program 1 times [2019-10-13 21:12:21,220 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,220 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1542550836] [2019-10-13 21:12:21,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,220 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,442 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-13 21:12:21,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1542550836] [2019-10-13 21:12:21,442 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:21,443 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:12:21,443 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038930424] [2019-10-13 21:12:21,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:12:21,444 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:21,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:12:21,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:12:21,444 INFO L87 Difference]: Start difference. First operand 569 states and 887 transitions. Second operand 12 states. [2019-10-13 21:12:21,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:21,641 INFO L93 Difference]: Finished difference Result 1081 states and 1711 transitions. [2019-10-13 21:12:21,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-13 21:12:21,641 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 148 [2019-10-13 21:12:21,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:21,647 INFO L225 Difference]: With dead ends: 1081 [2019-10-13 21:12:21,648 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:12:21,652 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-13 21:12:21,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:12:21,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:12:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:12:21,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 886 transitions. [2019-10-13 21:12:21,683 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 886 transitions. Word has length 148 [2019-10-13 21:12:21,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:21,684 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 886 transitions. [2019-10-13 21:12:21,684 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:12:21,684 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 886 transitions. [2019-10-13 21:12:21,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2019-10-13 21:12:21,688 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:21,688 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:21,689 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:21,689 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:21,689 INFO L82 PathProgramCache]: Analyzing trace with hash 1812854929, now seen corresponding path program 1 times [2019-10-13 21:12:21,689 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:21,689 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854991936] [2019-10-13 21:12:21,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,690 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:21,690 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:21,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:21,864 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-13 21:12:21,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854991936] [2019-10-13 21:12:21,864 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1171464665] [2019-10-13 21:12:21,865 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-13 21:12:22,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:22,441 INFO L256 TraceCheckSpWp]: Trace formula consists of 2762 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:22,467 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:22,523 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-13 21:12:22,524 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:22,838 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-13 21:12:22,838 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:22,839 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:12:22,839 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [238302177] [2019-10-13 21:12:22,840 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:22,840 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:22,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:22,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:22,841 INFO L87 Difference]: Start difference. First operand 569 states and 886 transitions. Second operand 3 states. [2019-10-13 21:12:22,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:22,922 INFO L93 Difference]: Finished difference Result 1566 states and 2517 transitions. [2019-10-13 21:12:22,923 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:22,923 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 149 [2019-10-13 21:12:22,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:22,934 INFO L225 Difference]: With dead ends: 1566 [2019-10-13 21:12:22,935 INFO L226 Difference]: Without dead ends: 1063 [2019-10-13 21:12:22,938 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 303 GetRequests, 298 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:22,941 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2019-10-13 21:12:22,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2019-10-13 21:12:22,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1061 states. [2019-10-13 21:12:23,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1697 transitions. [2019-10-13 21:12:23,004 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1697 transitions. Word has length 149 [2019-10-13 21:12:23,004 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:23,004 INFO L462 AbstractCegarLoop]: Abstraction has 1061 states and 1697 transitions. [2019-10-13 21:12:23,005 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:23,005 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1697 transitions. [2019-10-13 21:12:23,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:12:23,010 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:23,011 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:23,212 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:23,212 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:23,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:23,213 INFO L82 PathProgramCache]: Analyzing trace with hash 362635653, now seen corresponding path program 1 times [2019-10-13 21:12:23,213 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:23,214 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [572284504] [2019-10-13 21:12:23,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:23,214 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:23,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:23,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:23,447 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-13 21:12:23,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [572284504] [2019-10-13 21:12:23,447 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [734731464] [2019-10-13 21:12:23,448 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-13 21:12:24,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:24,092 INFO L256 TraceCheckSpWp]: Trace formula consists of 2764 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:24,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:24,129 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-13 21:12:24,129 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:24,364 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-13 21:12:24,364 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:24,365 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:12:24,365 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1497489656] [2019-10-13 21:12:24,366 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:24,366 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:24,366 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:24,366 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:24,367 INFO L87 Difference]: Start difference. First operand 1061 states and 1697 transitions. Second operand 3 states. [2019-10-13 21:12:24,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:24,474 INFO L93 Difference]: Finished difference Result 3044 states and 4975 transitions. [2019-10-13 21:12:24,474 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:24,474 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:12:24,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:24,494 INFO L225 Difference]: With dead ends: 3044 [2019-10-13 21:12:24,494 INFO L226 Difference]: Without dead ends: 2049 [2019-10-13 21:12:24,501 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 300 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:24,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2049 states. [2019-10-13 21:12:24,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2049 to 2046. [2019-10-13 21:12:24,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2046 states. [2019-10-13 21:12:24,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2046 states to 2046 states and 3337 transitions. [2019-10-13 21:12:24,604 INFO L78 Accepts]: Start accepts. Automaton has 2046 states and 3337 transitions. Word has length 150 [2019-10-13 21:12:24,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:24,607 INFO L462 AbstractCegarLoop]: Abstraction has 2046 states and 3337 transitions. [2019-10-13 21:12:24,607 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:24,607 INFO L276 IsEmpty]: Start isEmpty. Operand 2046 states and 3337 transitions. [2019-10-13 21:12:24,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2019-10-13 21:12:24,613 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:24,613 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:24,824 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:24,825 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:24,825 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:24,826 INFO L82 PathProgramCache]: Analyzing trace with hash -1644485037, now seen corresponding path program 1 times [2019-10-13 21:12:24,826 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:24,826 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783837305] [2019-10-13 21:12:24,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,827 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:24,827 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:24,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:24,997 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-13 21:12:24,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1783837305] [2019-10-13 21:12:24,998 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885633302] [2019-10-13 21:12:24,999 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-13 21:12:25,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:25,682 INFO L256 TraceCheckSpWp]: Trace formula consists of 2766 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:25,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:25,732 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-13 21:12:25,732 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:25,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-13 21:12:25,955 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:25,956 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:12:25,956 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411908035] [2019-10-13 21:12:25,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:25,957 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:25,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:25,957 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:25,958 INFO L87 Difference]: Start difference. First operand 2046 states and 3337 transitions. Second operand 3 states. [2019-10-13 21:12:26,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:26,100 INFO L93 Difference]: Finished difference Result 6001 states and 9966 transitions. [2019-10-13 21:12:26,101 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:26,101 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 151 [2019-10-13 21:12:26,101 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:26,142 INFO L225 Difference]: With dead ends: 6001 [2019-10-13 21:12:26,142 INFO L226 Difference]: Without dead ends: 4021 [2019-10-13 21:12:26,157 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 302 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:26,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4021 states. [2019-10-13 21:12:26,374 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4021 to 4017. [2019-10-13 21:12:26,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4017 states. [2019-10-13 21:12:26,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4017 states to 4017 states and 6667 transitions. [2019-10-13 21:12:26,400 INFO L78 Accepts]: Start accepts. Automaton has 4017 states and 6667 transitions. Word has length 151 [2019-10-13 21:12:26,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:26,400 INFO L462 AbstractCegarLoop]: Abstraction has 4017 states and 6667 transitions. [2019-10-13 21:12:26,400 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:26,401 INFO L276 IsEmpty]: Start isEmpty. Operand 4017 states and 6667 transitions. [2019-10-13 21:12:26,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 153 [2019-10-13 21:12:26,407 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:26,407 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:26,615 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:26,616 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:26,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:26,616 INFO L82 PathProgramCache]: Analyzing trace with hash 559286919, now seen corresponding path program 1 times [2019-10-13 21:12:26,617 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:26,617 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404007581] [2019-10-13 21:12:26,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,617 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:26,617 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:26,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:26,814 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-13 21:12:26,814 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404007581] [2019-10-13 21:12:26,815 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390170675] [2019-10-13 21:12:26,815 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-13 21:12:27,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:27,512 INFO L256 TraceCheckSpWp]: Trace formula consists of 2768 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:27,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:27,574 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-13 21:12:27,575 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:28,006 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-13 21:12:28,007 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:28,007 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:12:28,007 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [505376245] [2019-10-13 21:12:28,008 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:28,008 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:28,008 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:28,009 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:28,009 INFO L87 Difference]: Start difference. First operand 4017 states and 6667 transitions. Second operand 3 states. [2019-10-13 21:12:28,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:28,275 INFO L93 Difference]: Finished difference Result 11916 states and 20185 transitions. [2019-10-13 21:12:28,275 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:28,276 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 152 [2019-10-13 21:12:28,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:28,381 INFO L225 Difference]: With dead ends: 11916 [2019-10-13 21:12:28,382 INFO L226 Difference]: Without dead ends: 7965 [2019-10-13 21:12:28,412 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 309 GetRequests, 304 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:28,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7965 states. [2019-10-13 21:12:28,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7965 to 7960. [2019-10-13 21:12:28,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7960 states. [2019-10-13 21:12:28,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7960 states to 7960 states and 13485 transitions. [2019-10-13 21:12:28,791 INFO L78 Accepts]: Start accepts. Automaton has 7960 states and 13485 transitions. Word has length 152 [2019-10-13 21:12:28,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:28,792 INFO L462 AbstractCegarLoop]: Abstraction has 7960 states and 13485 transitions. [2019-10-13 21:12:28,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:28,792 INFO L276 IsEmpty]: Start isEmpty. Operand 7960 states and 13485 transitions. [2019-10-13 21:12:28,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:12:28,798 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:28,798 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:12:29,005 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:29,005 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:29,006 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:29,007 INFO L82 PathProgramCache]: Analyzing trace with hash 156744725, now seen corresponding path program 1 times [2019-10-13 21:12:29,007 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:29,008 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1827192674] [2019-10-13 21:12:29,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,008 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:29,009 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:29,205 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-13 21:12:29,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1827192674] [2019-10-13 21:12:29,206 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1710405613] [2019-10-13 21:12:29,206 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-13 21:12:30,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:30,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 2770 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:12:30,446 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:12:30,497 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-13 21:12:30,497 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:12:30,809 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-13 21:12:30,812 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:12:30,812 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [6] total 7 [2019-10-13 21:12:30,812 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1249212571] [2019-10-13 21:12:30,815 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:12:30,816 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:30,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:12:30,823 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:30,823 INFO L87 Difference]: Start difference. First operand 7960 states and 13485 transitions. Second operand 3 states. [2019-10-13 21:12:31,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:31,392 INFO L93 Difference]: Finished difference Result 23747 states and 41435 transitions. [2019-10-13 21:12:31,392 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:12:31,393 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 153 [2019-10-13 21:12:31,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:31,556 INFO L225 Difference]: With dead ends: 23747 [2019-10-13 21:12:31,557 INFO L226 Difference]: Without dead ends: 15843 [2019-10-13 21:12:31,605 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 306 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:12:31,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15843 states. [2019-10-13 21:12:32,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15843 to 15837. [2019-10-13 21:12:32,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15837 states. [2019-10-13 21:12:32,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15837 states to 15837 states and 27646 transitions. [2019-10-13 21:12:32,381 INFO L78 Accepts]: Start accepts. Automaton has 15837 states and 27646 transitions. Word has length 153 [2019-10-13 21:12:32,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:32,382 INFO L462 AbstractCegarLoop]: Abstraction has 15837 states and 27646 transitions. [2019-10-13 21:12:32,382 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:12:32,382 INFO L276 IsEmpty]: Start isEmpty. Operand 15837 states and 27646 transitions. [2019-10-13 21:12:32,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 225 [2019-10-13 21:12:32,413 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:32,413 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:32,624 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:12:32,625 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:32,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:32,626 INFO L82 PathProgramCache]: Analyzing trace with hash -621756731, now seen corresponding path program 1 times [2019-10-13 21:12:32,626 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:32,626 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308006133] [2019-10-13 21:12:32,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,627 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:32,627 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:32,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:32,875 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-13 21:12:32,875 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308006133] [2019-10-13 21:12:32,875 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:32,876 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:32,876 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457772226] [2019-10-13 21:12:32,877 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:32,877 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:32,877 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:32,878 INFO L87 Difference]: Start difference. First operand 15837 states and 27646 transitions. Second operand 6 states. [2019-10-13 21:12:34,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:34,104 INFO L93 Difference]: Finished difference Result 31736 states and 57173 transitions. [2019-10-13 21:12:34,105 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:34,105 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 224 [2019-10-13 21:12:34,105 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:34,246 INFO L225 Difference]: With dead ends: 31736 [2019-10-13 21:12:34,246 INFO L226 Difference]: Without dead ends: 15965 [2019-10-13 21:12:34,310 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:34,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15965 states. [2019-10-13 21:12:35,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15965 to 15965. [2019-10-13 21:12:35,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15965 states. [2019-10-13 21:12:35,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15965 states to 15965 states and 27774 transitions. [2019-10-13 21:12:35,238 INFO L78 Accepts]: Start accepts. Automaton has 15965 states and 27774 transitions. Word has length 224 [2019-10-13 21:12:35,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:35,239 INFO L462 AbstractCegarLoop]: Abstraction has 15965 states and 27774 transitions. [2019-10-13 21:12:35,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:35,239 INFO L276 IsEmpty]: Start isEmpty. Operand 15965 states and 27774 transitions. [2019-10-13 21:12:35,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 226 [2019-10-13 21:12:35,268 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:35,268 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:35,269 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:35,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:35,269 INFO L82 PathProgramCache]: Analyzing trace with hash 10370827, now seen corresponding path program 1 times [2019-10-13 21:12:35,269 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:35,269 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [287297888] [2019-10-13 21:12:35,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:35,270 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:35,270 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:35,426 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-13 21:12:35,427 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [287297888] [2019-10-13 21:12:35,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:35,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:35,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125945047] [2019-10-13 21:12:35,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:35,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:35,429 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:35,429 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:35,429 INFO L87 Difference]: Start difference. First operand 15965 states and 27774 transitions. Second operand 6 states. [2019-10-13 21:12:36,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:36,751 INFO L93 Difference]: Finished difference Result 32024 states and 57397 transitions. [2019-10-13 21:12:36,751 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:36,752 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 225 [2019-10-13 21:12:36,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:36,869 INFO L225 Difference]: With dead ends: 32024 [2019-10-13 21:12:36,869 INFO L226 Difference]: Without dead ends: 16125 [2019-10-13 21:12:36,921 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:36,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16125 states. [2019-10-13 21:12:37,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16125 to 16125. [2019-10-13 21:12:37,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16125 states. [2019-10-13 21:12:37,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16125 states to 16125 states and 27934 transitions. [2019-10-13 21:12:37,692 INFO L78 Accepts]: Start accepts. Automaton has 16125 states and 27934 transitions. Word has length 225 [2019-10-13 21:12:37,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:12:37,692 INFO L462 AbstractCegarLoop]: Abstraction has 16125 states and 27934 transitions. [2019-10-13 21:12:37,692 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:12:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 16125 states and 27934 transitions. [2019-10-13 21:12:37,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 227 [2019-10-13 21:12:37,724 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:12:37,725 INFO L380 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-13 21:12:37,725 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:12:37,725 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:12:37,725 INFO L82 PathProgramCache]: Analyzing trace with hash 1203917825, now seen corresponding path program 1 times [2019-10-13 21:12:37,726 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:12:37,727 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1292609609] [2019-10-13 21:12:37,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:37,727 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:12:37,727 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:12:37,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:12:37,895 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 82 trivial. 0 not checked. [2019-10-13 21:12:37,896 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1292609609] [2019-10-13 21:12:37,896 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:12:37,896 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:12:37,896 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2121575847] [2019-10-13 21:12:37,897 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:12:37,897 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:12:37,899 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:12:37,900 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:12:37,900 INFO L87 Difference]: Start difference. First operand 16125 states and 27934 transitions. Second operand 6 states. [2019-10-13 21:12:39,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:12:39,627 INFO L93 Difference]: Finished difference Result 32376 states and 57685 transitions. [2019-10-13 21:12:39,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:12:39,628 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 226 [2019-10-13 21:12:39,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:12:39,733 INFO L225 Difference]: With dead ends: 32376 [2019-10-13 21:12:39,734 INFO L226 Difference]: Without dead ends: 16317 [2019-10-13 21:12:39,787 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:12:39,802 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16317 states.