java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-15 01:09:27,025 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-15 01:09:27,029 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-15 01:09:27,049 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-15 01:09:27,050 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-15 01:09:27,052 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-15 01:09:27,054 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-15 01:09:27,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-15 01:09:27,069 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-15 01:09:27,073 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-15 01:09:27,074 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-15 01:09:27,076 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-15 01:09:27,076 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-15 01:09:27,078 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-15 01:09:27,081 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-15 01:09:27,083 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-15 01:09:27,084 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-15 01:09:27,086 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-15 01:09:27,087 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-15 01:09:27,092 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-15 01:09:27,097 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-15 01:09:27,098 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-15 01:09:27,100 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-15 01:09:27,101 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-15 01:09:27,104 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-15 01:09:27,104 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-15 01:09:27,104 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-15 01:09:27,106 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-15 01:09:27,107 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-15 01:09:27,108 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-15 01:09:27,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-15 01:09:27,110 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-15 01:09:27,111 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-15 01:09:27,111 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-15 01:09:27,113 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-15 01:09:27,113 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-15 01:09:27,114 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-15 01:09:27,114 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-15 01:09:27,114 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-15 01:09:27,115 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-15 01:09:27,116 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-15 01:09:27,117 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-15 01:09:27,144 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-15 01:09:27,144 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-15 01:09:27,146 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-15 01:09:27,146 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-15 01:09:27,146 INFO L138 SettingsManager]: * Use SBE=true [2019-10-15 01:09:27,146 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-15 01:09:27,147 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-15 01:09:27,147 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-15 01:09:27,147 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-15 01:09:27,147 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-15 01:09:27,147 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-15 01:09:27,148 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-15 01:09:27,148 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-15 01:09:27,148 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-15 01:09:27,148 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-15 01:09:27,148 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-15 01:09:27,149 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-15 01:09:27,149 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-15 01:09:27,149 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-15 01:09:27,149 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-15 01:09:27,149 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-15 01:09:27,150 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:27,150 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-15 01:09:27,150 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-15 01:09:27,150 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-15 01:09:27,150 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-15 01:09:27,151 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-15 01:09:27,151 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-15 01:09:27,151 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-15 01:09:27,472 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-15 01:09:27,497 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-15 01:09:27,500 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-15 01:09:27,502 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-15 01:09:27,502 INFO L275 PluginConnector]: CDTParser initialized [2019-10-15 01:09:27,503 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-15 01:09:27,579 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420a7e66/6138f2fdef364e2391cc574b6468790e/FLAG9121e1070 [2019-10-15 01:09:28,297 INFO L306 CDTParser]: Found 1 translation units. [2019-10-15 01:09:28,297 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec2_product17.cil.c [2019-10-15 01:09:28,316 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420a7e66/6138f2fdef364e2391cc574b6468790e/FLAG9121e1070 [2019-10-15 01:09:28,409 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f420a7e66/6138f2fdef364e2391cc574b6468790e [2019-10-15 01:09:28,420 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-15 01:09:28,422 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-15 01:09:28,423 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:28,423 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-15 01:09:28,428 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-15 01:09:28,429 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:28" (1/1) ... [2019-10-15 01:09:28,432 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7e6a8581 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:28, skipping insertion in model container [2019-10-15 01:09:28,432 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.10 01:09:28" (1/1) ... [2019-10-15 01:09:28,438 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-15 01:09:28,518 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-15 01:09:29,285 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:29,304 INFO L188 MainTranslator]: Completed pre-run [2019-10-15 01:09:29,441 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-15 01:09:29,511 INFO L192 MainTranslator]: Completed translation [2019-10-15 01:09:29,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29 WrapperNode [2019-10-15 01:09:29,512 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-15 01:09:29,513 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-15 01:09:29,514 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-15 01:09:29,514 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-15 01:09:29,527 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,528 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,567 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,568 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,632 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,671 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,695 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... [2019-10-15 01:09:29,707 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-15 01:09:29,708 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-15 01:09:29,708 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-15 01:09:29,708 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-15 01:09:29,710 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-15 01:09:29,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-15 01:09:29,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-15 01:09:29,785 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:29,786 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-15 01:09:29,786 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-15 01:09:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-15 01:09:29,787 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-15 01:09:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-15 01:09:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-15 01:09:29,788 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-15 01:09:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-15 01:09:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-15 01:09:29,789 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-15 01:09:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-15 01:09:29,790 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-15 01:09:29,791 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-15 01:09:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-15 01:09:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-15 01:09:29,793 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-15 01:09:29,794 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-15 01:09:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-15 01:09:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-15 01:09:29,795 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-15 01:09:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-15 01:09:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-15 01:09:29,796 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-15 01:09:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-15 01:09:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-15 01:09:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-15 01:09:29,797 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-15 01:09:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-15 01:09:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-15 01:09:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-15 01:09:29,798 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-15 01:09:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-15 01:09:29,799 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-15 01:09:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-15 01:09:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-15 01:09:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-15 01:09:29,800 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-15 01:09:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-15 01:09:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-15 01:09:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-15 01:09:29,801 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-15 01:09:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-15 01:09:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-15 01:09:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-15 01:09:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-15 01:09:29,802 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-15 01:09:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-15 01:09:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-15 01:09:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-15 01:09:29,803 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-15 01:09:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-15 01:09:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-15 01:09:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-15 01:09:29,804 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-15 01:09:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-15 01:09:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-15 01:09:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-15 01:09:29,805 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-15 01:09:29,806 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-15 01:09:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:29,807 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:29,808 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-15 01:09:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-15 01:09:29,809 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-15 01:09:29,810 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-15 01:09:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-15 01:09:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-15 01:09:29,810 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-15 01:09:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-15 01:09:29,811 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-15 01:09:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-15 01:09:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-15 01:09:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-15 01:09:29,812 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-15 01:09:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-15 01:09:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-15 01:09:29,813 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-15 01:09:29,814 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-15 01:09:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-15 01:09:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-15 01:09:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-15 01:09:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-15 01:09:29,815 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-15 01:09:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-15 01:09:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-15 01:09:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-15 01:09:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-15 01:09:29,816 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-15 01:09:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-15 01:09:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-15 01:09:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-15 01:09:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-15 01:09:29,817 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-15 01:09:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-15 01:09:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-15 01:09:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-15 01:09:29,818 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-15 01:09:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-15 01:09:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-15 01:09:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-15 01:09:29,819 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-15 01:09:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-15 01:09:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-15 01:09:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-15 01:09:29,820 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-15 01:09:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-15 01:09:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-15 01:09:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__1 [2019-10-15 01:09:29,821 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__4 [2019-10-15 01:09:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-15 01:09:29,822 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-15 01:09:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-15 01:09:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-15 01:09:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-15 01:09:29,823 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-15 01:09:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-15 01:09:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-15 01:09:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-15 01:09:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-15 01:09:29,825 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-15 01:09:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-15 01:09:29,826 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-15 01:09:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__2 [2019-10-15 01:09:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-15 01:09:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-15 01:09:29,827 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-15 01:09:29,828 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-15 01:09:29,829 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-15 01:09:29,832 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-15 01:09:29,833 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-15 01:09:29,833 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-15 01:09:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-15 01:09:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification2_spec__3 [2019-10-15 01:09:29,834 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-15 01:09:29,836 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-15 01:09:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-15 01:09:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-15 01:09:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-15 01:09:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-15 01:09:29,843 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-15 01:09:29,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-15 01:09:29,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-15 01:09:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-15 01:09:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-15 01:09:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-15 01:09:29,845 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-15 01:09:29,846 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-15 01:09:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-15 01:09:29,847 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-15 01:09:32,412 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-15 01:09:32,412 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-15 01:09:32,414 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:32 BoogieIcfgContainer [2019-10-15 01:09:32,414 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-15 01:09:32,417 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-15 01:09:32,417 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-15 01:09:32,421 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-15 01:09:32,421 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.10 01:09:28" (1/3) ... [2019-10-15 01:09:32,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76055c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:32, skipping insertion in model container [2019-10-15 01:09:32,422 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.10 01:09:29" (2/3) ... [2019-10-15 01:09:32,422 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@76055c14 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.10 01:09:32, skipping insertion in model container [2019-10-15 01:09:32,423 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.10 01:09:32" (3/3) ... [2019-10-15 01:09:32,424 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec2_product17.cil.c [2019-10-15 01:09:32,435 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-15 01:09:32,447 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-15 01:09:32,459 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-15 01:09:32,519 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-15 01:09:32,519 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-15 01:09:32,519 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-15 01:09:32,520 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-15 01:09:32,520 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-15 01:09:32,520 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-15 01:09:32,520 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-15 01:09:32,520 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-15 01:09:32,574 INFO L276 IsEmpty]: Start isEmpty. Operand 742 states. [2019-10-15 01:09:32,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-10-15 01:09:32,616 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:32,618 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:32,622 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:32,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:32,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1835526368, now seen corresponding path program 1 times [2019-10-15 01:09:32,644 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:32,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [568937078] [2019-10-15 01:09:32,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,645 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:32,645 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:33,345 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:33,346 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [568937078] [2019-10-15 01:09:33,347 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:33,347 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:33,347 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1097876206] [2019-10-15 01:09:33,353 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:33,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:33,370 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:33,371 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:33,374 INFO L87 Difference]: Start difference. First operand 742 states. Second operand 4 states. [2019-10-15 01:09:33,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:33,574 INFO L93 Difference]: Finished difference Result 1147 states and 1871 transitions. [2019-10-15 01:09:33,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:33,577 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 107 [2019-10-15 01:09:33,577 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:33,612 INFO L225 Difference]: With dead ends: 1147 [2019-10-15 01:09:33,612 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:09:33,626 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:33,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:09:33,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:09:33,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:09:33,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 937 transitions. [2019-10-15 01:09:33,749 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 937 transitions. Word has length 107 [2019-10-15 01:09:33,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:33,750 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 937 transitions. [2019-10-15 01:09:33,750 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:33,750 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 937 transitions. [2019-10-15 01:09:33,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 111 [2019-10-15 01:09:33,760 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:33,760 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:33,760 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:33,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:33,762 INFO L82 PathProgramCache]: Analyzing trace with hash 443776321, now seen corresponding path program 1 times [2019-10-15 01:09:33,762 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:33,762 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715661769] [2019-10-15 01:09:33,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,763 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:33,763 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:33,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,016 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,016 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715661769] [2019-10-15 01:09:34,017 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,017 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,017 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1182669396] [2019-10-15 01:09:34,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,024 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,025 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,025 INFO L87 Difference]: Start difference. First operand 582 states and 937 transitions. Second operand 4 states. [2019-10-15 01:09:34,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,121 INFO L93 Difference]: Finished difference Result 1127 states and 1832 transitions. [2019-10-15 01:09:34,121 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,122 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 110 [2019-10-15 01:09:34,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,127 INFO L225 Difference]: With dead ends: 1127 [2019-10-15 01:09:34,128 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:09:34,131 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:09:34,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:09:34,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:09:34,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 936 transitions. [2019-10-15 01:09:34,181 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 936 transitions. Word has length 110 [2019-10-15 01:09:34,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,184 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 936 transitions. [2019-10-15 01:09:34,185 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,186 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 936 transitions. [2019-10-15 01:09:34,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2019-10-15 01:09:34,194 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,195 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,195 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,196 INFO L82 PathProgramCache]: Analyzing trace with hash 15474447, now seen corresponding path program 1 times [2019-10-15 01:09:34,196 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,196 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [821189093] [2019-10-15 01:09:34,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,196 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,197 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,400 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [821189093] [2019-10-15 01:09:34,401 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,401 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,401 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1110282664] [2019-10-15 01:09:34,402 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,403 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,404 INFO L87 Difference]: Start difference. First operand 582 states and 936 transitions. Second operand 4 states. [2019-10-15 01:09:34,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,467 INFO L93 Difference]: Finished difference Result 1127 states and 1831 transitions. [2019-10-15 01:09:34,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,468 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 111 [2019-10-15 01:09:34,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,472 INFO L225 Difference]: With dead ends: 1127 [2019-10-15 01:09:34,473 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:09:34,475 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:09:34,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:09:34,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:09:34,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 935 transitions. [2019-10-15 01:09:34,502 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 935 transitions. Word has length 111 [2019-10-15 01:09:34,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,503 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 935 transitions. [2019-10-15 01:09:34,503 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,503 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 935 transitions. [2019-10-15 01:09:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 113 [2019-10-15 01:09:34,506 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,507 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,507 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1301085565, now seen corresponding path program 1 times [2019-10-15 01:09:34,508 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,508 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084388462] [2019-10-15 01:09:34,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,508 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,508 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,629 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,630 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084388462] [2019-10-15 01:09:34,630 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,630 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,630 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216181069] [2019-10-15 01:09:34,632 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,633 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,633 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,633 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,633 INFO L87 Difference]: Start difference. First operand 582 states and 935 transitions. Second operand 4 states. [2019-10-15 01:09:34,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,701 INFO L93 Difference]: Finished difference Result 1127 states and 1830 transitions. [2019-10-15 01:09:34,702 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,702 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 112 [2019-10-15 01:09:34,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,710 INFO L225 Difference]: With dead ends: 1127 [2019-10-15 01:09:34,710 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:09:34,713 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:09:34,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:09:34,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:09:34,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 934 transitions. [2019-10-15 01:09:34,747 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 934 transitions. Word has length 112 [2019-10-15 01:09:34,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,748 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 934 transitions. [2019-10-15 01:09:34,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,749 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 934 transitions. [2019-10-15 01:09:34,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-10-15 01:09:34,752 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,753 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,753 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,753 INFO L82 PathProgramCache]: Analyzing trace with hash -116575413, now seen corresponding path program 1 times [2019-10-15 01:09:34,754 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,754 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1875038760] [2019-10-15 01:09:34,754 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,755 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,755 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:34,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:34,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:34,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1875038760] [2019-10-15 01:09:34,891 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:34,891 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:34,891 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184749406] [2019-10-15 01:09:34,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:34,892 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:34,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:34,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:34,893 INFO L87 Difference]: Start difference. First operand 582 states and 934 transitions. Second operand 4 states. [2019-10-15 01:09:34,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:34,943 INFO L93 Difference]: Finished difference Result 1127 states and 1829 transitions. [2019-10-15 01:09:34,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:34,944 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 113 [2019-10-15 01:09:34,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:34,948 INFO L225 Difference]: With dead ends: 1127 [2019-10-15 01:09:34,948 INFO L226 Difference]: Without dead ends: 582 [2019-10-15 01:09:34,951 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:34,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-15 01:09:34,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-15 01:09:34,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-15 01:09:34,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 933 transitions. [2019-10-15 01:09:34,972 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 933 transitions. Word has length 113 [2019-10-15 01:09:34,972 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:34,972 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 933 transitions. [2019-10-15 01:09:34,972 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:34,972 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 933 transitions. [2019-10-15 01:09:34,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:34,975 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:34,976 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:34,976 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:34,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:34,976 INFO L82 PathProgramCache]: Analyzing trace with hash 563674553, now seen corresponding path program 1 times [2019-10-15 01:09:34,977 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:34,977 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1833252403] [2019-10-15 01:09:34,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,977 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:34,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,222 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1833252403] [2019-10-15 01:09:35,223 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,223 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-15 01:09:35,223 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1807498727] [2019-10-15 01:09:35,223 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-15 01:09:35,224 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-15 01:09:35,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-15 01:09:35,225 INFO L87 Difference]: Start difference. First operand 582 states and 933 transitions. Second operand 10 states. [2019-10-15 01:09:35,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,406 INFO L93 Difference]: Finished difference Result 1085 states and 1749 transitions. [2019-10-15 01:09:35,406 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-15 01:09:35,407 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 114 [2019-10-15 01:09:35,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,412 INFO L225 Difference]: With dead ends: 1085 [2019-10-15 01:09:35,412 INFO L226 Difference]: Without dead ends: 591 [2019-10-15 01:09:35,415 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-15 01:09:35,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-15 01:09:35,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-15 01:09:35,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-15 01:09:35,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 942 transitions. [2019-10-15 01:09:35,446 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 942 transitions. Word has length 114 [2019-10-15 01:09:35,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,447 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 942 transitions. [2019-10-15 01:09:35,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-15 01:09:35,447 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 942 transitions. [2019-10-15 01:09:35,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2019-10-15 01:09:35,454 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,455 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,455 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,456 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,456 INFO L82 PathProgramCache]: Analyzing trace with hash 983191384, now seen corresponding path program 1 times [2019-10-15 01:09:35,456 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,457 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882387113] [2019-10-15 01:09:35,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,457 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,457 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,594 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882387113] [2019-10-15 01:09:35,594 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,595 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-15 01:09:35,595 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1085233849] [2019-10-15 01:09:35,595 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-15 01:09:35,596 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-15 01:09:35,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-15 01:09:35,596 INFO L87 Difference]: Start difference. First operand 589 states and 942 transitions. Second operand 4 states. [2019-10-15 01:09:35,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:35,656 INFO L93 Difference]: Finished difference Result 1133 states and 1835 transitions. [2019-10-15 01:09:35,657 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-15 01:09:35,657 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 114 [2019-10-15 01:09:35,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:35,664 INFO L225 Difference]: With dead ends: 1133 [2019-10-15 01:09:35,664 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:09:35,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:35,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:09:35,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-15 01:09:35,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:09:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 919 transitions. [2019-10-15 01:09:35,694 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 919 transitions. Word has length 114 [2019-10-15 01:09:35,695 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:35,695 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 919 transitions. [2019-10-15 01:09:35,695 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-15 01:09:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 919 transitions. [2019-10-15 01:09:35,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-10-15 01:09:35,698 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:35,699 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:35,699 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:35,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:35,699 INFO L82 PathProgramCache]: Analyzing trace with hash 881745063, now seen corresponding path program 1 times [2019-10-15 01:09:35,700 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:35,700 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560554641] [2019-10-15 01:09:35,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,700 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:35,700 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:35,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:35,839 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:35,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560554641] [2019-10-15 01:09:35,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:35,840 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:35,840 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [632781173] [2019-10-15 01:09:35,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:35,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:35,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:35,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:35,843 INFO L87 Difference]: Start difference. First operand 576 states and 919 transitions. Second operand 6 states. [2019-10-15 01:09:36,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,137 INFO L93 Difference]: Finished difference Result 1073 states and 1727 transitions. [2019-10-15 01:09:36,138 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:36,138 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 115 [2019-10-15 01:09:36,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,145 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:09:36,145 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:09:36,148 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:36,150 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:09:36,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-15 01:09:36,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:09:36,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 915 transitions. [2019-10-15 01:09:36,173 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 915 transitions. Word has length 115 [2019-10-15 01:09:36,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,173 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 915 transitions. [2019-10-15 01:09:36,173 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:36,174 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 915 transitions. [2019-10-15 01:09:36,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-10-15 01:09:36,177 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,178 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,178 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,178 INFO L82 PathProgramCache]: Analyzing trace with hash -2138395236, now seen corresponding path program 1 times [2019-10-15 01:09:36,178 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,179 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [143042683] [2019-10-15 01:09:36,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,179 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,179 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,324 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:36,325 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [143042683] [2019-10-15 01:09:36,326 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,326 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:36,328 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905574372] [2019-10-15 01:09:36,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:36,329 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:36,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:36,329 INFO L87 Difference]: Start difference. First operand 576 states and 915 transitions. Second operand 6 states. [2019-10-15 01:09:36,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,527 INFO L93 Difference]: Finished difference Result 1073 states and 1723 transitions. [2019-10-15 01:09:36,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:36,528 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 116 [2019-10-15 01:09:36,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,533 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:09:36,534 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:09:36,537 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:36,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:09:36,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-15 01:09:36,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:09:36,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 911 transitions. [2019-10-15 01:09:36,570 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 911 transitions. Word has length 116 [2019-10-15 01:09:36,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,571 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 911 transitions. [2019-10-15 01:09:36,571 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:36,571 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 911 transitions. [2019-10-15 01:09:36,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:36,575 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,575 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,575 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,576 INFO L82 PathProgramCache]: Analyzing trace with hash 603126668, now seen corresponding path program 1 times [2019-10-15 01:09:36,576 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,576 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732369530] [2019-10-15 01:09:36,576 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,577 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,577 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:36,702 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:36,703 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732369530] [2019-10-15 01:09:36,703 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:36,703 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:36,703 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1466002835] [2019-10-15 01:09:36,704 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:36,704 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:36,705 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:36,705 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:36,705 INFO L87 Difference]: Start difference. First operand 576 states and 911 transitions. Second operand 6 states. [2019-10-15 01:09:36,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:36,904 INFO L93 Difference]: Finished difference Result 1073 states and 1719 transitions. [2019-10-15 01:09:36,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:36,904 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 117 [2019-10-15 01:09:36,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:36,909 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:09:36,909 INFO L226 Difference]: Without dead ends: 576 [2019-10-15 01:09:36,912 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:36,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-15 01:09:36,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 576. [2019-10-15 01:09:36,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 576 states. [2019-10-15 01:09:36,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 907 transitions. [2019-10-15 01:09:36,936 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 907 transitions. Word has length 117 [2019-10-15 01:09:36,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:36,936 INFO L462 AbstractCegarLoop]: Abstraction has 576 states and 907 transitions. [2019-10-15 01:09:36,936 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:36,936 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 907 transitions. [2019-10-15 01:09:36,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-10-15 01:09:36,940 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:36,940 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:36,941 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:36,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:36,941 INFO L82 PathProgramCache]: Analyzing trace with hash 1057986572, now seen corresponding path program 1 times [2019-10-15 01:09:36,941 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:36,941 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087871174] [2019-10-15 01:09:36,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,942 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:36,942 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:36,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,132 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087871174] [2019-10-15 01:09:37,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:37,133 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1397178722] [2019-10-15 01:09:37,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:37,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:37,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:37,134 INFO L87 Difference]: Start difference. First operand 576 states and 907 transitions. Second operand 7 states. [2019-10-15 01:09:37,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,213 INFO L93 Difference]: Finished difference Result 1073 states and 1715 transitions. [2019-10-15 01:09:37,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-15 01:09:37,214 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 117 [2019-10-15 01:09:37,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,218 INFO L225 Difference]: With dead ends: 1073 [2019-10-15 01:09:37,219 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:37,222 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:37,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:37,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:37,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 873 transitions. [2019-10-15 01:09:37,243 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 873 transitions. Word has length 117 [2019-10-15 01:09:37,243 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,243 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 873 transitions. [2019-10-15 01:09:37,243 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-15 01:09:37,243 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 873 transitions. [2019-10-15 01:09:37,246 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-10-15 01:09:37,247 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,247 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,247 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,248 INFO L82 PathProgramCache]: Analyzing trace with hash 1567550433, now seen corresponding path program 1 times [2019-10-15 01:09:37,248 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,248 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412438772] [2019-10-15 01:09:37,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,248 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,249 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,379 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,379 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412438772] [2019-10-15 01:09:37,379 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,379 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,380 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1554118233] [2019-10-15 01:09:37,380 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,380 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,381 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,381 INFO L87 Difference]: Start difference. First operand 555 states and 873 transitions. Second operand 6 states. [2019-10-15 01:09:37,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,472 INFO L93 Difference]: Finished difference Result 1052 states and 1681 transitions. [2019-10-15 01:09:37,472 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:37,472 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 118 [2019-10-15 01:09:37,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,477 INFO L225 Difference]: With dead ends: 1052 [2019-10-15 01:09:37,477 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:37,480 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:37,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:37,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:37,498 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 872 transitions. [2019-10-15 01:09:37,499 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 872 transitions. Word has length 118 [2019-10-15 01:09:37,499 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,499 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 872 transitions. [2019-10-15 01:09:37,499 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:37,499 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 872 transitions. [2019-10-15 01:09:37,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2019-10-15 01:09:37,503 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,503 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,503 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,504 INFO L82 PathProgramCache]: Analyzing trace with hash -1018460559, now seen corresponding path program 1 times [2019-10-15 01:09:37,504 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,504 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094671625] [2019-10-15 01:09:37,504 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,505 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,505 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,622 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094671625] [2019-10-15 01:09:37,623 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,623 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-15 01:09:37,623 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556166450] [2019-10-15 01:09:37,623 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-15 01:09:37,624 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-15 01:09:37,624 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-15 01:09:37,624 INFO L87 Difference]: Start difference. First operand 555 states and 872 transitions. Second operand 6 states. [2019-10-15 01:09:37,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:37,715 INFO L93 Difference]: Finished difference Result 1052 states and 1680 transitions. [2019-10-15 01:09:37,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:37,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 119 [2019-10-15 01:09:37,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:37,720 INFO L225 Difference]: With dead ends: 1052 [2019-10-15 01:09:37,721 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:37,724 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:37,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:37,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:37,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 871 transitions. [2019-10-15 01:09:37,745 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 871 transitions. Word has length 119 [2019-10-15 01:09:37,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:37,745 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 871 transitions. [2019-10-15 01:09:37,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-15 01:09:37,745 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 871 transitions. [2019-10-15 01:09:37,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-10-15 01:09:37,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:37,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:37,749 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:37,750 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:37,750 INFO L82 PathProgramCache]: Analyzing trace with hash -1998799322, now seen corresponding path program 1 times [2019-10-15 01:09:37,750 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:37,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [152107792] [2019-10-15 01:09:37,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,751 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:37,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:37,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:37,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:37,971 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [152107792] [2019-10-15 01:09:37,972 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:37,972 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-15 01:09:37,972 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728596447] [2019-10-15 01:09:37,973 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-15 01:09:37,973 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:37,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-15 01:09:37,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-15 01:09:37,974 INFO L87 Difference]: Start difference. First operand 555 states and 871 transitions. Second operand 12 states. [2019-10-15 01:09:38,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:38,152 INFO L93 Difference]: Finished difference Result 1053 states and 1679 transitions. [2019-10-15 01:09:38,153 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-10-15 01:09:38,153 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 120 [2019-10-15 01:09:38,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:38,157 INFO L225 Difference]: With dead ends: 1053 [2019-10-15 01:09:38,157 INFO L226 Difference]: Without dead ends: 555 [2019-10-15 01:09:38,161 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-15 01:09:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 555 states. [2019-10-15 01:09:38,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 555 to 555. [2019-10-15 01:09:38,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 555 states. [2019-10-15 01:09:38,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 555 states to 555 states and 870 transitions. [2019-10-15 01:09:38,185 INFO L78 Accepts]: Start accepts. Automaton has 555 states and 870 transitions. Word has length 120 [2019-10-15 01:09:38,185 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:38,185 INFO L462 AbstractCegarLoop]: Abstraction has 555 states and 870 transitions. [2019-10-15 01:09:38,186 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-15 01:09:38,186 INFO L276 IsEmpty]: Start isEmpty. Operand 555 states and 870 transitions. [2019-10-15 01:09:38,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2019-10-15 01:09:38,193 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:38,193 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:38,193 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:38,193 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:38,194 INFO L82 PathProgramCache]: Analyzing trace with hash 504527096, now seen corresponding path program 1 times [2019-10-15 01:09:38,194 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:38,194 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530197609] [2019-10-15 01:09:38,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,194 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:38,194 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:38,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:38,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:38,377 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530197609] [2019-10-15 01:09:38,377 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:38,377 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:38,378 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932209659] [2019-10-15 01:09:38,378 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:38,378 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:38,379 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:38,379 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:38,379 INFO L87 Difference]: Start difference. First operand 555 states and 870 transitions. Second operand 9 states. [2019-10-15 01:09:41,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:41,783 INFO L93 Difference]: Finished difference Result 1050 states and 1693 transitions. [2019-10-15 01:09:41,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-15 01:09:41,784 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 121 [2019-10-15 01:09:41,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:41,794 INFO L225 Difference]: With dead ends: 1050 [2019-10-15 01:09:41,795 INFO L226 Difference]: Without dead ends: 561 [2019-10-15 01:09:41,798 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=37, Invalid=119, Unknown=0, NotChecked=0, Total=156 [2019-10-15 01:09:41,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 561 states. [2019-10-15 01:09:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 561 to 559. [2019-10-15 01:09:41,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 559 states. [2019-10-15 01:09:41,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 559 states to 559 states and 889 transitions. [2019-10-15 01:09:41,835 INFO L78 Accepts]: Start accepts. Automaton has 559 states and 889 transitions. Word has length 121 [2019-10-15 01:09:41,835 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:41,835 INFO L462 AbstractCegarLoop]: Abstraction has 559 states and 889 transitions. [2019-10-15 01:09:41,835 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:41,835 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 889 transitions. [2019-10-15 01:09:41,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2019-10-15 01:09:41,839 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:41,839 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:41,839 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:41,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:41,840 INFO L82 PathProgramCache]: Analyzing trace with hash -250381492, now seen corresponding path program 1 times [2019-10-15 01:09:41,840 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:41,840 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769477398] [2019-10-15 01:09:41,840 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,841 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:41,841 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:41,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:42,048 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:42,055 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769477398] [2019-10-15 01:09:42,058 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:42,058 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-10-15 01:09:42,058 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2054372649] [2019-10-15 01:09:42,059 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-10-15 01:09:42,059 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:42,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-10-15 01:09:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2019-10-15 01:09:42,060 INFO L87 Difference]: Start difference. First operand 559 states and 889 transitions. Second operand 8 states. [2019-10-15 01:09:48,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:48,524 INFO L93 Difference]: Finished difference Result 1962 states and 3248 transitions. [2019-10-15 01:09:48,524 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-10-15 01:09:48,525 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 122 [2019-10-15 01:09:48,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:48,549 INFO L225 Difference]: With dead ends: 1962 [2019-10-15 01:09:48,549 INFO L226 Difference]: Without dead ends: 1469 [2019-10-15 01:09:48,554 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:48,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1469 states. [2019-10-15 01:09:48,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1469 to 1430. [2019-10-15 01:09:48,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1430 states. [2019-10-15 01:09:48,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1430 states to 1430 states and 2296 transitions. [2019-10-15 01:09:48,648 INFO L78 Accepts]: Start accepts. Automaton has 1430 states and 2296 transitions. Word has length 122 [2019-10-15 01:09:48,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:48,648 INFO L462 AbstractCegarLoop]: Abstraction has 1430 states and 2296 transitions. [2019-10-15 01:09:48,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-10-15 01:09:48,649 INFO L276 IsEmpty]: Start isEmpty. Operand 1430 states and 2296 transitions. [2019-10-15 01:09:48,652 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:48,652 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:48,652 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:48,653 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:48,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:48,653 INFO L82 PathProgramCache]: Analyzing trace with hash 1214123081, now seen corresponding path program 1 times [2019-10-15 01:09:48,654 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:48,654 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1415251843] [2019-10-15 01:09:48,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:48,654 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:48,655 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:48,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:48,822 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:48,822 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1415251843] [2019-10-15 01:09:48,823 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:48,823 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-15 01:09:48,823 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130621228] [2019-10-15 01:09:48,824 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-15 01:09:48,824 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:48,825 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-15 01:09:48,825 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-15 01:09:48,825 INFO L87 Difference]: Start difference. First operand 1430 states and 2296 transitions. Second operand 9 states. [2019-10-15 01:09:55,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:55,695 INFO L93 Difference]: Finished difference Result 4504 states and 7422 transitions. [2019-10-15 01:09:55,696 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-10-15 01:09:55,696 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 128 [2019-10-15 01:09:55,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:55,727 INFO L225 Difference]: With dead ends: 4504 [2019-10-15 01:09:55,727 INFO L226 Difference]: Without dead ends: 3140 [2019-10-15 01:09:55,737 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=75, Invalid=267, Unknown=0, NotChecked=0, Total=342 [2019-10-15 01:09:55,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3140 states. [2019-10-15 01:09:55,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3140 to 2917. [2019-10-15 01:09:55,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2917 states. [2019-10-15 01:09:55,907 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2917 states to 2917 states and 4711 transitions. [2019-10-15 01:09:55,909 INFO L78 Accepts]: Start accepts. Automaton has 2917 states and 4711 transitions. Word has length 128 [2019-10-15 01:09:55,909 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:55,910 INFO L462 AbstractCegarLoop]: Abstraction has 2917 states and 4711 transitions. [2019-10-15 01:09:55,910 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-15 01:09:55,910 INFO L276 IsEmpty]: Start isEmpty. Operand 2917 states and 4711 transitions. [2019-10-15 01:09:55,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:55,914 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:55,914 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:55,914 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:55,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:55,916 INFO L82 PathProgramCache]: Analyzing trace with hash 1206363722, now seen corresponding path program 1 times [2019-10-15 01:09:55,916 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:55,916 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [174310270] [2019-10-15 01:09:55,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,916 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:55,917 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:55,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:56,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:56,035 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [174310270] [2019-10-15 01:09:56,035 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:56,036 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-15 01:09:56,036 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [50046999] [2019-10-15 01:09:56,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-15 01:09:56,036 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:56,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-15 01:09:56,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-15 01:09:56,037 INFO L87 Difference]: Start difference. First operand 2917 states and 4711 transitions. Second operand 5 states. [2019-10-15 01:09:58,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-15 01:09:58,528 INFO L93 Difference]: Finished difference Result 6396 states and 10301 transitions. [2019-10-15 01:09:58,528 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-15 01:09:58,528 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 128 [2019-10-15 01:09:58,528 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-15 01:09:58,559 INFO L225 Difference]: With dead ends: 6396 [2019-10-15 01:09:58,559 INFO L226 Difference]: Without dead ends: 4288 [2019-10-15 01:09:58,573 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:58,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4288 states. [2019-10-15 01:09:58,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4288 to 4261. [2019-10-15 01:09:58,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4261 states. [2019-10-15 01:09:58,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4261 states to 4261 states and 6797 transitions. [2019-10-15 01:09:58,790 INFO L78 Accepts]: Start accepts. Automaton has 4261 states and 6797 transitions. Word has length 128 [2019-10-15 01:09:58,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-15 01:09:58,791 INFO L462 AbstractCegarLoop]: Abstraction has 4261 states and 6797 transitions. [2019-10-15 01:09:58,791 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-15 01:09:58,791 INFO L276 IsEmpty]: Start isEmpty. Operand 4261 states and 6797 transitions. [2019-10-15 01:09:58,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 129 [2019-10-15 01:09:58,796 INFO L372 BasicCegarLoop]: Found error trace [2019-10-15 01:09:58,796 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-15 01:09:58,797 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-15 01:09:58,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-15 01:09:58,798 INFO L82 PathProgramCache]: Analyzing trace with hash -1039215732, now seen corresponding path program 1 times [2019-10-15 01:09:58,798 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-15 01:09:58,798 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779295576] [2019-10-15 01:09:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,798 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-15 01:09:58,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-15 01:09:58,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-15 01:09:58,942 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-15 01:09:58,942 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779295576] [2019-10-15 01:09:58,943 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-15 01:09:58,943 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-15 01:09:58,943 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393588620] [2019-10-15 01:09:58,944 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-15 01:09:58,945 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-15 01:09:58,945 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-15 01:09:58,945 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-15 01:09:58,945 INFO L87 Difference]: Start difference. First operand 4261 states and 6797 transitions. Second operand 7 states.