java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:06,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:06,741 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:06,760 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:06,760 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:06,762 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:06,764 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:06,774 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:06,778 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:06,782 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:06,783 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:06,785 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:06,785 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:06,786 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:06,789 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:06,790 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:06,791 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:06,792 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:06,793 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:06,798 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:06,802 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:06,804 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:06,807 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:06,807 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:06,809 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:06,809 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:06,810 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:06,811 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:06,812 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:06,813 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:06,813 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:06,814 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:06,815 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:06,815 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:06,817 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:06,817 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:06,818 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:06,818 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:06,818 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:06,819 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:06,820 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:06,821 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:09:06,853 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:06,856 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:06,858 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:06,858 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:06,858 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:06,858 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:06,858 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:06,859 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:06,859 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:06,859 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:06,859 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:06,859 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:06,860 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:06,860 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:06,860 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:06,860 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:06,860 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:06,861 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:06,861 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:06,861 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:06,861 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:06,861 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:06,862 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:06,862 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:06,862 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:06,862 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:06,862 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:06,862 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:06,863 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:09:07,168 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:07,182 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:07,185 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:07,187 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:07,188 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:07,188 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c [2019-10-13 21:09:07,271 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca8523fa/1f1162961dc44c8296ccabc27ce068e8/FLAG1399daf6a [2019-10-13 21:09:07,901 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:07,902 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product24.cil.c [2019-10-13 21:09:07,919 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca8523fa/1f1162961dc44c8296ccabc27ce068e8/FLAG1399daf6a [2019-10-13 21:09:08,125 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bca8523fa/1f1162961dc44c8296ccabc27ce068e8 [2019-10-13 21:09:08,136 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:08,137 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:08,138 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:08,139 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:08,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:08,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,146 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@18ad9034 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08, skipping insertion in model container [2019-10-13 21:09:08,147 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,155 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:08,236 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:09,001 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:09,031 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:09,170 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:09,254 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:09,255 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09 WrapperNode [2019-10-13 21:09:09,255 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:09,256 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:09,256 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:09,256 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:09,272 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,273 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,309 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,310 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,388 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,410 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,421 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (1/1) ... [2019-10-13 21:09:09,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:09,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:09,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:09,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:09,462 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (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:09:09,543 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:09,544 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:09,545 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:09,546 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:09,547 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:09,547 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:09,547 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:09,548 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:09,548 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:09,548 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:09,551 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:09,551 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:09,551 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,552 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:09,553 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:09,553 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:09,553 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:09:09,553 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:09,553 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:09,554 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:09,555 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:09:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:09,556 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:09,557 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift__wrappee__executivefloor [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printState__wrappee__executivefloor [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,558 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:09,559 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:09,560 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:09,560 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:09,560 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:09,561 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:09,562 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:09,563 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:09,564 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:09,565 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:09,566 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:09,567 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:09,568 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:09,569 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:09,570 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:09,571 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:09,572 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:09,573 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:09,574 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:09,575 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:09,576 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:09,577 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:09:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:09,578 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:09,579 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:09,580 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:09:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__twothirdsfull [2019-10-13 21:09:09,583 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:09,584 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:09:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__twothirdsfull [2019-10-13 21:09:09,585 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift__wrappee__executivefloor [2019-10-13 21:09:09,592 INFO L130 BoogieDeclarations]: Found specification of procedure printState__wrappee__executivefloor [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:09,593 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:09,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:09,595 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:09,596 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:09,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:12,067 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:12,068 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:12,070 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:12 BoogieIcfgContainer [2019-10-13 21:09:12,070 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:12,073 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:12,073 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:12,077 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:12,078 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:08" (1/3) ... [2019-10-13 21:09:12,078 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ddd208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:12, skipping insertion in model container [2019-10-13 21:09:12,079 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:09" (2/3) ... [2019-10-13 21:09:12,079 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62ddd208 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:12, skipping insertion in model container [2019-10-13 21:09:12,080 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:12" (3/3) ... [2019-10-13 21:09:12,083 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product24.cil.c [2019-10-13 21:09:12,094 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:12,106 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:12,121 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:12,166 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:12,167 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:12,167 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:12,167 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:12,167 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:12,167 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:12,167 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:12,167 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:12,215 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states. [2019-10-13 21:09:12,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2019-10-13 21:09:12,242 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,244 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:12,247 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,254 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,254 INFO L82 PathProgramCache]: Analyzing trace with hash -1147677768, now seen corresponding path program 1 times [2019-10-13 21:09:12,267 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,267 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656836040] [2019-10-13 21:09:12,268 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,269 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,269 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:12,908 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656836040] [2019-10-13 21:09:12,909 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,909 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,910 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [595499486] [2019-10-13 21:09:12,915 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,916 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,934 INFO L87 Difference]: Start difference. First operand 782 states. Second operand 4 states. [2019-10-13 21:09:13,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,162 INFO L93 Difference]: Finished difference Result 1248 states and 1986 transitions. [2019-10-13 21:09:13,166 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:13,167 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 87 [2019-10-13 21:09:13,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,209 INFO L225 Difference]: With dead ends: 1248 [2019-10-13 21:09:13,209 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:09:13,225 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:09:13,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:09:13,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:09:13,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:09:13,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 984 transitions. [2019-10-13 21:09:13,364 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 984 transitions. Word has length 87 [2019-10-13 21:09:13,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,365 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 984 transitions. [2019-10-13 21:09:13,365 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,365 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 984 transitions. [2019-10-13 21:09:13,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2019-10-13 21:09:13,371 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,371 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:13,371 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,372 INFO L82 PathProgramCache]: Analyzing trace with hash 169764925, now seen corresponding path program 1 times [2019-10-13 21:09:13,372 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,372 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94467900] [2019-10-13 21:09:13,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,373 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,373 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,575 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:13,575 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94467900] [2019-10-13 21:09:13,575 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,576 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [720454258] [2019-10-13 21:09:13,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,589 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,590 INFO L87 Difference]: Start difference. First operand 627 states and 984 transitions. Second operand 4 states. [2019-10-13 21:09:13,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,705 INFO L93 Difference]: Finished difference Result 1221 states and 1929 transitions. [2019-10-13 21:09:13,706 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,706 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 88 [2019-10-13 21:09:13,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,718 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:09:13,719 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:09:13,725 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:09:13,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:09:13,753 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:09:13,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:09:13,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 983 transitions. [2019-10-13 21:09:13,760 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 983 transitions. Word has length 88 [2019-10-13 21:09:13,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,761 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 983 transitions. [2019-10-13 21:09:13,761 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,761 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 983 transitions. [2019-10-13 21:09:13,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-10-13 21:09:13,763 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,764 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:13,765 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,765 INFO L82 PathProgramCache]: Analyzing trace with hash -1535536684, now seen corresponding path program 1 times [2019-10-13 21:09:13,765 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,766 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093616978] [2019-10-13 21:09:13,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,766 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,767 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,991 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:13,992 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093616978] [2019-10-13 21:09:13,992 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,992 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29874745] [2019-10-13 21:09:13,993 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,996 INFO L87 Difference]: Start difference. First operand 627 states and 983 transitions. Second operand 4 states. [2019-10-13 21:09:14,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,100 INFO L93 Difference]: Finished difference Result 1221 states and 1928 transitions. [2019-10-13 21:09:14,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,101 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 89 [2019-10-13 21:09:14,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,110 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:09:14,110 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:09:14,114 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:09:14,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:09:14,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:09:14,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:09:14,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 982 transitions. [2019-10-13 21:09:14,176 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 982 transitions. Word has length 89 [2019-10-13 21:09:14,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,177 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 982 transitions. [2019-10-13 21:09:14,177 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,177 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 982 transitions. [2019-10-13 21:09:14,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-10-13 21:09:14,181 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,181 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:14,182 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,182 INFO L82 PathProgramCache]: Analyzing trace with hash 1838336153, now seen corresponding path program 1 times [2019-10-13 21:09:14,182 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,183 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560733812] [2019-10-13 21:09:14,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,183 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,186 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:14,356 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560733812] [2019-10-13 21:09:14,356 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,356 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,356 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331206367] [2019-10-13 21:09:14,357 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,357 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,358 INFO L87 Difference]: Start difference. First operand 627 states and 982 transitions. Second operand 4 states. [2019-10-13 21:09:14,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,462 INFO L93 Difference]: Finished difference Result 1221 states and 1927 transitions. [2019-10-13 21:09:14,463 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,463 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 90 [2019-10-13 21:09:14,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,469 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:09:14,470 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:09:14,473 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:09:14,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:09:14,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:09:14,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:09:14,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 981 transitions. [2019-10-13 21:09:14,506 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 981 transitions. Word has length 90 [2019-10-13 21:09:14,507 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,507 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 981 transitions. [2019-10-13 21:09:14,507 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,507 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 981 transitions. [2019-10-13 21:09:14,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-10-13 21:09:14,510 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,510 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:14,511 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,511 INFO L82 PathProgramCache]: Analyzing trace with hash -542140432, now seen corresponding path program 1 times [2019-10-13 21:09:14,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,512 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1146254668] [2019-10-13 21:09:14,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,512 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,513 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,657 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:14,657 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1146254668] [2019-10-13 21:09:14,657 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,658 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,658 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620153327] [2019-10-13 21:09:14,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,659 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,659 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,659 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,659 INFO L87 Difference]: Start difference. First operand 627 states and 981 transitions. Second operand 4 states. [2019-10-13 21:09:14,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,731 INFO L93 Difference]: Finished difference Result 1221 states and 1926 transitions. [2019-10-13 21:09:14,732 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,732 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 91 [2019-10-13 21:09:14,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,738 INFO L225 Difference]: With dead ends: 1221 [2019-10-13 21:09:14,739 INFO L226 Difference]: Without dead ends: 627 [2019-10-13 21:09:14,743 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:09:14,745 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 627 states. [2019-10-13 21:09:14,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 627 to 627. [2019-10-13 21:09:14,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 627 states. [2019-10-13 21:09:14,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 627 states to 627 states and 980 transitions. [2019-10-13 21:09:14,774 INFO L78 Accepts]: Start accepts. Automaton has 627 states and 980 transitions. Word has length 91 [2019-10-13 21:09:14,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,775 INFO L462 AbstractCegarLoop]: Abstraction has 627 states and 980 transitions. [2019-10-13 21:09:14,775 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,775 INFO L276 IsEmpty]: Start isEmpty. Operand 627 states and 980 transitions. [2019-10-13 21:09:14,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:09:14,777 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,778 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:14,778 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,779 INFO L82 PathProgramCache]: Analyzing trace with hash -918822667, now seen corresponding path program 1 times [2019-10-13 21:09:14,779 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,779 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1762812268] [2019-10-13 21:09:14,779 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,780 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,080 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:15,080 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1762812268] [2019-10-13 21:09:15,081 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,082 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:15,082 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740686287] [2019-10-13 21:09:15,083 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:15,083 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,083 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:15,084 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:15,084 INFO L87 Difference]: Start difference. First operand 627 states and 980 transitions. Second operand 10 states. [2019-10-13 21:09:15,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,298 INFO L93 Difference]: Finished difference Result 1226 states and 1933 transitions. [2019-10-13 21:09:15,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:15,298 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 92 [2019-10-13 21:09:15,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,305 INFO L225 Difference]: With dead ends: 1226 [2019-10-13 21:09:15,306 INFO L226 Difference]: Without dead ends: 636 [2019-10-13 21:09:15,311 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:09:15,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 636 states. [2019-10-13 21:09:15,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 636 to 634. [2019-10-13 21:09:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 634 states. [2019-10-13 21:09:15,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 634 states to 634 states and 990 transitions. [2019-10-13 21:09:15,352 INFO L78 Accepts]: Start accepts. Automaton has 634 states and 990 transitions. Word has length 92 [2019-10-13 21:09:15,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,352 INFO L462 AbstractCegarLoop]: Abstraction has 634 states and 990 transitions. [2019-10-13 21:09:15,353 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:15,353 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 990 transitions. [2019-10-13 21:09:15,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-10-13 21:09:15,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,358 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:15,358 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,359 INFO L82 PathProgramCache]: Analyzing trace with hash -817910700, now seen corresponding path program 1 times [2019-10-13 21:09:15,359 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [330442106] [2019-10-13 21:09:15,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,359 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:15,478 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [330442106] [2019-10-13 21:09:15,478 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,478 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:15,478 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283671] [2019-10-13 21:09:15,479 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:15,479 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,480 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:15,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:15,481 INFO L87 Difference]: Start difference. First operand 634 states and 990 transitions. Second operand 4 states. [2019-10-13 21:09:15,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,552 INFO L93 Difference]: Finished difference Result 1227 states and 1934 transitions. [2019-10-13 21:09:15,553 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:15,553 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 92 [2019-10-13 21:09:15,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,560 INFO L225 Difference]: With dead ends: 1227 [2019-10-13 21:09:15,560 INFO L226 Difference]: Without dead ends: 630 [2019-10-13 21:09:15,564 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:09:15,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 630 states. [2019-10-13 21:09:15,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 630 to 630. [2019-10-13 21:09:15,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 630 states. [2019-10-13 21:09:15,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 630 states to 630 states and 983 transitions. [2019-10-13 21:09:15,592 INFO L78 Accepts]: Start accepts. Automaton has 630 states and 983 transitions. Word has length 92 [2019-10-13 21:09:15,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,592 INFO L462 AbstractCegarLoop]: Abstraction has 630 states and 983 transitions. [2019-10-13 21:09:15,593 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:15,593 INFO L276 IsEmpty]: Start isEmpty. Operand 630 states and 983 transitions. [2019-10-13 21:09:15,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2019-10-13 21:09:15,596 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,596 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:15,596 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,597 INFO L82 PathProgramCache]: Analyzing trace with hash -1716994026, now seen corresponding path program 1 times [2019-10-13 21:09:15,597 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,597 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045816751] [2019-10-13 21:09:15,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,598 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,836 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:15,837 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045816751] [2019-10-13 21:09:15,837 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,838 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,838 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577641114] [2019-10-13 21:09:15,839 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,839 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,839 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,840 INFO L87 Difference]: Start difference. First operand 630 states and 983 transitions. Second operand 6 states. [2019-10-13 21:09:16,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,227 INFO L93 Difference]: Finished difference Result 1240 states and 1958 transitions. [2019-10-13 21:09:16,227 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:16,227 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 93 [2019-10-13 21:09:16,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,234 INFO L225 Difference]: With dead ends: 1240 [2019-10-13 21:09:16,234 INFO L226 Difference]: Without dead ends: 638 [2019-10-13 21:09:16,238 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:09:16,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 638 states. [2019-10-13 21:09:16,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 638 to 635. [2019-10-13 21:09:16,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:09:16,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 984 transitions. [2019-10-13 21:09:16,272 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 984 transitions. Word has length 93 [2019-10-13 21:09:16,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,277 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 984 transitions. [2019-10-13 21:09:16,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,277 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 984 transitions. [2019-10-13 21:09:16,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2019-10-13 21:09:16,278 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,279 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:16,279 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,279 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,279 INFO L82 PathProgramCache]: Analyzing trace with hash 466217464, now seen corresponding path program 1 times [2019-10-13 21:09:16,280 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,280 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455222315] [2019-10-13 21:09:16,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,280 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,280 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,425 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:16,425 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455222315] [2019-10-13 21:09:16,427 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,427 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,427 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [868668152] [2019-10-13 21:09:16,428 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,428 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,429 INFO L87 Difference]: Start difference. First operand 635 states and 984 transitions. Second operand 6 states. [2019-10-13 21:09:16,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,661 INFO L93 Difference]: Finished difference Result 1203 states and 1873 transitions. [2019-10-13 21:09:16,662 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,662 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 94 [2019-10-13 21:09:16,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,669 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:09:16,669 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:09:16,673 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:09:16,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:09:16,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:09:16,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:09:16,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 980 transitions. [2019-10-13 21:09:16,700 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 980 transitions. Word has length 94 [2019-10-13 21:09:16,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,701 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 980 transitions. [2019-10-13 21:09:16,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,701 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 980 transitions. [2019-10-13 21:09:16,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:09:16,703 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,703 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:16,703 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,703 INFO L82 PathProgramCache]: Analyzing trace with hash -1611435045, now seen corresponding path program 1 times [2019-10-13 21:09:16,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209286512] [2019-10-13 21:09:16,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,832 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:16,833 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209286512] [2019-10-13 21:09:16,833 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,833 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,833 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040506682] [2019-10-13 21:09:16,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,834 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,834 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,835 INFO L87 Difference]: Start difference. First operand 635 states and 980 transitions. Second operand 6 states. [2019-10-13 21:09:17,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,191 INFO L93 Difference]: Finished difference Result 1203 states and 1869 transitions. [2019-10-13 21:09:17,192 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,192 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 95 [2019-10-13 21:09:17,193 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,199 INFO L225 Difference]: With dead ends: 1203 [2019-10-13 21:09:17,199 INFO L226 Difference]: Without dead ends: 635 [2019-10-13 21:09:17,207 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:09:17,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2019-10-13 21:09:17,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 635. [2019-10-13 21:09:17,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 635 states. [2019-10-13 21:09:17,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 635 states to 635 states and 976 transitions. [2019-10-13 21:09:17,238 INFO L78 Accepts]: Start accepts. Automaton has 635 states and 976 transitions. Word has length 95 [2019-10-13 21:09:17,238 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,239 INFO L462 AbstractCegarLoop]: Abstraction has 635 states and 976 transitions. [2019-10-13 21:09:17,239 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,239 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 976 transitions. [2019-10-13 21:09:17,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2019-10-13 21:09:17,241 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,241 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:17,241 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,242 INFO L82 PathProgramCache]: Analyzing trace with hash 1788227675, now seen corresponding path program 1 times [2019-10-13 21:09:17,242 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,242 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225337694] [2019-10-13 21:09:17,242 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,243 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,243 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,373 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:17,374 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225337694] [2019-10-13 21:09:17,374 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,374 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:17,375 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431617160] [2019-10-13 21:09:17,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:17,375 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,375 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:17,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:17,376 INFO L87 Difference]: Start difference. First operand 635 states and 976 transitions. Second operand 7 states. [2019-10-13 21:09:17,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,480 INFO L93 Difference]: Finished difference Result 1206 states and 1869 transitions. [2019-10-13 21:09:17,481 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:17,481 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 95 [2019-10-13 21:09:17,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,487 INFO L225 Difference]: With dead ends: 1206 [2019-10-13 21:09:17,487 INFO L226 Difference]: Without dead ends: 617 [2019-10-13 21:09:17,491 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:09:17,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2019-10-13 21:09:17,511 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 614. [2019-10-13 21:09:17,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:09:17,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 939 transitions. [2019-10-13 21:09:17,515 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 939 transitions. Word has length 95 [2019-10-13 21:09:17,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,516 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 939 transitions. [2019-10-13 21:09:17,516 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 939 transitions. [2019-10-13 21:09:17,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-10-13 21:09:17,517 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,518 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:17,518 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1663081949, now seen corresponding path program 1 times [2019-10-13 21:09:17,519 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,519 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2117674460] [2019-10-13 21:09:17,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,519 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,519 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,632 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:17,633 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2117674460] [2019-10-13 21:09:17,633 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,633 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,633 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135336898] [2019-10-13 21:09:17,634 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,634 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,634 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,634 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,635 INFO L87 Difference]: Start difference. First operand 614 states and 939 transitions. Second operand 6 states. [2019-10-13 21:09:17,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,767 INFO L93 Difference]: Finished difference Result 1182 states and 1828 transitions. [2019-10-13 21:09:17,767 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,768 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 96 [2019-10-13 21:09:17,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,773 INFO L225 Difference]: With dead ends: 1182 [2019-10-13 21:09:17,774 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:09:17,777 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:09:17,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:09:17,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:09:17,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:09:17,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 938 transitions. [2019-10-13 21:09:17,800 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 938 transitions. Word has length 96 [2019-10-13 21:09:17,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,800 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 938 transitions. [2019-10-13 21:09:17,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,801 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 938 transitions. [2019-10-13 21:09:17,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2019-10-13 21:09:17,802 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,802 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:17,803 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,803 INFO L82 PathProgramCache]: Analyzing trace with hash -943838304, now seen corresponding path program 1 times [2019-10-13 21:09:17,803 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,803 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502723129] [2019-10-13 21:09:17,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,804 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,843 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,966 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:17,967 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502723129] [2019-10-13 21:09:17,967 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,967 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,967 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925206752] [2019-10-13 21:09:17,968 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,968 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,968 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,969 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,969 INFO L87 Difference]: Start difference. First operand 614 states and 938 transitions. Second operand 6 states. [2019-10-13 21:09:18,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,095 INFO L93 Difference]: Finished difference Result 1182 states and 1827 transitions. [2019-10-13 21:09:18,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:18,096 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 97 [2019-10-13 21:09:18,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,101 INFO L225 Difference]: With dead ends: 1182 [2019-10-13 21:09:18,101 INFO L226 Difference]: Without dead ends: 614 [2019-10-13 21:09:18,105 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:09:18,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 614 states. [2019-10-13 21:09:18,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 614 to 614. [2019-10-13 21:09:18,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 614 states. [2019-10-13 21:09:18,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 614 states to 614 states and 937 transitions. [2019-10-13 21:09:18,127 INFO L78 Accepts]: Start accepts. Automaton has 614 states and 937 transitions. Word has length 97 [2019-10-13 21:09:18,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,127 INFO L462 AbstractCegarLoop]: Abstraction has 614 states and 937 transitions. [2019-10-13 21:09:18,127 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:18,127 INFO L276 IsEmpty]: Start isEmpty. Operand 614 states and 937 transitions. [2019-10-13 21:09:18,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2019-10-13 21:09:18,129 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,129 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:18,129 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,130 INFO L82 PathProgramCache]: Analyzing trace with hash -1191719486, now seen corresponding path program 1 times [2019-10-13 21:09:18,130 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,130 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1573056265] [2019-10-13 21:09:18,130 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,131 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,297 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:18,297 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1573056265] [2019-10-13 21:09:18,297 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:18,298 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:18,298 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064835280] [2019-10-13 21:09:18,298 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:18,299 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:18,299 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:18,299 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:18,299 INFO L87 Difference]: Start difference. First operand 614 states and 937 transitions. Second operand 12 states. [2019-10-13 21:09:18,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,555 INFO L93 Difference]: Finished difference Result 1188 states and 1837 transitions. [2019-10-13 21:09:18,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:18,555 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 98 [2019-10-13 21:09:18,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,561 INFO L225 Difference]: With dead ends: 1188 [2019-10-13 21:09:18,561 INFO L226 Difference]: Without dead ends: 621 [2019-10-13 21:09:18,565 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:09:18,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 621 states. [2019-10-13 21:09:18,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 621 to 619. [2019-10-13 21:09:18,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 619 states. [2019-10-13 21:09:18,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 619 states to 619 states and 943 transitions. [2019-10-13 21:09:18,588 INFO L78 Accepts]: Start accepts. Automaton has 619 states and 943 transitions. Word has length 98 [2019-10-13 21:09:18,588 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,588 INFO L462 AbstractCegarLoop]: Abstraction has 619 states and 943 transitions. [2019-10-13 21:09:18,588 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:18,589 INFO L276 IsEmpty]: Start isEmpty. Operand 619 states and 943 transitions. [2019-10-13 21:09:18,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-10-13 21:09:18,590 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,590 INFO L380 BasicCegarLoop]: trace histogram [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] [2019-10-13 21:09:18,591 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1942578085, now seen corresponding path program 1 times [2019-10-13 21:09:18,591 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,592 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116604164] [2019-10-13 21:09:18,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,592 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,592 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,715 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-10-13 21:09:18,716 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116604164] [2019-10-13 21:09:18,716 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:18,716 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:09:18,716 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [839078188] [2019-10-13 21:09:18,717 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:18,717 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:18,717 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:18,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:18,718 INFO L87 Difference]: Start difference. First operand 619 states and 943 transitions. Second operand 3 states. [2019-10-13 21:09:18,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,894 INFO L93 Difference]: Finished difference Result 1747 states and 2726 transitions. [2019-10-13 21:09:18,895 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:18,895 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 99 [2019-10-13 21:09:18,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,905 INFO L225 Difference]: With dead ends: 1747 [2019-10-13 21:09:18,906 INFO L226 Difference]: Without dead ends: 1181 [2019-10-13 21:09:18,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:18,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1181 states. [2019-10-13 21:09:18,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1181 to 1111. [2019-10-13 21:09:18,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1111 states. [2019-10-13 21:09:18,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1111 states to 1111 states and 1724 transitions. [2019-10-13 21:09:18,977 INFO L78 Accepts]: Start accepts. Automaton has 1111 states and 1724 transitions. Word has length 99 [2019-10-13 21:09:18,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,977 INFO L462 AbstractCegarLoop]: Abstraction has 1111 states and 1724 transitions. [2019-10-13 21:09:18,977 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:18,977 INFO L276 IsEmpty]: Start isEmpty. Operand 1111 states and 1724 transitions. [2019-10-13 21:09:18,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:09:18,983 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,983 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:18,983 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,983 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,984 INFO L82 PathProgramCache]: Analyzing trace with hash 821563057, now seen corresponding path program 1 times [2019-10-13 21:09:18,984 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,984 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94382191] [2019-10-13 21:09:18,984 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,985 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:19,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,275 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:09:19,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94382191] [2019-10-13 21:09:19,276 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257035999] [2019-10-13 21:09:19,276 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:09:19,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,860 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-13 21:09:19,877 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:19,934 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2019-10-13 21:09:19,935 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:20,108 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 21:09:20,108 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:20,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:20,109 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1649416291] [2019-10-13 21:09:20,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:20,111 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:20,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:20,111 INFO L87 Difference]: Start difference. First operand 1111 states and 1724 transitions. Second operand 3 states. [2019-10-13 21:09:20,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,298 INFO L93 Difference]: Finished difference Result 3215 states and 5106 transitions. [2019-10-13 21:09:20,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:20,298 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 157 [2019-10-13 21:09:20,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,313 INFO L225 Difference]: With dead ends: 3215 [2019-10-13 21:09:20,314 INFO L226 Difference]: Without dead ends: 2158 [2019-10-13 21:09:20,320 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 328 GetRequests, 319 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:20,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2158 states. [2019-10-13 21:09:20,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2158 to 2145. [2019-10-13 21:09:20,408 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2145 states. [2019-10-13 21:09:20,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2145 states to 2145 states and 3380 transitions. [2019-10-13 21:09:20,419 INFO L78 Accepts]: Start accepts. Automaton has 2145 states and 3380 transitions. Word has length 157 [2019-10-13 21:09:20,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,420 INFO L462 AbstractCegarLoop]: Abstraction has 2145 states and 3380 transitions. [2019-10-13 21:09:20,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:20,420 INFO L276 IsEmpty]: Start isEmpty. Operand 2145 states and 3380 transitions. [2019-10-13 21:09:20,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 158 [2019-10-13 21:09:20,428 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,428 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:20,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:20,641 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,642 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,642 INFO L82 PathProgramCache]: Analyzing trace with hash -1628037073, now seen corresponding path program 1 times [2019-10-13 21:09:20,644 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234386043] [2019-10-13 21:09:20,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,877 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:09:20,877 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234386043] [2019-10-13 21:09:20,878 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1599667082] [2019-10-13 21:09:20,878 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:09:21,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 2893 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-13 21:09:21,439 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:21,589 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:21,590 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:21,921 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2019-10-13 21:09:21,922 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:21,922 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10, 6] total 15 [2019-10-13 21:09:21,922 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603852695] [2019-10-13 21:09:21,923 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:21,923 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:21,924 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=174, Unknown=0, NotChecked=0, Total=210 [2019-10-13 21:09:21,924 INFO L87 Difference]: Start difference. First operand 2145 states and 3380 transitions. Second operand 6 states. [2019-10-13 21:09:22,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,819 INFO L93 Difference]: Finished difference Result 5554 states and 8754 transitions. [2019-10-13 21:09:22,819 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:22,819 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 157 [2019-10-13 21:09:22,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,844 INFO L225 Difference]: With dead ends: 5554 [2019-10-13 21:09:22,845 INFO L226 Difference]: Without dead ends: 3462 [2019-10-13 21:09:22,857 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 306 SyntacticMatches, 9 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:22,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3462 states. [2019-10-13 21:09:23,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3462 to 3459. [2019-10-13 21:09:23,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3459 states. [2019-10-13 21:09:23,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3459 states to 3459 states and 5386 transitions. [2019-10-13 21:09:23,027 INFO L78 Accepts]: Start accepts. Automaton has 3459 states and 5386 transitions. Word has length 157 [2019-10-13 21:09:23,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,028 INFO L462 AbstractCegarLoop]: Abstraction has 3459 states and 5386 transitions. [2019-10-13 21:09:23,028 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:23,028 INFO L276 IsEmpty]: Start isEmpty. Operand 3459 states and 5386 transitions. [2019-10-13 21:09:23,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2019-10-13 21:09:23,035 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,035 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:23,243 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:23,243 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,243 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,243 INFO L82 PathProgramCache]: Analyzing trace with hash -1218551059, now seen corresponding path program 1 times [2019-10-13 21:09:23,243 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,244 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198392773] [2019-10-13 21:09:23,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,244 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,244 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,321 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,541 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-13 21:09:23,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198392773] [2019-10-13 21:09:23,541 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274620851] [2019-10-13 21:09:23,542 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:09:24,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 2890 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:24,271 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:24,367 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 15 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:24,367 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:24,746 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:24,746 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:24,746 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:09:24,746 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556487477] [2019-10-13 21:09:24,748 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:24,748 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,748 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:24,749 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:24,749 INFO L87 Difference]: Start difference. First operand 3459 states and 5386 transitions. Second operand 5 states. [2019-10-13 21:09:25,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,716 INFO L93 Difference]: Finished difference Result 6929 states and 11200 transitions. [2019-10-13 21:09:25,717 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 158 [2019-10-13 21:09:25,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,745 INFO L225 Difference]: With dead ends: 6929 [2019-10-13 21:09:25,745 INFO L226 Difference]: Without dead ends: 3523 [2019-10-13 21:09:25,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 338 GetRequests, 316 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:09:25,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3523 states. [2019-10-13 21:09:25,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3523 to 3523. [2019-10-13 21:09:25,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3523 states. [2019-10-13 21:09:26,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3523 states to 3523 states and 5490 transitions. [2019-10-13 21:09:26,081 INFO L78 Accepts]: Start accepts. Automaton has 3523 states and 5490 transitions. Word has length 158 [2019-10-13 21:09:26,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:26,082 INFO L462 AbstractCegarLoop]: Abstraction has 3523 states and 5490 transitions. [2019-10-13 21:09:26,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:26,083 INFO L276 IsEmpty]: Start isEmpty. Operand 3523 states and 5490 transitions. [2019-10-13 21:09:26,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:09:26,093 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:26,094 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:26,303 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:26,303 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:26,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:26,304 INFO L82 PathProgramCache]: Analyzing trace with hash 1227694304, now seen corresponding path program 1 times [2019-10-13 21:09:26,304 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:26,304 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231906526] [2019-10-13 21:09:26,304 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,305 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:26,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:26,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,465 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2019-10-13 21:09:26,465 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231906526] [2019-10-13 21:09:26,466 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:26,466 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-13 21:09:26,466 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [244031936] [2019-10-13 21:09:26,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:26,468 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:26,468 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:26,468 INFO L87 Difference]: Start difference. First operand 3523 states and 5490 transitions. Second operand 5 states. [2019-10-13 21:09:29,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,901 INFO L93 Difference]: Finished difference Result 8001 states and 12522 transitions. [2019-10-13 21:09:29,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:29,902 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:09:29,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,936 INFO L225 Difference]: With dead ends: 8001 [2019-10-13 21:09:29,936 INFO L226 Difference]: Without dead ends: 4536 [2019-10-13 21:09:29,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:29,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4536 states. [2019-10-13 21:09:30,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4536 to 4388. [2019-10-13 21:09:30,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4388 states. [2019-10-13 21:09:30,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4388 states to 4388 states and 6797 transitions. [2019-10-13 21:09:30,139 INFO L78 Accepts]: Start accepts. Automaton has 4388 states and 6797 transitions. Word has length 161 [2019-10-13 21:09:30,139 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:30,139 INFO L462 AbstractCegarLoop]: Abstraction has 4388 states and 6797 transitions. [2019-10-13 21:09:30,140 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:30,140 INFO L276 IsEmpty]: Start isEmpty. Operand 4388 states and 6797 transitions. [2019-10-13 21:09:30,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2019-10-13 21:09:30,145 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:30,146 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:30,146 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:30,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:30,147 INFO L82 PathProgramCache]: Analyzing trace with hash 273754146, now seen corresponding path program 1 times [2019-10-13 21:09:30,147 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:30,147 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [368432792] [2019-10-13 21:09:30,147 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,148 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,148 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:30,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,335 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:09:30,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [368432792] [2019-10-13 21:09:30,336 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1596479654] [2019-10-13 21:09:30,337 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:09:30,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,950 INFO L256 TraceCheckSpWp]: Trace formula consists of 2896 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:30,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:31,203 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 17 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:31,204 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2019-10-13 21:09:31,642 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:31,643 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:31,643 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927044251] [2019-10-13 21:09:31,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:31,644 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:31,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:31,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:31,644 INFO L87 Difference]: Start difference. First operand 4388 states and 6797 transitions. Second operand 5 states. [2019-10-13 21:09:32,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:32,873 INFO L93 Difference]: Finished difference Result 8819 states and 14179 transitions. [2019-10-13 21:09:32,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:32,873 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 161 [2019-10-13 21:09:32,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:32,901 INFO L225 Difference]: With dead ends: 8819 [2019-10-13 21:09:32,902 INFO L226 Difference]: Without dead ends: 4484 [2019-10-13 21:09:32,922 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 311 SyntacticMatches, 7 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:32,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4484 states. [2019-10-13 21:09:33,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4484 to 4484. [2019-10-13 21:09:33,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4484 states. [2019-10-13 21:09:33,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4484 states to 4484 states and 6953 transitions. [2019-10-13 21:09:33,167 INFO L78 Accepts]: Start accepts. Automaton has 4484 states and 6953 transitions. Word has length 161 [2019-10-13 21:09:33,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:33,169 INFO L462 AbstractCegarLoop]: Abstraction has 4484 states and 6953 transitions. [2019-10-13 21:09:33,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:33,169 INFO L276 IsEmpty]: Start isEmpty. Operand 4484 states and 6953 transitions. [2019-10-13 21:09:33,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:33,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:33,178 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:33,386 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:33,387 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:33,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:33,387 INFO L82 PathProgramCache]: Analyzing trace with hash -1199640493, now seen corresponding path program 1 times [2019-10-13 21:09:33,387 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:33,387 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [635737858] [2019-10-13 21:09:33,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:33,388 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:33,388 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:33,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:33,639 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:09:33,639 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [635737858] [2019-10-13 21:09:33,640 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [64834567] [2019-10-13 21:09:33,640 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:09:34,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:34,418 INFO L256 TraceCheckSpWp]: Trace formula consists of 2899 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:34,424 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:34,508 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:34,509 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:34,904 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2019-10-13 21:09:34,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:34,905 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 18 [2019-10-13 21:09:34,905 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1626780479] [2019-10-13 21:09:34,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:34,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:34,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:34,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=262, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:34,906 INFO L87 Difference]: Start difference. First operand 4484 states and 6953 transitions. Second operand 5 states. [2019-10-13 21:09:35,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:35,910 INFO L93 Difference]: Finished difference Result 9011 states and 14463 transitions. [2019-10-13 21:09:35,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:35,911 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 164 [2019-10-13 21:09:35,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:35,947 INFO L225 Difference]: With dead ends: 9011 [2019-10-13 21:09:35,948 INFO L226 Difference]: Without dead ends: 4580 [2019-10-13 21:09:35,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 350 GetRequests, 328 SyntacticMatches, 5 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=52, Invalid=290, Unknown=0, NotChecked=0, Total=342 [2019-10-13 21:09:35,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4580 states. [2019-10-13 21:09:36,136 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4580 to 4580. [2019-10-13 21:09:36,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4580 states. [2019-10-13 21:09:36,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4580 states to 4580 states and 7109 transitions. [2019-10-13 21:09:36,157 INFO L78 Accepts]: Start accepts. Automaton has 4580 states and 7109 transitions. Word has length 164 [2019-10-13 21:09:36,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:36,157 INFO L462 AbstractCegarLoop]: Abstraction has 4580 states and 7109 transitions. [2019-10-13 21:09:36,157 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:36,157 INFO L276 IsEmpty]: Start isEmpty. Operand 4580 states and 7109 transitions. [2019-10-13 21:09:36,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:36,163 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:36,163 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 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:09:36,370 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:36,370 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:36,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:36,370 INFO L82 PathProgramCache]: Analyzing trace with hash -544935042, now seen corresponding path program 1 times [2019-10-13 21:09:36,371 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:36,371 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [807977053] [2019-10-13 21:09:36,371 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,372 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:36,372 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:36,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:36,565 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:36,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [807977053] [2019-10-13 21:09:36,566 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023337109] [2019-10-13 21:09:36,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:37,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:37,246 INFO L256 TraceCheckSpWp]: Trace formula consists of 2902 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:37,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:37,328 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:37,328 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:37,729 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2019-10-13 21:09:37,729 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:37,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [11, 6] total 17 [2019-10-13 21:09:37,731 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057845593] [2019-10-13 21:09:37,731 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:37,732 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:37,732 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:37,732 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=233, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:37,732 INFO L87 Difference]: Start difference. First operand 4580 states and 7109 transitions. Second operand 5 states.