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_product19.cil.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-f4eb214f-m [2019-10-13 21:09:06,147 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-13 21:09:06,149 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-13 21:09:06,161 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-13 21:09:06,161 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-13 21:09:06,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-13 21:09:06,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-13 21:09:06,166 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-13 21:09:06,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-13 21:09:06,168 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-13 21:09:06,169 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-13 21:09:06,170 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-13 21:09:06,170 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-13 21:09:06,171 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-13 21:09:06,172 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-13 21:09:06,173 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-13 21:09:06,174 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-13 21:09:06,175 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-13 21:09:06,177 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-13 21:09:06,179 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-13 21:09:06,181 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-13 21:09:06,182 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-13 21:09:06,183 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-13 21:09:06,184 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-13 21:09:06,186 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-13 21:09:06,186 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-13 21:09:06,187 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-13 21:09:06,187 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-13 21:09:06,188 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-13 21:09:06,189 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-13 21:09:06,189 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-13 21:09:06,190 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-13 21:09:06,191 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-13 21:09:06,192 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-13 21:09:06,193 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-13 21:09:06,193 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-13 21:09:06,194 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-13 21:09:06,194 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-13 21:09:06,194 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-13 21:09:06,195 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-13 21:09:06,196 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-13 21:09:06,196 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,210 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-13 21:09:06,211 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-13 21:09:06,212 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-13 21:09:06,212 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-13 21:09:06,212 INFO L138 SettingsManager]: * Use SBE=true [2019-10-13 21:09:06,212 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-13 21:09:06,213 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-13 21:09:06,213 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-13 21:09:06,213 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-13 21:09:06,213 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-13 21:09:06,213 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-13 21:09:06,214 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-13 21:09:06,214 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-13 21:09:06,214 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-13 21:09:06,214 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-13 21:09:06,214 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-13 21:09:06,215 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-13 21:09:06,215 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-13 21:09:06,215 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-13 21:09:06,215 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-13 21:09:06,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-13 21:09:06,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-13 21:09:06,216 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-13 21:09:06,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-13 21:09:06,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-13 21:09:06,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-13 21:09:06,217 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-13 21:09:06,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-13 21:09:06,217 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,530 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-13 21:09:06,550 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-13 21:09:06,553 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-13 21:09:06,555 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-13 21:09:06,555 INFO L275 PluginConnector]: CDTParser initialized [2019-10-13 21:09:06,556 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-13 21:09:06,636 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514592cf7/35b9edd1f51440df95eaa0f50985380e/FLAG5e6c96362 [2019-10-13 21:09:07,306 INFO L306 CDTParser]: Found 1 translation units. [2019-10-13 21:09:07,308 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/product-lines/elevator_spec14_product19.cil.c [2019-10-13 21:09:07,340 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514592cf7/35b9edd1f51440df95eaa0f50985380e/FLAG5e6c96362 [2019-10-13 21:09:07,488 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/514592cf7/35b9edd1f51440df95eaa0f50985380e [2019-10-13 21:09:07,501 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-13 21:09:07,502 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-13 21:09:07,504 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:07,504 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-13 21:09:07,508 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-13 21:09:07,509 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,512 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d4771d2 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,513 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,521 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-13 21:09:07,614 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-13 21:09:08,340 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,355 INFO L188 MainTranslator]: Completed pre-run [2019-10-13 21:09:08,485 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-13 21:09:08,573 INFO L192 MainTranslator]: Completed translation [2019-10-13 21:09:08,573 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,574 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-13 21:09:08,574 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-13 21:09:08,575 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-13 21:09:08,575 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-13 21:09:08,588 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,588 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,619 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,620 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,701 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,745 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,763 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,787 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-13 21:09:08,789 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-13 21:09:08,789 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-13 21:09:08,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-13 21:09:08,790 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,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-13 21:09:08,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-13 21:09:08,873 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure initTopDown [2019-10-13 21:09:08,874 INFO L138 BoogieDeclarations]: Found implementation of procedure initBottomUp [2019-10-13 21:09:08,875 INFO L138 BoogieDeclarations]: Found implementation of procedure isBlocked [2019-10-13 21:09:08,875 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator__wrappee__base [2019-10-13 21:09:08,876 INFO L138 BoogieDeclarations]: Found implementation of procedure enterElevator [2019-10-13 21:09:08,876 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator__wrappee__base [2019-10-13 21:09:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure leaveElevator [2019-10-13 21:09:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure pressInLiftFloorButton [2019-10-13 21:09:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure resetFloorButton [2019-10-13 21:09:08,877 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentFloorID [2019-10-13 21:09:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure areDoorsOpen [2019-10-13 21:09:08,878 INFO L138 BoogieDeclarations]: Found implementation of procedure buttonForFloorIsPressed [2019-10-13 21:09:08,879 INFO L138 BoogieDeclarations]: Found implementation of procedure getCurrentHeading [2019-10-13 21:09:08,881 INFO L138 BoogieDeclarations]: Found implementation of procedure isEmpty [2019-10-13 21:09:08,881 INFO L138 BoogieDeclarations]: Found implementation of procedure anyStopRequested [2019-10-13 21:09:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure isIdle [2019-10-13 21:09:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:09:08,882 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedInDirection [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure isAnyLiftButtonPressed [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure continueInDirection [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure getReverseHeading [2019-10-13 21:09:08,883 INFO L138 BoogieDeclarations]: Found implementation of procedure processWaitingOnFloor [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure timeShift [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure printState [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure existInLiftCallsInDirection [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloorCalling [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure isExecutiveFloor [2019-10-13 21:09:08,884 INFO L138 BoogieDeclarations]: Found implementation of procedure spec1 [2019-10-13 21:09:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure spec14 [2019-10-13 21:09:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure test [2019-10-13 21:09:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:08,885 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__error_stack_mgt [2019-10-13 21:09:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_arg [2019-10-13 21:09:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure __utac__get_this_argtype [2019-10-13 21:09:08,886 INFO L138 BoogieDeclarations]: Found implementation of procedure select_one [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure select_features [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure select_helpers [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure valid_product [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getWeight [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getOrigin [2019-10-13 21:09:08,887 INFO L138 BoogieDeclarations]: Found implementation of procedure getDestination [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure __automaton_fail [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure get_nondetMinMax07 [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure bobCall [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure aliceCall [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure angelinaCall [2019-10-13 21:09:08,888 INFO L138 BoogieDeclarations]: Found implementation of procedure chuckCall [2019-10-13 21:09:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure monicaCall [2019-10-13 21:09:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure bigMacCall [2019-10-13 21:09:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure threeTS [2019-10-13 21:09:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure cleanup [2019-10-13 21:09:08,889 INFO L138 BoogieDeclarations]: Found implementation of procedure randomSequenceOfActions [2019-10-13 21:09:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest_Simple [2019-10-13 21:09:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification1 [2019-10-13 21:09:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification2 [2019-10-13 21:09:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure Specification3 [2019-10-13 21:09:08,890 INFO L138 BoogieDeclarations]: Found implementation of procedure setup [2019-10-13 21:09:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure runTest [2019-10-13 21:09:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-13 21:09:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure initFloors [2019-10-13 21:09:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure isFloorCalling [2019-10-13 21:09:08,891 INFO L138 BoogieDeclarations]: Found implementation of procedure resetCallOnFloor [2019-10-13 21:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure callOnFloor [2019-10-13 21:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure isPersonOnFloor [2019-10-13 21:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure initPersonOnFloor [2019-10-13 21:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure removePersonFromFloor [2019-10-13 21:09:08,892 INFO L138 BoogieDeclarations]: Found implementation of procedure isTopFloor [2019-10-13 21:09:08,892 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-13 21:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-13 21:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure printf [2019-10-13 21:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure getWeight [2019-10-13 21:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure getDestination [2019-10-13 21:09:08,893 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator [2019-10-13 21:09:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure isFloorCalling [2019-10-13 21:09:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure resetCallOnFloor [2019-10-13 21:09:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure isPersonOnFloor [2019-10-13 21:09:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure removePersonFromFloor [2019-10-13 21:09:08,894 INFO L130 BoogieDeclarations]: Found specification of procedure isTopFloor [2019-10-13 21:09:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure initFloors [2019-10-13 21:09:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure timeShift [2019-10-13 21:09:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure isBlocked [2019-10-13 21:09:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure printState [2019-10-13 21:09:08,895 INFO L130 BoogieDeclarations]: Found specification of procedure isEmpty [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure isAnyLiftButtonPressed [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure buttonForFloorIsPressed [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure initTopDown [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure initBottomUp [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure areDoorsOpen [2019-10-13 21:09:08,896 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentFloorID [2019-10-13 21:09:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure isIdle [2019-10-13 21:09:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloorCalling [2019-10-13 21:09:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure isExecutiveFloor [2019-10-13 21:09:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure enterElevator__wrappee__base [2019-10-13 21:09:08,897 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator__wrappee__base [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure leaveElevator [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure pressInLiftFloorButton [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure resetFloorButton [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure getCurrentHeading [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure anyStopRequested [2019-10-13 21:09:08,898 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection__wrappee__weight [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedInDirection [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure continueInDirection [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor__wrappee__weight [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure stopRequestedAtCurrentFloor [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure getReverseHeading [2019-10-13 21:09:08,899 INFO L130 BoogieDeclarations]: Found specification of procedure processWaitingOnFloor [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure __utac_acc__Specification14_spec__1 [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure existInLiftCallsInDirection [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure getOrigin [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure initPersonOnFloor [2019-10-13 21:09:08,900 INFO L130 BoogieDeclarations]: Found specification of procedure spec1 [2019-10-13 21:09:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure spec14 [2019-10-13 21:09:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure __automaton_fail [2019-10-13 21:09:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure bigMacCall [2019-10-13 21:09:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure threeTS [2019-10-13 21:09:08,901 INFO L130 BoogieDeclarations]: Found specification of procedure bobCall [2019-10-13 21:09:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure cleanup [2019-10-13 21:09:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure test [2019-10-13 21:09:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2019-10-13 21:09:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-13 21:09:08,902 INFO L130 BoogieDeclarations]: Found specification of procedure free [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_set [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-13 21:09:08,903 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_free [2019-10-13 21:09:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-13 21:09:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__exception__cf_handler_reset [2019-10-13 21:09:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~int~X~int~TO~int [2019-10-13 21:09:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-13 21:09:08,904 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__error_stack_mgt [2019-10-13 21:09:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_arg [2019-10-13 21:09:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure __utac__get_this_argtype [2019-10-13 21:09:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure select_one [2019-10-13 21:09:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure select_features [2019-10-13 21:09:08,905 INFO L130 BoogieDeclarations]: Found specification of procedure select_helpers [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure valid_product [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure exit [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure get_nondetMinMax07 [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure aliceCall [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure angelinaCall [2019-10-13 21:09:08,906 INFO L130 BoogieDeclarations]: Found specification of procedure chuckCall [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure monicaCall [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure randomSequenceOfActions [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure runTest_Simple [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure Specification1 [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure Specification2 [2019-10-13 21:09:08,907 INFO L130 BoogieDeclarations]: Found specification of procedure Specification3 [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure setup [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure runTest [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure callOnFloor [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-13 21:09:08,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-10-13 21:09:08,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-13 21:09:11,291 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-13 21:09:11,291 INFO L284 CfgBuilder]: Removed 10 assume(true) statements. [2019-10-13 21:09:11,293 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,293 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-13 21:09:11,295 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-13 21:09:11,295 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-13 21:09:11,299 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-13 21:09:11,300 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,300 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4323b5 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,301 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,301 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e4323b5 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,301 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,303 INFO L109 eAbstractionObserver]: Analyzing ICFG elevator_spec14_product19.cil.c [2019-10-13 21:09:11,313 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-13 21:09:11,323 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-13 21:09:11,335 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-13 21:09:11,375 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-13 21:09:11,375 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-13 21:09:11,375 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-13 21:09:11,375 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-13 21:09:11,375 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-13 21:09:11,375 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-13 21:09:11,376 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-13 21:09:11,376 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-13 21:09:11,423 INFO L276 IsEmpty]: Start isEmpty. Operand 735 states. [2019-10-13 21:09:11,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2019-10-13 21:09:11,457 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:11,458 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,460 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:11,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:11,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1411507135, now seen corresponding path program 1 times [2019-10-13 21:09:11,474 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:11,475 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218930461] [2019-10-13 21:09:11,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,475 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:11,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,144 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,146 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218930461] [2019-10-13 21:09:12,147 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,147 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,148 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965110792] [2019-10-13 21:09:12,155 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,157 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,176 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,177 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,180 INFO L87 Difference]: Start difference. First operand 735 states. Second operand 4 states. [2019-10-13 21:09:12,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:12,367 INFO L93 Difference]: Finished difference Result 1168 states and 1874 transitions. [2019-10-13 21:09:12,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:12,368 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 135 [2019-10-13 21:09:12,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:12,391 INFO L225 Difference]: With dead ends: 1168 [2019-10-13 21:09:12,392 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:12,404 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,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:12,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:12,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:12,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 928 transitions. [2019-10-13 21:09:12,526 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 928 transitions. Word has length 135 [2019-10-13 21:09:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:12,526 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 928 transitions. [2019-10-13 21:09:12,527 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:12,527 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 928 transitions. [2019-10-13 21:09:12,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 137 [2019-10-13 21:09:12,535 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,535 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,536 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,536 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,536 INFO L82 PathProgramCache]: Analyzing trace with hash 1349279833, now seen corresponding path program 1 times [2019-10-13 21:09:12,536 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,537 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445333104] [2019-10-13 21:09:12,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,537 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,537 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:12,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:12,824 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,824 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445333104] [2019-10-13 21:09:12,824 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:12,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:12,825 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102364679] [2019-10-13 21:09:12,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:12,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:12,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:12,828 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:12,828 INFO L87 Difference]: Start difference. First operand 587 states and 928 transitions. Second operand 4 states. [2019-10-13 21:09:12,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:12,913 INFO L93 Difference]: Finished difference Result 1141 states and 1817 transitions. [2019-10-13 21:09:12,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:12,914 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 136 [2019-10-13 21:09:12,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:12,919 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:09:12,919 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:12,923 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,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:12,961 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:12,961 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:12,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 927 transitions. [2019-10-13 21:09:12,969 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 927 transitions. Word has length 136 [2019-10-13 21:09:12,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:12,975 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 927 transitions. [2019-10-13 21:09:12,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:12,976 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 927 transitions. [2019-10-13 21:09:12,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2019-10-13 21:09:12,985 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:12,985 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:12,986 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:12,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:12,993 INFO L82 PathProgramCache]: Analyzing trace with hash 1382966461, now seen corresponding path program 1 times [2019-10-13 21:09:12,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:12,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227423036] [2019-10-13 21:09:12,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,996 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:12,997 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,218 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,218 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227423036] [2019-10-13 21:09:13,219 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,219 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,219 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211441712] [2019-10-13 21:09:13,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,223 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,223 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,223 INFO L87 Difference]: Start difference. First operand 587 states and 927 transitions. Second operand 4 states. [2019-10-13 21:09:13,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,308 INFO L93 Difference]: Finished difference Result 1141 states and 1816 transitions. [2019-10-13 21:09:13,308 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,308 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 137 [2019-10-13 21:09:13,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,315 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:09:13,315 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:13,318 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,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:13,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:13,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:13,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 926 transitions. [2019-10-13 21:09:13,367 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 926 transitions. Word has length 137 [2019-10-13 21:09:13,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,367 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 926 transitions. [2019-10-13 21:09:13,368 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,368 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 926 transitions. [2019-10-13 21:09:13,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 139 [2019-10-13 21:09:13,374 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,374 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,375 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,375 INFO L82 PathProgramCache]: Analyzing trace with hash -1519078827, now seen corresponding path program 1 times [2019-10-13 21:09:13,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,376 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [481032915] [2019-10-13 21:09:13,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,532 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,532 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [481032915] [2019-10-13 21:09:13,533 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,533 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,533 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916878111] [2019-10-13 21:09:13,534 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,534 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,535 INFO L87 Difference]: Start difference. First operand 587 states and 926 transitions. Second operand 4 states. [2019-10-13 21:09:13,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:13,618 INFO L93 Difference]: Finished difference Result 1141 states and 1815 transitions. [2019-10-13 21:09:13,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:13,619 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 138 [2019-10-13 21:09:13,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:13,624 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:09:13,624 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:13,631 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,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:13,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:13,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:13,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 925 transitions. [2019-10-13 21:09:13,671 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 925 transitions. Word has length 138 [2019-10-13 21:09:13,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:13,672 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 925 transitions. [2019-10-13 21:09:13,672 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:13,672 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 925 transitions. [2019-10-13 21:09:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-10-13 21:09:13,678 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:13,678 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,679 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:13,679 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:13,679 INFO L82 PathProgramCache]: Analyzing trace with hash -939532999, now seen corresponding path program 1 times [2019-10-13 21:09:13,679 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:13,680 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [692302393] [2019-10-13 21:09:13,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,680 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:13,681 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:13,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:13,839 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,840 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [692302393] [2019-10-13 21:09:13,840 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:13,841 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:13,841 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621781697] [2019-10-13 21:09:13,841 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:13,842 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:13,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:13,843 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:13,843 INFO L87 Difference]: Start difference. First operand 587 states and 925 transitions. Second operand 4 states. [2019-10-13 21:09:14,000 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,000 INFO L93 Difference]: Finished difference Result 1141 states and 1814 transitions. [2019-10-13 21:09:14,001 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-13 21:09:14,001 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 139 [2019-10-13 21:09:14,001 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,005 INFO L225 Difference]: With dead ends: 1141 [2019-10-13 21:09:14,006 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:14,009 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,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:14,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:14,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:14,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 924 transitions. [2019-10-13 21:09:14,035 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 924 transitions. Word has length 139 [2019-10-13 21:09:14,035 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,035 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 924 transitions. [2019-10-13 21:09:14,035 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,036 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 924 transitions. [2019-10-13 21:09:14,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,040 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,040 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,040 INFO L410 AbstractCegarLoop]: === Iteration 6 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,041 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,041 INFO L82 PathProgramCache]: Analyzing trace with hash 195155025, now seen corresponding path program 1 times [2019-10-13 21:09:14,041 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,041 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [484378227] [2019-10-13 21:09:14,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,042 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,042 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,240 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,240 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [484378227] [2019-10-13 21:09:14,241 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,243 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-10-13 21:09:14,244 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [153155277] [2019-10-13 21:09:14,244 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-13 21:09:14,244 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-13 21:09:14,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2019-10-13 21:09:14,246 INFO L87 Difference]: Start difference. First operand 587 states and 924 transitions. Second operand 10 states. [2019-10-13 21:09:14,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,433 INFO L93 Difference]: Finished difference Result 1146 states and 1821 transitions. [2019-10-13 21:09:14,434 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:14,434 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 140 [2019-10-13 21:09:14,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,439 INFO L225 Difference]: With dead ends: 1146 [2019-10-13 21:09:14,439 INFO L226 Difference]: Without dead ends: 596 [2019-10-13 21:09:14,442 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,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 596 states. [2019-10-13 21:09:14,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 596 to 594. [2019-10-13 21:09:14,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 594 states. [2019-10-13 21:09:14,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 594 states to 594 states and 934 transitions. [2019-10-13 21:09:14,474 INFO L78 Accepts]: Start accepts. Automaton has 594 states and 934 transitions. Word has length 140 [2019-10-13 21:09:14,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,475 INFO L462 AbstractCegarLoop]: Abstraction has 594 states and 934 transitions. [2019-10-13 21:09:14,475 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-13 21:09:14,475 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 934 transitions. [2019-10-13 21:09:14,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2019-10-13 21:09:14,481 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,481 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,481 INFO L410 AbstractCegarLoop]: === Iteration 7 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,481 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,482 INFO L82 PathProgramCache]: Analyzing trace with hash -791427664, now seen corresponding path program 1 times [2019-10-13 21:09:14,482 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,482 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346574248] [2019-10-13 21:09:14,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,482 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,483 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,595 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,595 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346574248] [2019-10-13 21:09:14,596 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,596 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-13 21:09:14,596 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206402076] [2019-10-13 21:09:14,596 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-13 21:09:14,597 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-13 21:09:14,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-13 21:09:14,597 INFO L87 Difference]: Start difference. First operand 594 states and 934 transitions. Second operand 4 states. [2019-10-13 21:09:14,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:14,659 INFO L93 Difference]: Finished difference Result 1147 states and 1822 transitions. [2019-10-13 21:09:14,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-13 21:09:14,659 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 140 [2019-10-13 21:09:14,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:14,671 INFO L225 Difference]: With dead ends: 1147 [2019-10-13 21:09:14,672 INFO L226 Difference]: Without dead ends: 590 [2019-10-13 21:09:14,676 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,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 590 states. [2019-10-13 21:09:14,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 590 to 590. [2019-10-13 21:09:14,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 590 states. [2019-10-13 21:09:14,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 590 states to 590 states and 927 transitions. [2019-10-13 21:09:14,705 INFO L78 Accepts]: Start accepts. Automaton has 590 states and 927 transitions. Word has length 140 [2019-10-13 21:09:14,705 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:14,705 INFO L462 AbstractCegarLoop]: Abstraction has 590 states and 927 transitions. [2019-10-13 21:09:14,705 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-13 21:09:14,705 INFO L276 IsEmpty]: Start isEmpty. Operand 590 states and 927 transitions. [2019-10-13 21:09:14,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 142 [2019-10-13 21:09:14,711 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:14,711 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,711 INFO L410 AbstractCegarLoop]: === Iteration 8 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:14,711 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:14,712 INFO L82 PathProgramCache]: Analyzing trace with hash -306965809, now seen corresponding path program 1 times [2019-10-13 21:09:14,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:14,713 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859064802] [2019-10-13 21:09:14,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,713 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:14,713 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:14,889 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,890 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859064802] [2019-10-13 21:09:14,890 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:14,890 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:14,890 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260837561] [2019-10-13 21:09:14,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:14,891 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:14,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:14,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:14,892 INFO L87 Difference]: Start difference. First operand 590 states and 927 transitions. Second operand 6 states. [2019-10-13 21:09:15,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,240 INFO L93 Difference]: Finished difference Result 1160 states and 1846 transitions. [2019-10-13 21:09:15,240 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-10-13 21:09:15,240 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 141 [2019-10-13 21:09:15,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,245 INFO L225 Difference]: With dead ends: 1160 [2019-10-13 21:09:15,246 INFO L226 Difference]: Without dead ends: 598 [2019-10-13 21:09:15,249 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,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2019-10-13 21:09:15,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 595. [2019-10-13 21:09:15,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:09:15,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 928 transitions. [2019-10-13 21:09:15,282 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 928 transitions. Word has length 141 [2019-10-13 21:09:15,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,283 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 928 transitions. [2019-10-13 21:09:15,283 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,283 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 928 transitions. [2019-10-13 21:09:15,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 143 [2019-10-13 21:09:15,290 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,291 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,291 INFO L410 AbstractCegarLoop]: === Iteration 9 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,291 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,292 INFO L82 PathProgramCache]: Analyzing trace with hash 394745588, now seen corresponding path program 1 times [2019-10-13 21:09:15,292 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,292 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1502878118] [2019-10-13 21:09:15,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,293 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,293 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:15,498 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,499 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1502878118] [2019-10-13 21:09:15,499 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:15,500 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:15,500 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1801941430] [2019-10-13 21:09:15,500 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:15,501 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:15,501 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:15,502 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:15,502 INFO L87 Difference]: Start difference. First operand 595 states and 928 transitions. Second operand 6 states. [2019-10-13 21:09:15,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:15,777 INFO L93 Difference]: Finished difference Result 1123 states and 1761 transitions. [2019-10-13 21:09:15,778 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:15,779 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 142 [2019-10-13 21:09:15,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:15,785 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:09:15,786 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:09:15,789 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,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:09:15,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:09:15,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:09:15,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 924 transitions. [2019-10-13 21:09:15,815 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 924 transitions. Word has length 142 [2019-10-13 21:09:15,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:15,815 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 924 transitions. [2019-10-13 21:09:15,815 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:15,815 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 924 transitions. [2019-10-13 21:09:15,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:15,820 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:15,820 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,821 INFO L410 AbstractCegarLoop]: === Iteration 10 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:15,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:15,821 INFO L82 PathProgramCache]: Analyzing trace with hash -447409932, now seen corresponding path program 1 times [2019-10-13 21:09:15,821 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:15,822 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [133227175] [2019-10-13 21:09:15,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,822 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:15,822 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:15,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,036 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,037 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [133227175] [2019-10-13 21:09:16,039 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,040 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,041 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1768169862] [2019-10-13 21:09:16,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,042 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,043 INFO L87 Difference]: Start difference. First operand 595 states and 924 transitions. Second operand 6 states. [2019-10-13 21:09:16,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,276 INFO L93 Difference]: Finished difference Result 1123 states and 1757 transitions. [2019-10-13 21:09:16,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 143 [2019-10-13 21:09:16,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,283 INFO L225 Difference]: With dead ends: 1123 [2019-10-13 21:09:16,283 INFO L226 Difference]: Without dead ends: 595 [2019-10-13 21:09:16,290 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,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2019-10-13 21:09:16,309 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 595. [2019-10-13 21:09:16,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 595 states. [2019-10-13 21:09:16,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 595 states to 595 states and 920 transitions. [2019-10-13 21:09:16,325 INFO L78 Accepts]: Start accepts. Automaton has 595 states and 920 transitions. Word has length 143 [2019-10-13 21:09:16,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,326 INFO L462 AbstractCegarLoop]: Abstraction has 595 states and 920 transitions. [2019-10-13 21:09:16,326 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,326 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 920 transitions. [2019-10-13 21:09:16,330 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 144 [2019-10-13 21:09:16,330 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,331 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,331 INFO L410 AbstractCegarLoop]: === Iteration 11 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,331 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,331 INFO L82 PathProgramCache]: Analyzing trace with hash -170078860, now seen corresponding path program 1 times [2019-10-13 21:09:16,332 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,332 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [613111112] [2019-10-13 21:09:16,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,332 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,485 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,486 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [613111112] [2019-10-13 21:09:16,486 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,486 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-10-13 21:09:16,486 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833267112] [2019-10-13 21:09:16,487 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-13 21:09:16,487 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,487 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-13 21:09:16,487 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-10-13 21:09:16,488 INFO L87 Difference]: Start difference. First operand 595 states and 920 transitions. Second operand 7 states. [2019-10-13 21:09:16,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,605 INFO L93 Difference]: Finished difference Result 1126 states and 1757 transitions. [2019-10-13 21:09:16,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:16,606 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 143 [2019-10-13 21:09:16,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,611 INFO L225 Difference]: With dead ends: 1126 [2019-10-13 21:09:16,611 INFO L226 Difference]: Without dead ends: 577 [2019-10-13 21:09:16,615 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,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 577 states. [2019-10-13 21:09:16,639 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 577 to 574. [2019-10-13 21:09:16,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:16,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 883 transitions. [2019-10-13 21:09:16,644 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 883 transitions. Word has length 143 [2019-10-13 21:09:16,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,644 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 883 transitions. [2019-10-13 21:09:16,644 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-13 21:09:16,645 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 883 transitions. [2019-10-13 21:09:16,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2019-10-13 21:09:16,650 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:16,650 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,651 INFO L410 AbstractCegarLoop]: === Iteration 12 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash -1904799623, now seen corresponding path program 1 times [2019-10-13 21:09:16,652 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:16,652 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700504586] [2019-10-13 21:09:16,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,652 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:16,653 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:16,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:16,825 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,825 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700504586] [2019-10-13 21:09:16,825 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:16,825 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:16,826 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035199081] [2019-10-13 21:09:16,827 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:16,827 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:16,827 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:16,827 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:16,828 INFO L87 Difference]: Start difference. First operand 574 states and 883 transitions. Second operand 6 states. [2019-10-13 21:09:16,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:16,968 INFO L93 Difference]: Finished difference Result 1102 states and 1716 transitions. [2019-10-13 21:09:16,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:16,969 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 144 [2019-10-13 21:09:16,969 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:16,974 INFO L225 Difference]: With dead ends: 1102 [2019-10-13 21:09:16,974 INFO L226 Difference]: Without dead ends: 574 [2019-10-13 21:09:16,977 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,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-13 21:09:16,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-13 21:09:16,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:16,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 882 transitions. [2019-10-13 21:09:16,999 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 882 transitions. Word has length 144 [2019-10-13 21:09:16,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:16,999 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 882 transitions. [2019-10-13 21:09:16,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:16,999 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 882 transitions. [2019-10-13 21:09:17,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2019-10-13 21:09:17,003 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,004 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,004 INFO L410 AbstractCegarLoop]: === Iteration 13 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,004 INFO L82 PathProgramCache]: Analyzing trace with hash -959612135, now seen corresponding path program 1 times [2019-10-13 21:09:17,004 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,005 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962975025] [2019-10-13 21:09:17,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,005 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,168 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,168 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962975025] [2019-10-13 21:09:17,169 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,169 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-13 21:09:17,169 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37090850] [2019-10-13 21:09:17,170 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:17,170 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:17,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-10-13 21:09:17,171 INFO L87 Difference]: Start difference. First operand 574 states and 882 transitions. Second operand 6 states. [2019-10-13 21:09:17,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,301 INFO L93 Difference]: Finished difference Result 1102 states and 1715 transitions. [2019-10-13 21:09:17,301 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:17,301 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 145 [2019-10-13 21:09:17,302 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,306 INFO L225 Difference]: With dead ends: 1102 [2019-10-13 21:09:17,306 INFO L226 Difference]: Without dead ends: 574 [2019-10-13 21:09:17,309 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,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 574 states. [2019-10-13 21:09:17,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 574 to 574. [2019-10-13 21:09:17,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 574 states. [2019-10-13 21:09:17,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 574 states to 574 states and 881 transitions. [2019-10-13 21:09:17,330 INFO L78 Accepts]: Start accepts. Automaton has 574 states and 881 transitions. Word has length 145 [2019-10-13 21:09:17,331 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,331 INFO L462 AbstractCegarLoop]: Abstraction has 574 states and 881 transitions. [2019-10-13 21:09:17,331 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:17,331 INFO L276 IsEmpty]: Start isEmpty. Operand 574 states and 881 transitions. [2019-10-13 21:09:17,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 147 [2019-10-13 21:09:17,335 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,335 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,336 INFO L410 AbstractCegarLoop]: === Iteration 14 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,336 INFO L82 PathProgramCache]: Analyzing trace with hash 1451023870, now seen corresponding path program 1 times [2019-10-13 21:09:17,336 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,336 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46995422] [2019-10-13 21:09:17,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,337 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,337 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:17,528 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,528 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46995422] [2019-10-13 21:09:17,529 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:17,529 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-10-13 21:09:17,529 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563560675] [2019-10-13 21:09:17,530 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-10-13 21:09:17,530 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:17,531 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-10-13 21:09:17,531 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2019-10-13 21:09:17,532 INFO L87 Difference]: Start difference. First operand 574 states and 881 transitions. Second operand 12 states. [2019-10-13 21:09:17,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:17,807 INFO L93 Difference]: Finished difference Result 1108 states and 1725 transitions. [2019-10-13 21:09:17,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-10-13 21:09:17,808 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 146 [2019-10-13 21:09:17,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:17,812 INFO L225 Difference]: With dead ends: 1108 [2019-10-13 21:09:17,812 INFO L226 Difference]: Without dead ends: 581 [2019-10-13 21:09:17,816 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:17,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 581 states. [2019-10-13 21:09:17,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 581 to 579. [2019-10-13 21:09:17,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 579 states. [2019-10-13 21:09:17,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 579 states to 579 states and 887 transitions. [2019-10-13 21:09:17,840 INFO L78 Accepts]: Start accepts. Automaton has 579 states and 887 transitions. Word has length 146 [2019-10-13 21:09:17,841 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:17,842 INFO L462 AbstractCegarLoop]: Abstraction has 579 states and 887 transitions. [2019-10-13 21:09:17,842 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-10-13 21:09:17,842 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 887 transitions. [2019-10-13 21:09:17,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-10-13 21:09:17,846 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:17,847 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:17,847 INFO L410 AbstractCegarLoop]: === Iteration 15 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:17,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:17,848 INFO L82 PathProgramCache]: Analyzing trace with hash 457980586, now seen corresponding path program 1 times [2019-10-13 21:09:17,848 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:17,848 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732237259] [2019-10-13 21:09:17,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,848 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:17,848 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:17,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,058 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,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732237259] [2019-10-13 21:09:18,058 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [186586068] [2019-10-13 21:09:18,059 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:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:18,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 2628 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:18,637 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:18,757 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:18,757 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:19,124 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,125 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:19,125 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:19,125 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538994056] [2019-10-13 21:09:19,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:19,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:19,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:19,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:19,129 INFO L87 Difference]: Start difference. First operand 579 states and 887 transitions. Second operand 5 states. [2019-10-13 21:09:20,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,087 INFO L93 Difference]: Finished difference Result 1113 states and 1758 transitions. [2019-10-13 21:09:20,087 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:20,088 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 147 [2019-10-13 21:09:20,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,095 INFO L225 Difference]: With dead ends: 1113 [2019-10-13 21:09:20,095 INFO L226 Difference]: Without dead ends: 587 [2019-10-13 21:09:20,101 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 294 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:20,103 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 587 states. [2019-10-13 21:09:20,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 587 to 587. [2019-10-13 21:09:20,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 587 states. [2019-10-13 21:09:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 587 states to 587 states and 900 transitions. [2019-10-13 21:09:20,136 INFO L78 Accepts]: Start accepts. Automaton has 587 states and 900 transitions. Word has length 147 [2019-10-13 21:09:20,137 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,137 INFO L462 AbstractCegarLoop]: Abstraction has 587 states and 900 transitions. [2019-10-13 21:09:20,137 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:20,137 INFO L276 IsEmpty]: Start isEmpty. Operand 587 states and 900 transitions. [2019-10-13 21:09:20,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:20,141 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,141 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,349 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:20,349 INFO L410 AbstractCegarLoop]: === Iteration 16 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,350 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,350 INFO L82 PathProgramCache]: Analyzing trace with hash 1382783305, now seen corresponding path program 1 times [2019-10-13 21:09:20,351 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,351 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1773030913] [2019-10-13 21:09:20,351 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,352 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,352 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,480 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2019-10-13 21:09:20,481 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1773030913] [2019-10-13 21:09:20,481 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:20,481 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-13 21:09:20,481 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159108523] [2019-10-13 21:09:20,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:20,482 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:20,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:20,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:20,483 INFO L87 Difference]: Start difference. First operand 587 states and 900 transitions. Second operand 3 states. [2019-10-13 21:09:20,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:20,519 INFO L93 Difference]: Finished difference Result 1294 states and 1986 transitions. [2019-10-13 21:09:20,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:20,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 150 [2019-10-13 21:09:20,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:20,525 INFO L225 Difference]: With dead ends: 1294 [2019-10-13 21:09:20,526 INFO L226 Difference]: Without dead ends: 760 [2019-10-13 21:09:20,529 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-13 21:09:20,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 760 states. [2019-10-13 21:09:20,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 760 to 757. [2019-10-13 21:09:20,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 757 states. [2019-10-13 21:09:20,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 757 states to 757 states and 1135 transitions. [2019-10-13 21:09:20,562 INFO L78 Accepts]: Start accepts. Automaton has 757 states and 1135 transitions. Word has length 150 [2019-10-13 21:09:20,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:20,563 INFO L462 AbstractCegarLoop]: Abstraction has 757 states and 1135 transitions. [2019-10-13 21:09:20,563 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:20,563 INFO L276 IsEmpty]: Start isEmpty. Operand 757 states and 1135 transitions. [2019-10-13 21:09:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 151 [2019-10-13 21:09:20,567 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:20,567 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,567 INFO L410 AbstractCegarLoop]: === Iteration 17 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:20,568 INFO L82 PathProgramCache]: Analyzing trace with hash 2114750731, now seen corresponding path program 1 times [2019-10-13 21:09:20,568 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:20,568 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [632720288] [2019-10-13 21:09:20,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,568 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:20,568 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:20,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:20,776 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:20,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [632720288] [2019-10-13 21:09:20,777 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [99437581] [2019-10-13 21:09:20,777 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,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:21,337 INFO L256 TraceCheckSpWp]: Trace formula consists of 2634 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:21,345 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:21,424 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,424 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:21,770 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:21,771 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:21,771 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6, 6] total 13 [2019-10-13 21:09:21,771 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253899029] [2019-10-13 21:09:21,772 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:21,773 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:21,773 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:21,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2019-10-13 21:09:21,773 INFO L87 Difference]: Start difference. First operand 757 states and 1135 transitions. Second operand 5 states. [2019-10-13 21:09:22,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:22,730 INFO L93 Difference]: Finished difference Result 1477 states and 2286 transitions. [2019-10-13 21:09:22,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:22,731 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 150 [2019-10-13 21:09:22,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:22,736 INFO L225 Difference]: With dead ends: 1477 [2019-10-13 21:09:22,736 INFO L226 Difference]: Without dead ends: 773 [2019-10-13 21:09:22,741 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:22,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 773 states. [2019-10-13 21:09:22,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 773 to 773. [2019-10-13 21:09:22,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 773 states. [2019-10-13 21:09:22,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1161 transitions. [2019-10-13 21:09:22,775 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1161 transitions. Word has length 150 [2019-10-13 21:09:22,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:22,776 INFO L462 AbstractCegarLoop]: Abstraction has 773 states and 1161 transitions. [2019-10-13 21:09:22,776 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:22,776 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1161 transitions. [2019-10-13 21:09:22,780 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2019-10-13 21:09:22,780 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:22,780 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:22,986 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:22,987 INFO L410 AbstractCegarLoop]: === Iteration 18 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:22,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:22,988 INFO L82 PathProgramCache]: Analyzing trace with hash 395684240, now seen corresponding path program 1 times [2019-10-13 21:09:22,988 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:22,988 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1937999434] [2019-10-13 21:09:22,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,989 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:22,989 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:23,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,169 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,169 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1937999434] [2019-10-13 21:09:23,170 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [93362002] [2019-10-13 21:09:23,170 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:23,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:23,704 INFO L256 TraceCheckSpWp]: Trace formula consists of 2637 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:23,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:23,787 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:23,787 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:24,126 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,127 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:24,127 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 17 [2019-10-13 21:09:24,127 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2050569252] [2019-10-13 21:09:24,128 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:24,128 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:24,128 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:24,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=230, Unknown=0, NotChecked=0, Total=272 [2019-10-13 21:09:24,129 INFO L87 Difference]: Start difference. First operand 773 states and 1161 transitions. Second operand 5 states. [2019-10-13 21:09:25,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:25,040 INFO L93 Difference]: Finished difference Result 1509 states and 2334 transitions. [2019-10-13 21:09:25,040 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:25,040 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 153 [2019-10-13 21:09:25,040 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:25,046 INFO L225 Difference]: With dead ends: 1509 [2019-10-13 21:09:25,046 INFO L226 Difference]: Without dead ends: 789 [2019-10-13 21:09:25,050 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 326 GetRequests, 306 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2019-10-13 21:09:25,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 789 states. [2019-10-13 21:09:25,077 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 789 to 789. [2019-10-13 21:09:25,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 789 states. [2019-10-13 21:09:25,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 789 states to 789 states and 1187 transitions. [2019-10-13 21:09:25,081 INFO L78 Accepts]: Start accepts. Automaton has 789 states and 1187 transitions. Word has length 153 [2019-10-13 21:09:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:25,082 INFO L462 AbstractCegarLoop]: Abstraction has 789 states and 1187 transitions. [2019-10-13 21:09:25,082 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 789 states and 1187 transitions. [2019-10-13 21:09:25,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 157 [2019-10-13 21:09:25,087 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:25,088 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,295 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:25,296 INFO L410 AbstractCegarLoop]: === Iteration 19 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:25,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:25,296 INFO L82 PathProgramCache]: Analyzing trace with hash 110325351, now seen corresponding path program 1 times [2019-10-13 21:09:25,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:25,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1311403189] [2019-10-13 21:09:25,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,298 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:25,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:25,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,451 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:25,451 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1311403189] [2019-10-13 21:09:25,452 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200444694] [2019-10-13 21:09:25,452 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:25,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:25,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 2640 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-13 21:09:25,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:26,031 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,031 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:26,413 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:26,414 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:26,414 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 6] total 16 [2019-10-13 21:09:26,414 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011945524] [2019-10-13 21:09:26,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-13 21:09:26,415 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:26,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-13 21:09:26,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2019-10-13 21:09:26,415 INFO L87 Difference]: Start difference. First operand 789 states and 1187 transitions. Second operand 5 states. [2019-10-13 21:09:27,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:27,253 INFO L93 Difference]: Finished difference Result 1541 states and 2382 transitions. [2019-10-13 21:09:27,253 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-10-13 21:09:27,254 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 156 [2019-10-13 21:09:27,254 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:27,259 INFO L225 Difference]: With dead ends: 1541 [2019-10-13 21:09:27,259 INFO L226 Difference]: Without dead ends: 805 [2019-10-13 21:09:27,263 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,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 805 states. [2019-10-13 21:09:27,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 805 to 805. [2019-10-13 21:09:27,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 805 states. [2019-10-13 21:09:27,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 805 states to 805 states and 1213 transitions. [2019-10-13 21:09:27,292 INFO L78 Accepts]: Start accepts. Automaton has 805 states and 1213 transitions. Word has length 156 [2019-10-13 21:09:27,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:27,292 INFO L462 AbstractCegarLoop]: Abstraction has 805 states and 1213 transitions. [2019-10-13 21:09:27,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-13 21:09:27,293 INFO L276 IsEmpty]: Start isEmpty. Operand 805 states and 1213 transitions. [2019-10-13 21:09:27,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2019-10-13 21:09:27,297 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:27,297 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:27,510 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:27,511 INFO L410 AbstractCegarLoop]: === Iteration 20 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:27,512 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:27,512 INFO L82 PathProgramCache]: Analyzing trace with hash -638133708, now seen corresponding path program 1 times [2019-10-13 21:09:27,512 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:27,513 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964599438] [2019-10-13 21:09:27,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,513 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:27,514 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:27,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:27,663 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:27,663 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [964599438] [2019-10-13 21:09:27,664 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457360958] [2019-10-13 21:09:27,664 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,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:28,167 INFO L256 TraceCheckSpWp]: Trace formula consists of 2643 conjuncts, 29 conjunts are in the unsatisfiable core [2019-10-13 21:09:28,189 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:28,255 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,255 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:28,406 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:28,407 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:28,407 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5, 5] imperfect sequences [10] total 14 [2019-10-13 21:09:28,407 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333400060] [2019-10-13 21:09:28,408 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-10-13 21:09:28,408 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:28,409 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-10-13 21:09:28,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=154, Unknown=0, NotChecked=0, Total=182 [2019-10-13 21:09:28,409 INFO L87 Difference]: Start difference. First operand 805 states and 1213 transitions. Second operand 6 states. [2019-10-13 21:09:29,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:29,272 INFO L93 Difference]: Finished difference Result 2313 states and 3577 transitions. [2019-10-13 21:09:29,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-13 21:09:29,273 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 159 [2019-10-13 21:09:29,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:29,286 INFO L225 Difference]: With dead ends: 2313 [2019-10-13 21:09:29,286 INFO L226 Difference]: Without dead ends: 1562 [2019-10-13 21:09:29,290 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,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1562 states. [2019-10-13 21:09:29,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1562 to 1553. [2019-10-13 21:09:29,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-10-13 21:09:29,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2382 transitions. [2019-10-13 21:09:29,365 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2382 transitions. Word has length 159 [2019-10-13 21:09:29,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:29,367 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 2382 transitions. [2019-10-13 21:09:29,367 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-10-13 21:09:29,367 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2382 transitions. [2019-10-13 21:09:29,372 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:29,372 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:29,372 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:29,579 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:29,579 INFO L410 AbstractCegarLoop]: === Iteration 21 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:29,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:29,580 INFO L82 PathProgramCache]: Analyzing trace with hash -842544841, now seen corresponding path program 1 times [2019-10-13 21:09:29,580 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:29,581 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691238224] [2019-10-13 21:09:29,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,581 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:29,581 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:29,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:29,756 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:29,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691238224] [2019-10-13 21:09:29,757 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1215221582] [2019-10-13 21:09:29,757 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:30,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:30,270 INFO L256 TraceCheckSpWp]: Trace formula consists of 2660 conjuncts, 2 conjunts are in the unsatisfiable core [2019-10-13 21:09:30,277 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:30,313 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:30,314 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:30,425 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:30,425 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2019-10-13 21:09:30,425 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [10] total 11 [2019-10-13 21:09:30,425 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936989072] [2019-10-13 21:09:30,426 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-13 21:09:30,426 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:30,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-13 21:09:30,427 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=91, Unknown=0, NotChecked=0, Total=110 [2019-10-13 21:09:30,427 INFO L87 Difference]: Start difference. First operand 1553 states and 2382 transitions. Second operand 3 states. [2019-10-13 21:09:30,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:30,567 INFO L93 Difference]: Finished difference Result 3793 states and 5903 transitions. [2019-10-13 21:09:30,568 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-13 21:09:30,568 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 164 [2019-10-13 21:09:30,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:30,584 INFO L225 Difference]: With dead ends: 3793 [2019-10-13 21:09:30,584 INFO L226 Difference]: Without dead ends: 2296 [2019-10-13 21:09:30,592 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:30,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2296 states. [2019-10-13 21:09:30,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2296 to 1553. [2019-10-13 21:09:30,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1553 states. [2019-10-13 21:09:30,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1553 states to 1553 states and 2381 transitions. [2019-10-13 21:09:30,660 INFO L78 Accepts]: Start accepts. Automaton has 1553 states and 2381 transitions. Word has length 164 [2019-10-13 21:09:30,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:30,661 INFO L462 AbstractCegarLoop]: Abstraction has 1553 states and 2381 transitions. [2019-10-13 21:09:30,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-13 21:09:30,661 INFO L276 IsEmpty]: Start isEmpty. Operand 1553 states and 2381 transitions. [2019-10-13 21:09:30,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 165 [2019-10-13 21:09:30,665 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:30,666 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,873 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:30,874 INFO L410 AbstractCegarLoop]: === Iteration 22 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:30,875 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:30,875 INFO L82 PathProgramCache]: Analyzing trace with hash -418898119, now seen corresponding path program 1 times [2019-10-13 21:09:30,875 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:30,876 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989758606] [2019-10-13 21:09:30,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,876 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:30,877 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:30,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:31,103 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,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989758606] [2019-10-13 21:09:31,104 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1949968392] [2019-10-13 21:09:31,104 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:31,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:31,620 INFO L256 TraceCheckSpWp]: Trace formula consists of 2659 conjuncts, 49 conjunts are in the unsatisfiable core [2019-10-13 21:09:31,625 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-13 21:09:31,722 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:31,722 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-13 21:09:32,093 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,094 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-13 21:09:32,094 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 10] total 21 [2019-10-13 21:09:32,094 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1048496234] [2019-10-13 21:09:32,094 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:32,095 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:32,095 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:32,095 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=349, Unknown=0, NotChecked=0, Total=420 [2019-10-13 21:09:32,095 INFO L87 Difference]: Start difference. First operand 1553 states and 2381 transitions. Second operand 9 states. [2019-10-13 21:09:38,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:38,297 INFO L93 Difference]: Finished difference Result 4772 states and 7488 transitions. [2019-10-13 21:09:38,298 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:38,298 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 164 [2019-10-13 21:09:38,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:38,321 INFO L225 Difference]: With dead ends: 4772 [2019-10-13 21:09:38,322 INFO L226 Difference]: Without dead ends: 3272 [2019-10-13 21:09:38,332 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:38,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3272 states. [2019-10-13 21:09:38,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3272 to 3215. [2019-10-13 21:09:38,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3215 states. [2019-10-13 21:09:38,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3215 states to 3215 states and 4995 transitions. [2019-10-13 21:09:38,486 INFO L78 Accepts]: Start accepts. Automaton has 3215 states and 4995 transitions. Word has length 164 [2019-10-13 21:09:38,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:38,487 INFO L462 AbstractCegarLoop]: Abstraction has 3215 states and 4995 transitions. [2019-10-13 21:09:38,487 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:38,487 INFO L276 IsEmpty]: Start isEmpty. Operand 3215 states and 4995 transitions. [2019-10-13 21:09:38,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2019-10-13 21:09:38,495 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:38,496 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:38,703 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-13 21:09:38,704 INFO L410 AbstractCegarLoop]: === Iteration 23 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:38,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:38,704 INFO L82 PathProgramCache]: Analyzing trace with hash -1389850385, now seen corresponding path program 1 times [2019-10-13 21:09:38,704 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:38,704 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389596451] [2019-10-13 21:09:38,704 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:38,705 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:38,705 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:38,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:38,900 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:38,901 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389596451] [2019-10-13 21:09:38,901 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-13 21:09:38,901 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-13 21:09:38,901 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248411283] [2019-10-13 21:09:38,902 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-10-13 21:09:38,902 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-13 21:09:38,902 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-10-13 21:09:38,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2019-10-13 21:09:38,903 INFO L87 Difference]: Start difference. First operand 3215 states and 4995 transitions. Second operand 9 states. [2019-10-13 21:09:39,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-13 21:09:39,135 INFO L93 Difference]: Finished difference Result 6229 states and 9715 transitions. [2019-10-13 21:09:39,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-13 21:09:39,138 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 167 [2019-10-13 21:09:39,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-13 21:09:39,159 INFO L225 Difference]: With dead ends: 6229 [2019-10-13 21:09:39,159 INFO L226 Difference]: Without dead ends: 3061 [2019-10-13 21:09:39,174 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,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3061 states. [2019-10-13 21:09:39,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3061 to 3053. [2019-10-13 21:09:39,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3053 states. [2019-10-13 21:09:39,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3053 states to 3053 states and 4745 transitions. [2019-10-13 21:09:39,290 INFO L78 Accepts]: Start accepts. Automaton has 3053 states and 4745 transitions. Word has length 167 [2019-10-13 21:09:39,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-13 21:09:39,291 INFO L462 AbstractCegarLoop]: Abstraction has 3053 states and 4745 transitions. [2019-10-13 21:09:39,291 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-10-13 21:09:39,291 INFO L276 IsEmpty]: Start isEmpty. Operand 3053 states and 4745 transitions. [2019-10-13 21:09:39,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 171 [2019-10-13 21:09:39,296 INFO L372 BasicCegarLoop]: Found error trace [2019-10-13 21:09:39,296 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,296 INFO L410 AbstractCegarLoop]: === Iteration 24 === [__automaton_failErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-13 21:09:39,296 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-13 21:09:39,297 INFO L82 PathProgramCache]: Analyzing trace with hash -857589213, now seen corresponding path program 1 times [2019-10-13 21:09:39,297 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-13 21:09:39,297 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [736298141] [2019-10-13 21:09:39,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,297 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-13 21:09:39,297 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-13 21:09:39,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-13 21:09:39,447 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 48 trivial. 0 not checked. [2019-10-13 21:09:39,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [736298141] [2019-10-13 21:09:39,448 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1011797283] [2019-10-13 21:09:39,448 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true