java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:06,091 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:06,095 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:06,114 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:06,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:06,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:06,119 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:06,129 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:06,132 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:06,133 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:06,134 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:06,135 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:06,135 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:06,136 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:06,137 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:06,138 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:06,139 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:06,140 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:06,142 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:06,143 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:06,145 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:06,146 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:06,147 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:06,148 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:06,150 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:06,150 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:06,150 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:06,151 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:06,151 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:06,152 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:06,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:06,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:06,154 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:06,155 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:06,156 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:06,156 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:06,157 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:06,157 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:06,157 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:06,158 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:06,159 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:06,160 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-13 21:09:06,174 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:06,179 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:06,181 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:06,181 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:06,181 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:06,181 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:06,182 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:06,182 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:06,182 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:06,182 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:06,182 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:06,183 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:06,183 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:06,183 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:06,183 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:06,184 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:06,184 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:06,184 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:06,184 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:06,184 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:06,185 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:06,185 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:06,185 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:06,185 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:06,186 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:06,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:06,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:06,186 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:06,186 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-13 21:09:06,470 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:06,487 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:06,490 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:06,492 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:06,492 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:06,493 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-10-13 21:09:06,567 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbecea63/f1b9b1e6db50428387a97150928b90d1/FLAG26079e2b0 [2019-10-13 21:09:07,274 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:07,275 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product11.cil.c [2019-10-13 21:09:07,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbecea63/f1b9b1e6db50428387a97150928b90d1/FLAG26079e2b0 [2019-10-13 21:09:07,451 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7cbecea63/f1b9b1e6db50428387a97150928b90d1 [2019-10-13 21:09:07,459 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:07,461 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:07,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:07,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:07,466 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:07,467 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:07" (1/1) ... [2019-10-13 21:09:07,470 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de966eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:07, skipping insertion in model container [2019-10-13 21:09:07,471 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 09:09:07" (1/1) ... [2019-10-13 21:09:07,478 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:07,558 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:08,341 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,365 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:08,525 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,652 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:08,653 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08 WrapperNode [2019-10-13 21:09:08,653 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:08,654 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:08,655 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:08,655 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:08,677 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,745 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,833 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,855 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,864 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... [2019-10-13 21:09:08,887 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:08,895 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:08,896 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:08,896 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:08,897 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:08,960 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:08,961 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:08,962 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:08,963 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:08,964 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:08,965 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:08,965 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:08,966 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:08,968 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:08,968 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:08,969 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:08,969 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:08,970 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:08,971 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:08,972 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:08,974 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:08,975 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:08,976 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:08,977 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:08,978 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:08,979 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:08,980 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:08,981 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:08,981 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:08,982 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:08,983 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:08,984 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:08,984 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:08,985 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:08,986 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:08,987 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:08,988 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:08,989 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:08,990 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:08,991 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:08,992 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:08,993 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:08,994 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:08,995 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:08,996 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:08,997 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:08,998 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:08,999 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:09,000 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:09,001 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:09,004 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:09,005 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:09,006 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:09,006 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:09,006 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:09,007 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:09,014 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:09,015 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__empty [2019-10-13 21:09:09,016 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__empty [2019-10-13 21:09:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:09,017 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:09,018 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:11,452 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:11,453 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:11,455 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:11 BoogieIcfgContainer [2019-10-13 21:09:11,455 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:11,456 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:11,456 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:11,461 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:11,461 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 09:09:07" (1/3) ... [2019-10-13 21:09:11,462 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26825068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:11, skipping insertion in model container [2019-10-13 21:09:11,462 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 09:09:08" (2/3) ... [2019-10-13 21:09:11,463 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@26825068 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 09:09:11, skipping insertion in model container [2019-10-13 21:09:11,463 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 09:09:11" (3/3) ... [2019-10-13 21:09:11,465 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product11.cil.c [2019-10-13 21:09:11,476 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:11,487 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:11,499 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:11,551 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:11,552 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:11,552 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:11,552 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:11,552 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:11,552 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:11,553 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:11,553 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:11,608 INFO L276 IsEmpty]: Start isEmpty. Operand 730 states. [2019-10-13 21:09:11,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:09:11,644 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:11,646 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:11,648 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:11,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:11,655 INFO L82 PathProgramCache]: Analyzing trace with hash -2137869489, now seen corresponding path program 1 times [2019-10-13 21:09:11,666 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:11,667 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1019100688] [2019-10-13 21:09:11,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,667 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,668 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,316 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:12,317 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1019100688] [2019-10-13 21:09:12,317 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,318 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,318 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1052339436] [2019-10-13 21:09:12,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,325 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,343 INFO L87 Difference]: Start difference. First operand 730 states. Second operand 4 states. [2019-10-13 21:09:12,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:12,553 INFO L93 Difference]: Finished difference Result 1158 states and 1864 transitions. [2019-10-13 21:09:12,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:12,556 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:09:12,556 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:12,591 INFO L225 Difference]: With dead ends: 1158 [2019-10-13 21:09:12,591 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:12,604 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:12,626 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:12,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:12,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:12,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 923 transitions. [2019-10-13 21:09:12,731 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 923 transitions. Word has length 135 [2019-10-13 21:09:12,732 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:12,732 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 923 transitions. [2019-10-13 21:09:12,732 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:12,732 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 923 transitions. [2019-10-13 21:09:12,739 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:09:12,739 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,739 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:12,740 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,740 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,740 INFO L82 PathProgramCache]: Analyzing trace with hash 1566459786, now seen corresponding path program 1 times [2019-10-13 21:09:12,741 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,741 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007452541] [2019-10-13 21:09:12,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,741 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,741 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,983 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:12,983 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007452541] [2019-10-13 21:09:12,984 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,984 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,984 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733971635] [2019-10-13 21:09:12,988 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,989 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,990 INFO L87 Difference]: Start difference. First operand 582 states and 923 transitions. Second operand 4 states. [2019-10-13 21:09:13,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,078 INFO L93 Difference]: Finished difference Result 1131 states and 1807 transitions. [2019-10-13 21:09:13,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,078 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:09:13,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,084 INFO L225 Difference]: With dead ends: 1131 [2019-10-13 21:09:13,084 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:13,087 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:13,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:13,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:13,124 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 922 transitions. [2019-10-13 21:09:13,125 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 922 transitions. Word has length 136 [2019-10-13 21:09:13,127 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,127 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 922 transitions. [2019-10-13 21:09:13,128 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,128 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 922 transitions. [2019-10-13 21:09:13,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:09:13,138 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,138 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,138 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,139 INFO L82 PathProgramCache]: Analyzing trace with hash 785186859, now seen corresponding path program 1 times [2019-10-13 21:09:13,139 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,139 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129989507] [2019-10-13 21:09:13,139 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,140 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,350 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,350 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129989507] [2019-10-13 21:09:13,351 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,351 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,352 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320565217] [2019-10-13 21:09:13,354 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,355 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,355 INFO L87 Difference]: Start difference. First operand 582 states and 922 transitions. Second operand 4 states. [2019-10-13 21:09:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,448 INFO L93 Difference]: Finished difference Result 1131 states and 1806 transitions. [2019-10-13 21:09:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,448 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:09:13,449 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,457 INFO L225 Difference]: With dead ends: 1131 [2019-10-13 21:09:13,457 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:13,460 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:13,495 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:13,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:13,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 921 transitions. [2019-10-13 21:09:13,503 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 921 transitions. Word has length 137 [2019-10-13 21:09:13,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,504 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 921 transitions. [2019-10-13 21:09:13,504 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,504 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 921 transitions. [2019-10-13 21:09:13,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:09:13,513 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,514 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,514 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1610800858, now seen corresponding path program 1 times [2019-10-13 21:09:13,515 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,515 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [691598472] [2019-10-13 21:09:13,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,515 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,516 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,680 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,680 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [691598472] [2019-10-13 21:09:13,681 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,681 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,681 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [385896792] [2019-10-13 21:09:13,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,682 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,683 INFO L87 Difference]: Start difference. First operand 582 states and 921 transitions. Second operand 4 states. [2019-10-13 21:09:13,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,757 INFO L93 Difference]: Finished difference Result 1131 states and 1805 transitions. [2019-10-13 21:09:13,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,758 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:09:13,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,763 INFO L225 Difference]: With dead ends: 1131 [2019-10-13 21:09:13,764 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:13,769 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:13,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:13,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:13,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:13,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 920 transitions. [2019-10-13 21:09:13,800 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 920 transitions. Word has length 138 [2019-10-13 21:09:13,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,801 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 920 transitions. [2019-10-13 21:09:13,801 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,801 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 920 transitions. [2019-10-13 21:09:13,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:09:13,806 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,806 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:13,807 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,807 INFO L82 PathProgramCache]: Analyzing trace with hash 1771627783, now seen corresponding path program 1 times [2019-10-13 21:09:13,807 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138517746] [2019-10-13 21:09:13,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,808 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,808 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,992 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:13,993 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138517746] [2019-10-13 21:09:13,993 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,993 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,993 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167767423] [2019-10-13 21:09:13,994 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,994 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,995 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,995 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,996 INFO L87 Difference]: Start difference. First operand 582 states and 920 transitions. Second operand 4 states. [2019-10-13 21:09:14,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,075 INFO L93 Difference]: Finished difference Result 1131 states and 1804 transitions. [2019-10-13 21:09:14,075 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,075 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:09:14,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,087 INFO L225 Difference]: With dead ends: 1131 [2019-10-13 21:09:14,088 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:14,091 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:14,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:14,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:14,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:14,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 919 transitions. [2019-10-13 21:09:14,117 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 919 transitions. Word has length 139 [2019-10-13 21:09:14,117 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,118 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 919 transitions. [2019-10-13 21:09:14,118 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,118 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 919 transitions. [2019-10-13 21:09:14,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,122 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,122 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,122 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,123 INFO L82 PathProgramCache]: Analyzing trace with hash -398630206, now seen corresponding path program 1 times [2019-10-13 21:09:14,123 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,123 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1074069965] [2019-10-13 21:09:14,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,124 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,124 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,306 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1074069965] [2019-10-13 21:09:14,306 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,306 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:14,306 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589816839] [2019-10-13 21:09:14,307 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:14,307 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,308 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:14,308 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:14,308 INFO L87 Difference]: Start difference. First operand 582 states and 919 transitions. Second operand 10 states. [2019-10-13 21:09:14,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,525 INFO L93 Difference]: Finished difference Result 1136 states and 1811 transitions. [2019-10-13 21:09:14,526 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:14,526 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:09:14,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,543 INFO L225 Difference]: With dead ends: 1136 [2019-10-13 21:09:14,543 INFO L226 Difference]: Without dead ends: 591 [2019-10-13 21:09:14,551 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:14,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 591 states. [2019-10-13 21:09:14,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 591 to 589. [2019-10-13 21:09:14,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 589 states. [2019-10-13 21:09:14,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 589 states to 589 states and 929 transitions. [2019-10-13 21:09:14,586 INFO L78 Accepts]: Start accepts. Automaton has 589 states and 929 transitions. Word has length 140 [2019-10-13 21:09:14,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,586 INFO L462 AbstractCegarLoop]: Abstraction has 589 states and 929 transitions. [2019-10-13 21:09:14,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:14,587 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 929 transitions. [2019-10-13 21:09:14,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,594 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,594 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,595 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,595 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,595 INFO L82 PathProgramCache]: Analyzing trace with hash -1385212895, now seen corresponding path program 1 times [2019-10-13 21:09:14,596 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,596 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593671937] [2019-10-13 21:09:14,596 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,597 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,851 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:14,851 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593671937] [2019-10-13 21:09:14,852 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,852 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,852 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292587810] [2019-10-13 21:09:14,853 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,853 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,853 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,853 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,853 INFO L87 Difference]: Start difference. First operand 589 states and 929 transitions. Second operand 4 states. [2019-10-13 21:09:14,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,923 INFO L93 Difference]: Finished difference Result 1137 states and 1812 transitions. [2019-10-13 21:09:14,924 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:14,924 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:09:14,926 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,931 INFO L225 Difference]: With dead ends: 1137 [2019-10-13 21:09:14,931 INFO L226 Difference]: Without dead ends: 585 [2019-10-13 21:09:14,934 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-13 21:09:14,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 585 states. [2019-10-13 21:09:14,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 585 to 585. [2019-10-13 21:09:14,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 585 states. [2019-10-13 21:09:14,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 585 states to 585 states and 922 transitions. [2019-10-13 21:09:14,960 INFO L78 Accepts]: Start accepts. Automaton has 585 states and 922 transitions. Word has length 140 [2019-10-13 21:09:14,961 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,961 INFO L462 AbstractCegarLoop]: Abstraction has 585 states and 922 transitions. [2019-10-13 21:09:14,961 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,961 INFO L276 IsEmpty]: Start isEmpty. Operand 585 states and 922 transitions. [2019-10-13 21:09:14,966 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:09:14,966 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,967 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:14,967 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,967 INFO L82 PathProgramCache]: Analyzing trace with hash 1670566169, now seen corresponding path program 1 times [2019-10-13 21:09:14,968 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,968 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140763954] [2019-10-13 21:09:14,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,968 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,969 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,134 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,136 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140763954] [2019-10-13 21:09:15,136 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,136 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,136 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1456417486] [2019-10-13 21:09:15,137 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,137 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,137 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,138 INFO L87 Difference]: Start difference. First operand 585 states and 922 transitions. Second operand 6 states. [2019-10-13 21:09:15,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,443 INFO L93 Difference]: Finished difference Result 1150 states and 1836 transitions. [2019-10-13 21:09:15,443 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:15,444 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:09:15,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,451 INFO L225 Difference]: With dead ends: 1150 [2019-10-13 21:09:15,451 INFO L226 Difference]: Without dead ends: 593 [2019-10-13 21:09:15,456 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:15,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2019-10-13 21:09:15,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 590. [2019-10-13 21:09:15,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:15,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 923 transitions. [2019-10-13 21:09:15,490 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 923 transitions. Word has length 141 [2019-10-13 21:09:15,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,491 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 923 transitions. [2019-10-13 21:09:15,491 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,492 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 923 transitions. [2019-10-13 21:09:15,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:09:15,498 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,498 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:15,499 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,500 INFO L82 PathProgramCache]: Analyzing trace with hash 478732421, now seen corresponding path program 1 times [2019-10-13 21:09:15,500 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,500 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735252270] [2019-10-13 21:09:15,500 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,501 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,724 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:15,724 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735252270] [2019-10-13 21:09:15,724 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,725 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,725 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473792204] [2019-10-13 21:09:15,725 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,726 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,726 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,726 INFO L87 Difference]: Start difference. First operand 590 states and 923 transitions. Second operand 6 states. [2019-10-13 21:09:15,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,958 INFO L93 Difference]: Finished difference Result 1113 states and 1751 transitions. [2019-10-13 21:09:15,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:15,959 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:09:15,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,964 INFO L225 Difference]: With dead ends: 1113 [2019-10-13 21:09:15,965 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:15,968 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:15,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:15,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:15,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:15,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 919 transitions. [2019-10-13 21:09:15,993 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 919 transitions. Word has length 142 [2019-10-13 21:09:15,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,994 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 919 transitions. [2019-10-13 21:09:15,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,994 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 919 transitions. [2019-10-13 21:09:15,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:15,999 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,999 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:15,999 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1066219550, now seen corresponding path program 1 times [2019-10-13 21:09:16,000 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820627738] [2019-10-13 21:09:16,000 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,001 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,125 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820627738] [2019-10-13 21:09:16,126 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,126 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,126 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621705831] [2019-10-13 21:09:16,127 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,127 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,127 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,128 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,128 INFO L87 Difference]: Start difference. First operand 590 states and 919 transitions. Second operand 6 states. [2019-10-13 21:09:16,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,370 INFO L93 Difference]: Finished difference Result 1113 states and 1747 transitions. [2019-10-13 21:09:16,370 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,370 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:09:16,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,375 INFO L225 Difference]: With dead ends: 1113 [2019-10-13 21:09:16,375 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:16,383 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:16,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:16,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:16,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 915 transitions. [2019-10-13 21:09:16,405 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 915 transitions. Word has length 143 [2019-10-13 21:09:16,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,406 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 915 transitions. [2019-10-13 21:09:16,406 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,406 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 915 transitions. [2019-10-13 21:09:16,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:16,410 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,410 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:16,410 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,411 INFO L82 PathProgramCache]: Analyzing trace with hash 1343550622, now seen corresponding path program 1 times [2019-10-13 21:09:16,411 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [108863599] [2019-10-13 21:09:16,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,412 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,412 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,577 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,577 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [108863599] [2019-10-13 21:09:16,578 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,578 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:16,578 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486794966] [2019-10-13 21:09:16,579 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:16,579 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:16,579 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:16,579 INFO L87 Difference]: Start difference. First operand 590 states and 915 transitions. Second operand 7 states. [2019-10-13 21:09:16,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,691 INFO L93 Difference]: Finished difference Result 1116 states and 1747 transitions. [2019-10-13 21:09:16,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:16,692 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:09:16,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,697 INFO L225 Difference]: With dead ends: 1116 [2019-10-13 21:09:16,698 INFO L226 Difference]: Without dead ends: 572 [2019-10-13 21:09:16,701 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:16,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-10-13 21:09:16,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 569. [2019-10-13 21:09:16,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:09:16,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 878 transitions. [2019-10-13 21:09:16,729 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 878 transitions. Word has length 143 [2019-10-13 21:09:16,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,730 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 878 transitions. [2019-10-13 21:09:16,730 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:16,730 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 878 transitions. [2019-10-13 21:09:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:09:16,735 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,735 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:16,735 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,736 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,736 INFO L82 PathProgramCache]: Analyzing trace with hash 978079018, now seen corresponding path program 1 times [2019-10-13 21:09:16,736 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,737 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684695882] [2019-10-13 21:09:16,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,737 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,738 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,918 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:16,918 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684695882] [2019-10-13 21:09:16,919 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,919 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,919 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222125724] [2019-10-13 21:09:16,920 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,921 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,921 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,921 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,921 INFO L87 Difference]: Start difference. First operand 569 states and 878 transitions. Second operand 6 states. [2019-10-13 21:09:17,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,054 INFO L93 Difference]: Finished difference Result 1092 states and 1706 transitions. [2019-10-13 21:09:17,055 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,055 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:09:17,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,060 INFO L225 Difference]: With dead ends: 1092 [2019-10-13 21:09:17,061 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:09:17,064 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:09:17,088 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:09:17,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:09:17,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 877 transitions. [2019-10-13 21:09:17,093 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 877 transitions. Word has length 144 [2019-10-13 21:09:17,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,094 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 877 transitions. [2019-10-13 21:09:17,094 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,094 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 877 transitions. [2019-10-13 21:09:17,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:09:17,098 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,098 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:17,099 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,099 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,099 INFO L82 PathProgramCache]: Analyzing trace with hash 1420317475, now seen corresponding path program 1 times [2019-10-13 21:09:17,099 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,100 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2085731475] [2019-10-13 21:09:17,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,100 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,100 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,303 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,303 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2085731475] [2019-10-13 21:09:17,303 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,304 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,304 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139997371] [2019-10-13 21:09:17,305 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,306 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,306 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,307 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,307 INFO L87 Difference]: Start difference. First operand 569 states and 877 transitions. Second operand 6 states. [2019-10-13 21:09:17,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,482 INFO L93 Difference]: Finished difference Result 1092 states and 1705 transitions. [2019-10-13 21:09:17,482 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,483 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:09:17,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,490 INFO L225 Difference]: With dead ends: 1092 [2019-10-13 21:09:17,490 INFO L226 Difference]: Without dead ends: 569 [2019-10-13 21:09:17,495 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-10-13 21:09:17,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 569 states. [2019-10-13 21:09:17,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 569 to 569. [2019-10-13 21:09:17,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 569 states. [2019-10-13 21:09:17,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 569 states to 569 states and 876 transitions. [2019-10-13 21:09:17,527 INFO L78 Accepts]: Start accepts. Automaton has 569 states and 876 transitions. Word has length 145 [2019-10-13 21:09:17,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,529 INFO L462 AbstractCegarLoop]: Abstraction has 569 states and 876 transitions. [2019-10-13 21:09:17,529 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,529 INFO L276 IsEmpty]: Start isEmpty. Operand 569 states and 876 transitions. [2019-10-13 21:09:17,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:17,534 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,534 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:17,535 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,535 INFO L82 PathProgramCache]: Analyzing trace with hash 1124435407, now seen corresponding path program 1 times [2019-10-13 21:09:17,535 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,535 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [13585914] [2019-10-13 21:09:17,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,536 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,536 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2019-10-13 21:09:17,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [13585914] [2019-10-13 21:09:17,858 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,858 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:17,858 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069190872] [2019-10-13 21:09:17,859 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:17,859 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:17,860 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:17,860 INFO L87 Difference]: Start difference. First operand 569 states and 876 transitions. Second operand 12 states. [2019-10-13 21:09:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:18,167 INFO L93 Difference]: Finished difference Result 1098 states and 1715 transitions. [2019-10-13 21:09:18,168 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:18,168 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:09:18,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:18,175 INFO L225 Difference]: With dead ends: 1098 [2019-10-13 21:09:18,175 INFO L226 Difference]: Without dead ends: 576 [2019-10-13 21:09:18,180 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:18,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 576 states. [2019-10-13 21:09:18,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 576 to 574. [2019-10-13 21:09:18,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:18,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-13 21:09:18,221 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 146 [2019-10-13 21:09:18,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:18,223 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-13 21:09:18,223 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:18,224 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-13 21:09:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:18,229 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:18,229 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:18,230 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:18,230 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:18,230 INFO L82 PathProgramCache]: Analyzing trace with hash 1505055730, now seen corresponding path program 1 times [2019-10-13 21:09:18,230 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:18,231 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1284753878] [2019-10-13 21:09:18,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,231 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:18,231 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:18,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,441 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:18,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1284753878] [2019-10-13 21:09:18,442 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [508875692] [2019-10-13 21:09:18,442 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:19,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:19,041 INFO L256 TraceCheckSpWp]: Trace formula consists of 2599 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:19,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:19,217 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:19,218 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:19,595 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2019-10-13 21:09:19,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:19,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:19,597 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850993855] [2019-10-13 21:09:19,599 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:19,600 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:19,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:19,601 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 5 states. [2019-10-13 21:09:20,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,588 INFO L93 Difference]: Finished difference Result 1103 states and 1748 transitions. [2019-10-13 21:09:20,589 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:20,589 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:09:20,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,594 INFO L225 Difference]: With dead ends: 1103 [2019-10-13 21:09:20,594 INFO L226 Difference]: Without dead ends: 582 [2019-10-13 21:09:20,600 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:20,603 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 582 states. [2019-10-13 21:09:20,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 582 to 582. [2019-10-13 21:09:20,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 582 states. [2019-10-13 21:09:20,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 895 transitions. [2019-10-13 21:09:20,631 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 895 transitions. Word has length 147 [2019-10-13 21:09:20,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,631 INFO L462 AbstractCegarLoop]: Abstraction has 582 states and 895 transitions. [2019-10-13 21:09:20,632 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:20,632 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 895 transitions. [2019-10-13 21:09:20,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:20,636 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,636 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:20,851 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:20,852 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,852 INFO L82 PathProgramCache]: Analyzing trace with hash -2143848474, now seen corresponding path program 1 times [2019-10-13 21:09:20,852 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,852 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1360603060] [2019-10-13 21:09:20,852 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,853 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,853 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,125 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 7 proven. 7 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:21,125 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1360603060] [2019-10-13 21:09:21,126 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789790652] [2019-10-13 21:09:21,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:21,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,774 INFO L256 TraceCheckSpWp]: Trace formula consists of 2602 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:21,799 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:21,890 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:21,891 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:22,288 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 25 trivial. 0 not checked. [2019-10-13 21:09:22,289 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:22,289 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:22,290 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039068996] [2019-10-13 21:09:22,290 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:22,291 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:22,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:22,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:22,291 INFO L87 Difference]: Start difference. First operand 582 states and 895 transitions. Second operand 5 states. [2019-10-13 21:09:23,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:23,223 INFO L93 Difference]: Finished difference Result 1119 states and 1771 transitions. [2019-10-13 21:09:23,223 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:23,223 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:09:23,224 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:23,228 INFO L225 Difference]: With dead ends: 1119 [2019-10-13 21:09:23,229 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:23,232 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 308 GetRequests, 290 SyntacticMatches, 6 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:23,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:23,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:23,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:23,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 908 transitions. [2019-10-13 21:09:23,257 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 908 transitions. Word has length 150 [2019-10-13 21:09:23,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:23,258 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 908 transitions. [2019-10-13 21:09:23,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:23,258 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 908 transitions. [2019-10-13 21:09:23,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:09:23,262 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:23,262 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:23,469 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:23,470 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:23,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:23,471 INFO L82 PathProgramCache]: Analyzing trace with hash -2124764298, now seen corresponding path program 1 times [2019-10-13 21:09:23,471 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:23,472 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2041904377] [2019-10-13 21:09:23,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,472 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:23,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,704 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-10-13 21:09:23,704 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2041904377] [2019-10-13 21:09:23,705 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [72345649] [2019-10-13 21:09:23,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:24,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:24,320 INFO L256 TraceCheckSpWp]: Trace formula consists of 2605 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:24,333 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:24,443 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:24,443 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:24,714 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 16 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2019-10-13 21:09:24,715 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:24,715 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:24,715 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228398315] [2019-10-13 21:09:24,716 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:24,716 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,716 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:24,717 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:24,717 INFO L87 Difference]: Start difference. First operand 590 states and 908 transitions. Second operand 5 states. [2019-10-13 21:09:25,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,552 INFO L93 Difference]: Finished difference Result 1135 states and 1794 transitions. [2019-10-13 21:09:25,552 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:09:25,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,557 INFO L225 Difference]: With dead ends: 1135 [2019-10-13 21:09:25,558 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:09:25,561 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:25,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:09:25,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2019-10-13 21:09:25,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 598 states. [2019-10-13 21:09:25,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 921 transitions. [2019-10-13 21:09:25,587 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 921 transitions. Word has length 153 [2019-10-13 21:09:25,587 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,587 INFO L462 AbstractCegarLoop]: Abstraction has 598 states and 921 transitions. [2019-10-13 21:09:25,587 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:25,588 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 921 transitions. [2019-10-13 21:09:25,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:09:25,592 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,592 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:25,802 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:25,803 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,803 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,803 INFO L82 PathProgramCache]: Analyzing trace with hash -1878745502, now seen corresponding path program 1 times [2019-10-13 21:09:25,804 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,804 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1058361512] [2019-10-13 21:09:25,804 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,805 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,805 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,051 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2019-10-13 21:09:26,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1058361512] [2019-10-13 21:09:26,051 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197333245] [2019-10-13 21:09:26,051 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:26,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:26,588 INFO L256 TraceCheckSpWp]: Trace formula consists of 2608 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:26,596 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:26,704 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:26,704 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2019-10-13 21:09:27,045 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:27,045 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-13 21:09:27,045 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1091994492] [2019-10-13 21:09:27,046 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:27,046 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:27,046 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:27,046 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:09:27,047 INFO L87 Difference]: Start difference. First operand 598 states and 921 transitions. Second operand 5 states. [2019-10-13 21:09:27,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:27,911 INFO L93 Difference]: Finished difference Result 1151 states and 1817 transitions. [2019-10-13 21:09:27,912 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:27,912 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:09:27,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:27,917 INFO L225 Difference]: With dead ends: 1151 [2019-10-13 21:09:27,917 INFO L226 Difference]: Without dead ends: 606 [2019-10-13 21:09:27,920 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 332 GetRequests, 312 SyntacticMatches, 5 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=228, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:27,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2019-10-13 21:09:27,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 606. [2019-10-13 21:09:27,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 606 states. [2019-10-13 21:09:27,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 606 states to 606 states and 934 transitions. [2019-10-13 21:09:27,949 INFO L78 Accepts]: Start accepts. Automaton has 606 states and 934 transitions. Word has length 156 [2019-10-13 21:09:27,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,949 INFO L462 AbstractCegarLoop]: Abstraction has 606 states and 934 transitions. [2019-10-13 21:09:27,949 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:27,950 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 934 transitions. [2019-10-13 21:09:27,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:27,953 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,954 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:28,161 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:28,161 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:28,162 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:28,162 INFO L82 PathProgramCache]: Analyzing trace with hash 1877071098, now seen corresponding path program 1 times [2019-10-13 21:09:28,163 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:28,163 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800083416] [2019-10-13 21:09:28,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,164 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:28,164 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,321 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:28,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800083416] [2019-10-13 21:09:28,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1537998417] [2019-10-13 21:09:28,322 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:28,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 2611 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:09:28,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:28,883 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:28,883 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:29,021 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:29,021 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:29,022 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-13 21:09:29,022 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355193444] [2019-10-13 21:09:29,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:29,023 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:29,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:29,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:29,024 INFO L87 Difference]: Start difference. First operand 606 states and 934 transitions. Second operand 6 states. [2019-10-13 21:09:29,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,880 INFO L93 Difference]: Finished difference Result 1718 states and 2734 transitions. [2019-10-13 21:09:29,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:29,881 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-13 21:09:29,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,893 INFO L225 Difference]: With dead ends: 1718 [2019-10-13 21:09:29,893 INFO L226 Difference]: Without dead ends: 1165 [2019-10-13 21:09:29,897 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 326 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:29,898 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states. [2019-10-13 21:09:29,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1156. [2019-10-13 21:09:29,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-13 21:09:29,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1821 transitions. [2019-10-13 21:09:29,952 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1821 transitions. Word has length 159 [2019-10-13 21:09:29,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,953 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1821 transitions. [2019-10-13 21:09:29,953 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:29,953 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1821 transitions. [2019-10-13 21:09:29,957 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:29,957 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,958 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:30,160 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:30,161 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:30,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:30,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1145204813, now seen corresponding path program 1 times [2019-10-13 21:09:30,162 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:30,162 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1057709100] [2019-10-13 21:09:30,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,162 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,162 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:30,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:30,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1057709100] [2019-10-13 21:09:30,460 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1036591939] [2019-10-13 21:09:30,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:31,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:31,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:09:31,023 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:31,057 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 32 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2019-10-13 21:09:31,057 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:31,166 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:31,166 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:31,167 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:31,167 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026725919] [2019-10-13 21:09:31,168 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:31,168 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:31,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:31,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:31,169 INFO L87 Difference]: Start difference. First operand 1156 states and 1821 transitions. Second operand 3 states. [2019-10-13 21:09:31,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:31,304 INFO L93 Difference]: Finished difference Result 2803 states and 4493 transitions. [2019-10-13 21:09:31,304 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:31,305 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 21:09:31,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:31,317 INFO L225 Difference]: With dead ends: 2803 [2019-10-13 21:09:31,318 INFO L226 Difference]: Without dead ends: 1701 [2019-10-13 21:09:31,323 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 347 GetRequests, 337 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:31,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1701 states. [2019-10-13 21:09:31,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1701 to 1156. [2019-10-13 21:09:31,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1156 states. [2019-10-13 21:09:31,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1156 states to 1156 states and 1820 transitions. [2019-10-13 21:09:31,377 INFO L78 Accepts]: Start accepts. Automaton has 1156 states and 1820 transitions. Word has length 164 [2019-10-13 21:09:31,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:31,377 INFO L462 AbstractCegarLoop]: Abstraction has 1156 states and 1820 transitions. [2019-10-13 21:09:31,378 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:31,378 INFO L276 IsEmpty]: Start isEmpty. Operand 1156 states and 1820 transitions. [2019-10-13 21:09:31,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:31,382 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:31,382 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:31,593 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:31,598 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:31,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:31,598 INFO L82 PathProgramCache]: Analyzing trace with hash -721558091, now seen corresponding path program 1 times [2019-10-13 21:09:31,598 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:31,599 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751879922] [2019-10-13 21:09:31,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:31,599 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:31,599 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:31,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:31,773 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:31,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751879922] [2019-10-13 21:09:31,773 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [140955520] [2019-10-13 21:09:31,773 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:32,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:32,329 INFO L256 TraceCheckSpWp]: Trace formula consists of 2627 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:32,335 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:32,441 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2019-10-13 21:09:32,441 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:32,834 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2019-10-13 21:09:32,834 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:32,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:32,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841797795] [2019-10-13 21:09:32,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:32,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:32,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:32,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:32,836 INFO L87 Difference]: Start difference. First operand 1156 states and 1820 transitions. Second operand 9 states. [2019-10-13 21:09:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,092 INFO L93 Difference]: Finished difference Result 3531 states and 5673 transitions. [2019-10-13 21:09:39,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:39,092 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 21:09:39,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,112 INFO L225 Difference]: With dead ends: 3531 [2019-10-13 21:09:39,112 INFO L226 Difference]: Without dead ends: 2428 [2019-10-13 21:09:39,119 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 354 GetRequests, 329 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=581, Unknown=0, NotChecked=0, Total=702 [2019-10-13 21:09:39,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2428 states. [2019-10-13 21:09:39,206 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2428 to 2397. [2019-10-13 21:09:39,206 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2397 states. [2019-10-13 21:09:39,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2397 states to 2397 states and 3835 transitions. [2019-10-13 21:09:39,219 INFO L78 Accepts]: Start accepts. Automaton has 2397 states and 3835 transitions. Word has length 164 [2019-10-13 21:09:39,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,219 INFO L462 AbstractCegarLoop]: Abstraction has 2397 states and 3835 transitions. [2019-10-13 21:09:39,219 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:39,220 INFO L276 IsEmpty]: Start isEmpty. Operand 2397 states and 3835 transitions. [2019-10-13 21:09:39,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:39,226 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,227 INFO L380 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:39,442 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:39,443 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,443 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,444 INFO L82 PathProgramCache]: Analyzing trace with hash -1012228542, now seen corresponding path program 1 times [2019-10-13 21:09:39,444 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,445 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595016427] [2019-10-13 21:09:39,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,445 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,445 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:39,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:39,576 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:39,576 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595016427] [2019-10-13 21:09:39,576 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:39,576 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:39,577 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1149621213] [2019-10-13 21:09:39,577 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:39,577 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:39,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:39,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:39,578 INFO L87 Difference]: Start difference. First operand 2397 states and 3835 transitions. Second operand 9 states. [2019-10-13 21:09:39,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,874 INFO L93 Difference]: Finished difference Result 4666 states and 7506 transitions. [2019-10-13 21:09:39,876 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:39,876 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-13 21:09:39,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,892 INFO L225 Difference]: With dead ends: 4666 [2019-10-13 21:09:39,893 INFO L226 Difference]: Without dead ends: 2316 [2019-10-13 21:09:39,904 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:39,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2316 states. [2019-10-13 21:09:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2316 to 2312. [2019-10-13 21:09:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2312 states. [2019-10-13 21:09:39,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2312 states to 2312 states and 3708 transitions. [2019-10-13 21:09:39,993 INFO L78 Accepts]: Start accepts. Automaton has 2312 states and 3708 transitions. Word has length 167 [2019-10-13 21:09:39,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,994 INFO L462 AbstractCegarLoop]: Abstraction has 2312 states and 3708 transitions. [2019-10-13 21:09:39,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:39,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2312 states and 3708 transitions. [2019-10-13 21:09:39,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:09:39,997 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,998 INFO L380 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-13 21:09:39,998 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,998 INFO L82 PathProgramCache]: Analyzing trace with hash -358886389, now seen corresponding path program 1 times [2019-10-13 21:09:39,999 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,999 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540477667] [2019-10-13 21:09:39,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,999 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,999 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:40,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat