/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data -s ../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf -tc ../../../trunk/examples/toolchains/AutomizerC.xml --sifa.abstract.domain OctagonDomain -i ../sv-benchmarks/c/recursive-simple/sum_20x0-2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.3-dev-f954360 [2023-04-01 06:07:51,443 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-04-01 06:07:51,445 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-04-01 06:07:51,481 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-04-01 06:07:51,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-04-01 06:07:51,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-04-01 06:07:51,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-04-01 06:07:51,485 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-04-01 06:07:51,486 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-04-01 06:07:51,487 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-04-01 06:07:51,487 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-04-01 06:07:51,488 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-04-01 06:07:51,488 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-04-01 06:07:51,489 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-04-01 06:07:51,490 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-04-01 06:07:51,490 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-04-01 06:07:51,491 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-04-01 06:07:51,492 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-04-01 06:07:51,497 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-04-01 06:07:51,502 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-04-01 06:07:51,503 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-04-01 06:07:51,508 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-04-01 06:07:51,508 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-04-01 06:07:51,509 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-04-01 06:07:51,511 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-04-01 06:07:51,511 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-04-01 06:07:51,511 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-04-01 06:07:51,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-04-01 06:07:51,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-04-01 06:07:51,512 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-04-01 06:07:51,513 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-04-01 06:07:51,513 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-04-01 06:07:51,513 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-04-01 06:07:51,514 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-04-01 06:07:51,514 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-04-01 06:07:51,514 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-04-01 06:07:51,515 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-04-01 06:07:51,515 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-04-01 06:07:51,515 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-04-01 06:07:51,516 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-04-01 06:07:51,516 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-04-01 06:07:51,521 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/taipan/svcomp-Reach-32bit-Taipan_Default.epf [2023-04-01 06:07:51,548 INFO L113 SettingsManager]: Loading preferences was successful [2023-04-01 06:07:51,548 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-04-01 06:07:51,548 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-04-01 06:07:51,548 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-04-01 06:07:51,549 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * User list type=DISABLED [2023-04-01 06:07:51,549 INFO L136 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Explicit value domain=true [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Octagon Domain=false [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Abstract domain=CompoundDomain [2023-04-01 06:07:51,549 INFO L138 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * Use the RCFG-of-the-future interface=true [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * Interval Domain=false [2023-04-01 06:07:51,550 INFO L136 SettingsManager]: Preferences of Sifa differ from their defaults: [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * Call Summarizer=TopInputCallSummarizer [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * Simplification Technique=POLY_PAC [2023-04-01 06:07:51,550 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * sizeof long=4 [2023-04-01 06:07:51,550 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * sizeof long double=12 [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Use constant arrays=true [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-04-01 06:07:51,551 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-04-01 06:07:51,551 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:07:51,552 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Trace refinement strategy=SIFA_TAIPAN [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-04-01 06:07:51,552 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2023-04-01 06:07:51,554 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.sifa: Abstract Domain -> OctagonDomain [2023-04-01 06:07:51,744 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-04-01 06:07:51,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-04-01 06:07:51,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-04-01 06:07:51,770 INFO L271 PluginConnector]: Initializing CDTParser... [2023-04-01 06:07:51,771 INFO L275 PluginConnector]: CDTParser initialized [2023-04-01 06:07:51,772 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/sum_20x0-2.c [2023-04-01 06:07:52,835 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-04-01 06:07:53,004 INFO L351 CDTParser]: Found 1 translation units. [2023-04-01 06:07:53,005 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c [2023-04-01 06:07:53,009 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56375f547/6bc341bf43504eb6a7ceb8a3130eecb9/FLAG0f18df726 [2023-04-01 06:07:53,022 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56375f547/6bc341bf43504eb6a7ceb8a3130eecb9 [2023-04-01 06:07:53,024 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-04-01 06:07:53,027 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2023-04-01 06:07:53,030 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-04-01 06:07:53,030 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-04-01 06:07:53,032 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-04-01 06:07:53,033 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,034 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@35863ac5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53, skipping insertion in model container [2023-04-01 06:07:53,034 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,040 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-04-01 06:07:53,049 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-04-01 06:07:53,157 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c[481,494] [2023-04-01 06:07:53,160 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:07:53,167 INFO L203 MainTranslator]: Completed pre-run [2023-04-01 06:07:53,178 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/sum_20x0-2.c[481,494] [2023-04-01 06:07:53,179 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-04-01 06:07:53,188 INFO L208 MainTranslator]: Completed translation [2023-04-01 06:07:53,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53 WrapperNode [2023-04-01 06:07:53,188 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-04-01 06:07:53,189 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-04-01 06:07:53,190 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-04-01 06:07:53,190 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-04-01 06:07:53,197 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,198 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,203 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,203 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,208 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,208 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,209 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,209 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,210 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-04-01 06:07:53,211 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-04-01 06:07:53,211 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-04-01 06:07:53,211 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-04-01 06:07:53,212 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (1/1) ... [2023-04-01 06:07:53,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-04-01 06:07:53,225 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:53,235 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-04-01 06:07:53,237 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-04-01 06:07:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2023-04-01 06:07:53,260 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-04-01 06:07:53,261 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2023-04-01 06:07:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure sum [2023-04-01 06:07:53,263 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2023-04-01 06:07:53,263 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2023-04-01 06:07:53,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2023-04-01 06:07:53,263 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure sum [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-04-01 06:07:53,264 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-04-01 06:07:53,315 INFO L236 CfgBuilder]: Building ICFG [2023-04-01 06:07:53,317 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-04-01 06:07:53,422 INFO L277 CfgBuilder]: Performing block encoding [2023-04-01 06:07:53,432 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-04-01 06:07:53,432 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-04-01 06:07:53,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:07:53 BoogieIcfgContainer [2023-04-01 06:07:53,434 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-04-01 06:07:53,435 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-04-01 06:07:53,435 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-04-01 06:07:53,437 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-04-01 06:07:53,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.04 06:07:53" (1/3) ... [2023-04-01 06:07:53,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd46d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:07:53, skipping insertion in model container [2023-04-01 06:07:53,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.04 06:07:53" (2/3) ... [2023-04-01 06:07:53,438 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3fd46d00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.04 06:07:53, skipping insertion in model container [2023-04-01 06:07:53,438 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.04 06:07:53" (3/3) ... [2023-04-01 06:07:53,439 INFO L112 eAbstractionObserver]: Analyzing ICFG sum_20x0-2.c [2023-04-01 06:07:53,453 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-04-01 06:07:53,453 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-04-01 06:07:53,507 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-04-01 06:07:53,512 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@56cdde85, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-04-01 06:07:53,513 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-04-01 06:07:53,516 INFO L276 IsEmpty]: Start isEmpty. Operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2023-04-01 06:07:53,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2023-04-01 06:07:53,521 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:53,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:53,522 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:53,526 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:53,527 INFO L85 PathProgramCache]: Analyzing trace with hash -1820399619, now seen corresponding path program 1 times [2023-04-01 06:07:53,533 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:53,533 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1530035549] [2023-04-01 06:07:53,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:53,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:53,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:53,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-04-01 06:07:53,785 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:53,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1530035549] [2023-04-01 06:07:53,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1530035549] provided 1 perfect and 0 imperfect interpolant sequences [2023-04-01 06:07:53,786 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-04-01 06:07:53,786 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-04-01 06:07:53,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719625694] [2023-04-01 06:07:53,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-04-01 06:07:53,790 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-04-01 06:07:53,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:53,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-04-01 06:07:53,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-04-01 06:07:53,837 INFO L87 Difference]: Start difference. First operand has 20 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 06:07:53,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:53,881 INFO L93 Difference]: Finished difference Result 30 states and 33 transitions. [2023-04-01 06:07:53,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-04-01 06:07:53,883 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 13 [2023-04-01 06:07:53,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:53,888 INFO L225 Difference]: With dead ends: 30 [2023-04-01 06:07:53,888 INFO L226 Difference]: Without dead ends: 18 [2023-04-01 06:07:53,890 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-04-01 06:07:53,893 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 10 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:53,893 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 42 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:53,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2023-04-01 06:07:53,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2023-04-01 06:07:53,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2023-04-01 06:07:53,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2023-04-01 06:07:53,918 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 13 [2023-04-01 06:07:53,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:53,918 INFO L495 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2023-04-01 06:07:53,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-04-01 06:07:53,918 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2023-04-01 06:07:53,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-04-01 06:07:53,919 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:53,919 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:53,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-04-01 06:07:53,920 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:53,920 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:53,920 INFO L85 PathProgramCache]: Analyzing trace with hash 729741253, now seen corresponding path program 1 times [2023-04-01 06:07:53,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:53,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110306529] [2023-04-01 06:07:53,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:53,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:53,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:54,053 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 06:07:54,053 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:54,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [110306529] [2023-04-01 06:07:54,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [110306529] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:54,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [487831917] [2023-04-01 06:07:54,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:54,054 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:54,054 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:54,058 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:54,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-04-01 06:07:54,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:54,107 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 6 conjunts are in the unsatisfiable core [2023-04-01 06:07:54,110 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:54,178 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-04-01 06:07:54,178 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-04-01 06:07:54,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [487831917] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:54,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [100963179] [2023-04-01 06:07:54,422 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:54,423 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:54,425 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:07:54,427 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:54,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2023-04-01 06:07:54,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342771762] [2023-04-01 06:07:54,427 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:54,428 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-04-01 06:07:54,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:54,429 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-04-01 06:07:54,429 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-04-01 06:07:54,429 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:07:54,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:54,473 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2023-04-01 06:07:54,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-04-01 06:07:54,474 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) Word has length 19 [2023-04-01 06:07:54,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:54,474 INFO L225 Difference]: With dead ends: 25 [2023-04-01 06:07:54,474 INFO L226 Difference]: Without dead ends: 21 [2023-04-01 06:07:54,475 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2023-04-01 06:07:54,476 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 18 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:54,476 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 33 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:54,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2023-04-01 06:07:54,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2023-04-01 06:07:54,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2023-04-01 06:07:54,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2023-04-01 06:07:54,480 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 19 [2023-04-01 06:07:54,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:54,480 INFO L495 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2023-04-01 06:07:54,480 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 5 states have call successors, (6), 1 states have call predecessors, (6), 3 states have return successors, (5), 3 states have call predecessors, (5), 5 states have call successors, (5) [2023-04-01 06:07:54,480 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2023-04-01 06:07:54,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-04-01 06:07:54,481 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:54,481 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:54,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:54,689 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:54,689 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:54,689 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:54,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1939692803, now seen corresponding path program 2 times [2023-04-01 06:07:54,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:54,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563348876] [2023-04-01 06:07:54,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:54,690 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:54,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:54,788 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:07:54,788 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563348876] [2023-04-01 06:07:54,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563348876] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:54,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2023725976] [2023-04-01 06:07:54,789 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:07:54,789 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:54,789 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:54,790 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:54,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-04-01 06:07:54,841 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-04-01 06:07:54,841 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:54,842 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 8 conjunts are in the unsatisfiable core [2023-04-01 06:07:54,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:54,873 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2023-04-01 06:07:54,874 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:55,121 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-04-01 06:07:55,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2023725976] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:55,121 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [174134577] [2023-04-01 06:07:55,123 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:55,123 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:55,123 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:07:55,123 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:55,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 9] total 11 [2023-04-01 06:07:55,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1976777081] [2023-04-01 06:07:55,124 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:55,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-04-01 06:07:55,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:55,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-04-01 06:07:55,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-04-01 06:07:55,125 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 06:07:55,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:55,185 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2023-04-01 06:07:55,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-04-01 06:07:55,186 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) Word has length 25 [2023-04-01 06:07:55,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:55,187 INFO L225 Difference]: With dead ends: 28 [2023-04-01 06:07:55,187 INFO L226 Difference]: Without dead ends: 24 [2023-04-01 06:07:55,187 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2023-04-01 06:07:55,188 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 19 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:55,188 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 59 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:55,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2023-04-01 06:07:55,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2023-04-01 06:07:55,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 5 states have call predecessors, (6), 3 states have call successors, (6) [2023-04-01 06:07:55,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2023-04-01 06:07:55,192 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 25 [2023-04-01 06:07:55,192 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:55,192 INFO L495 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2023-04-01 06:07:55,192 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 11 states have internal predecessors, (20), 6 states have call successors, (7), 1 states have call predecessors, (7), 4 states have return successors, (7), 4 states have call predecessors, (7), 6 states have call successors, (7) [2023-04-01 06:07:55,192 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2023-04-01 06:07:55,193 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-04-01 06:07:55,193 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:55,193 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:55,200 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:55,398 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2023-04-01 06:07:55,398 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:55,399 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:55,399 INFO L85 PathProgramCache]: Analyzing trace with hash 1644674245, now seen corresponding path program 3 times [2023-04-01 06:07:55,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:55,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [165651288] [2023-04-01 06:07:55,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:55,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:55,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:55,532 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:55,532 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [165651288] [2023-04-01 06:07:55,532 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [165651288] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:55,532 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1001573320] [2023-04-01 06:07:55,532 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:07:55,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:55,533 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:55,534 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:55,536 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-04-01 06:07:55,573 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:07:55,573 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:55,574 INFO L262 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 10 conjunts are in the unsatisfiable core [2023-04-01 06:07:55,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:55,605 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:55,605 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:55,979 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-04-01 06:07:55,980 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1001573320] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:55,980 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1767170630] [2023-04-01 06:07:55,981 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:55,981 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:55,982 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:07:55,982 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:55,982 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 11] total 13 [2023-04-01 06:07:55,982 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312637323] [2023-04-01 06:07:55,982 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:55,983 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-04-01 06:07:55,983 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:55,983 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-04-01 06:07:55,983 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-04-01 06:07:55,984 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 06:07:56,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:56,038 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2023-04-01 06:07:56,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-04-01 06:07:56,052 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) Word has length 31 [2023-04-01 06:07:56,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:56,053 INFO L225 Difference]: With dead ends: 31 [2023-04-01 06:07:56,053 INFO L226 Difference]: Without dead ends: 27 [2023-04-01 06:07:56,054 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2023-04-01 06:07:56,054 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:56,055 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 61 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:56,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2023-04-01 06:07:56,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2023-04-01 06:07:56,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 16 states have (on average 1.0625) internal successors, (17), 17 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 6 states have return successors, (7), 6 states have call predecessors, (7), 3 states have call successors, (7) [2023-04-01 06:07:56,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 28 transitions. [2023-04-01 06:07:56,063 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 28 transitions. Word has length 31 [2023-04-01 06:07:56,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:56,064 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 28 transitions. [2023-04-01 06:07:56,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 13 states have internal predecessors, (24), 7 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (9), 5 states have call predecessors, (9), 7 states have call successors, (9) [2023-04-01 06:07:56,064 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 28 transitions. [2023-04-01 06:07:56,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2023-04-01 06:07:56,065 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:56,065 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:56,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:56,271 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:56,271 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:56,275 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:56,275 INFO L85 PathProgramCache]: Analyzing trace with hash 577379837, now seen corresponding path program 4 times [2023-04-01 06:07:56,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:56,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1434832125] [2023-04-01 06:07:56,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:56,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:56,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:56,371 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 06:07:56,372 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1434832125] [2023-04-01 06:07:56,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1434832125] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:56,372 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1343669946] [2023-04-01 06:07:56,372 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:07:56,372 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:56,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:56,373 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:56,410 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-04-01 06:07:56,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:56,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 12 conjunts are in the unsatisfiable core [2023-04-01 06:07:56,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:56,474 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2023-04-01 06:07:56,474 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:57,025 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-04-01 06:07:57,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1343669946] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:57,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [32608376] [2023-04-01 06:07:57,028 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:57,028 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:57,029 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:07:57,029 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:57,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 13] total 15 [2023-04-01 06:07:57,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [501041266] [2023-04-01 06:07:57,029 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:57,030 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-04-01 06:07:57,030 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-04-01 06:07:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2023-04-01 06:07:57,032 INFO L87 Difference]: Start difference. First operand 27 states and 28 transitions. Second operand has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 06:07:57,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:57,094 INFO L93 Difference]: Finished difference Result 34 states and 35 transitions. [2023-04-01 06:07:57,094 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-04-01 06:07:57,095 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) Word has length 37 [2023-04-01 06:07:57,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:57,098 INFO L225 Difference]: With dead ends: 34 [2023-04-01 06:07:57,098 INFO L226 Difference]: Without dead ends: 30 [2023-04-01 06:07:57,098 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 68 SyntacticMatches, 5 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=257, Unknown=0, NotChecked=0, Total=380 [2023-04-01 06:07:57,099 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:57,100 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 69 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:57,101 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2023-04-01 06:07:57,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2023-04-01 06:07:57,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 18 states have (on average 1.0555555555555556) internal successors, (19), 19 states have internal predecessors, (19), 4 states have call successors, (4), 3 states have call predecessors, (4), 7 states have return successors, (8), 7 states have call predecessors, (8), 3 states have call successors, (8) [2023-04-01 06:07:57,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2023-04-01 06:07:57,112 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 37 [2023-04-01 06:07:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:57,113 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2023-04-01 06:07:57,113 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 13 states have (on average 2.1538461538461537) internal successors, (28), 15 states have internal predecessors, (28), 8 states have call successors, (9), 1 states have call predecessors, (9), 6 states have return successors, (11), 6 states have call predecessors, (11), 8 states have call successors, (11) [2023-04-01 06:07:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2023-04-01 06:07:57,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2023-04-01 06:07:57,114 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:57,115 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:57,121 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:57,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:57,320 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:57,320 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:57,320 INFO L85 PathProgramCache]: Analyzing trace with hash -1622883899, now seen corresponding path program 5 times [2023-04-01 06:07:57,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:57,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052314371] [2023-04-01 06:07:57,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:57,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:57,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:57,456 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 06:07:57,457 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:57,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1052314371] [2023-04-01 06:07:57,457 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1052314371] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:57,457 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1490820002] [2023-04-01 06:07:57,457 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:07:57,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:57,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:57,458 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:57,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-04-01 06:07:57,508 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-04-01 06:07:57,508 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:57,509 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 14 conjunts are in the unsatisfiable core [2023-04-01 06:07:57,510 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:57,542 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 40 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2023-04-01 06:07:57,542 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:07:58,406 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-04-01 06:07:58,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1490820002] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:07:58,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [218111357] [2023-04-01 06:07:58,408 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:07:58,408 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:07:58,408 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:07:58,408 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:07:58,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 15] total 17 [2023-04-01 06:07:58,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [559781954] [2023-04-01 06:07:58,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:07:58,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2023-04-01 06:07:58,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:07:58,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2023-04-01 06:07:58,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=198, Unknown=0, NotChecked=0, Total=272 [2023-04-01 06:07:58,410 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 06:07:58,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:07:58,481 INFO L93 Difference]: Finished difference Result 37 states and 38 transitions. [2023-04-01 06:07:58,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-04-01 06:07:58,482 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) Word has length 43 [2023-04-01 06:07:58,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:07:58,483 INFO L225 Difference]: With dead ends: 37 [2023-04-01 06:07:58,483 INFO L226 Difference]: Without dead ends: 33 [2023-04-01 06:07:58,483 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 79 SyntacticMatches, 6 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=164, Invalid=342, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:07:58,483 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:07:58,484 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 83 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:07:58,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2023-04-01 06:07:58,486 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2023-04-01 06:07:58,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 20 states have (on average 1.05) internal successors, (21), 21 states have internal predecessors, (21), 4 states have call successors, (4), 3 states have call predecessors, (4), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) [2023-04-01 06:07:58,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2023-04-01 06:07:58,487 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 43 [2023-04-01 06:07:58,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:07:58,487 INFO L495 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2023-04-01 06:07:58,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 15 states have (on average 2.1333333333333333) internal successors, (32), 17 states have internal predecessors, (32), 9 states have call successors, (10), 1 states have call predecessors, (10), 7 states have return successors, (13), 7 states have call predecessors, (13), 9 states have call successors, (13) [2023-04-01 06:07:58,487 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2023-04-01 06:07:58,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2023-04-01 06:07:58,488 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:07:58,488 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:07:58,498 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-04-01 06:07:58,692 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:58,693 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:07:58,693 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:07:58,693 INFO L85 PathProgramCache]: Analyzing trace with hash 298146045, now seen corresponding path program 6 times [2023-04-01 06:07:58,693 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:07:58,693 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457133179] [2023-04-01 06:07:58,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:07:58,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:07:58,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:07:58,803 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 06:07:58,803 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:07:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [457133179] [2023-04-01 06:07:58,803 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [457133179] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:07:58,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [977302719] [2023-04-01 06:07:58,803 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:07:58,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:07:58,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:07:58,818 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:07:58,819 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-04-01 06:07:58,884 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:07:58,884 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:07:58,885 INFO L262 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 16 conjunts are in the unsatisfiable core [2023-04-01 06:07:58,886 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:07:58,923 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 57 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2023-04-01 06:07:58,923 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:00,056 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 93 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-04-01 06:08:00,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [977302719] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:00,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [377854171] [2023-04-01 06:08:00,058 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:00,058 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:00,058 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:00,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:00,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 17] total 19 [2023-04-01 06:08:00,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897634827] [2023-04-01 06:08:00,059 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:00,059 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-04-01 06:08:00,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:00,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-04-01 06:08:00,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2023-04-01 06:08:00,060 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 06:08:00,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:00,144 INFO L93 Difference]: Finished difference Result 40 states and 41 transitions. [2023-04-01 06:08:00,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-04-01 06:08:00,145 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) Word has length 49 [2023-04-01 06:08:00,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:00,145 INFO L225 Difference]: With dead ends: 40 [2023-04-01 06:08:00,145 INFO L226 Difference]: Without dead ends: 36 [2023-04-01 06:08:00,146 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 90 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=211, Invalid=439, Unknown=0, NotChecked=0, Total=650 [2023-04-01 06:08:00,146 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 34 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:00,147 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 73 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:08:00,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2023-04-01 06:08:00,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2023-04-01 06:08:00,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 4 states have call successors, (4), 3 states have call predecessors, (4), 9 states have return successors, (10), 9 states have call predecessors, (10), 3 states have call successors, (10) [2023-04-01 06:08:00,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 37 transitions. [2023-04-01 06:08:00,150 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 37 transitions. Word has length 49 [2023-04-01 06:08:00,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:00,150 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 37 transitions. [2023-04-01 06:08:00,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 17 states have (on average 2.1176470588235294) internal successors, (36), 19 states have internal predecessors, (36), 10 states have call successors, (11), 1 states have call predecessors, (11), 8 states have return successors, (15), 8 states have call predecessors, (15), 10 states have call successors, (15) [2023-04-01 06:08:00,150 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 37 transitions. [2023-04-01 06:08:00,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2023-04-01 06:08:00,151 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:00,151 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:00,156 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:00,356 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:00,357 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:00,357 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:00,357 INFO L85 PathProgramCache]: Analyzing trace with hash -788134203, now seen corresponding path program 7 times [2023-04-01 06:08:00,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:00,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1034617711] [2023-04-01 06:08:00,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:00,357 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:00,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:00,514 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 06:08:00,514 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:00,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1034617711] [2023-04-01 06:08:00,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1034617711] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:00,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1166483259] [2023-04-01 06:08:00,515 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:00,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:00,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:00,516 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:00,548 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-04-01 06:08:00,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:00,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 18 conjunts are in the unsatisfiable core [2023-04-01 06:08:00,607 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:00,652 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2023-04-01 06:08:00,653 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:02,124 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2023-04-01 06:08:02,124 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1166483259] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:02,124 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1248951635] [2023-04-01 06:08:02,125 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:02,126 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:02,126 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:02,126 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:02,126 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 19] total 21 [2023-04-01 06:08:02,126 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1273344383] [2023-04-01 06:08:02,126 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:02,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-04-01 06:08:02,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:02,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-04-01 06:08:02,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=308, Unknown=0, NotChecked=0, Total=420 [2023-04-01 06:08:02,127 INFO L87 Difference]: Start difference. First operand 36 states and 37 transitions. Second operand has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 06:08:02,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:02,213 INFO L93 Difference]: Finished difference Result 43 states and 44 transitions. [2023-04-01 06:08:02,213 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-04-01 06:08:02,213 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) Word has length 55 [2023-04-01 06:08:02,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:02,214 INFO L225 Difference]: With dead ends: 43 [2023-04-01 06:08:02,214 INFO L226 Difference]: Without dead ends: 39 [2023-04-01 06:08:02,214 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 8 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=264, Invalid=548, Unknown=0, NotChecked=0, Total=812 [2023-04-01 06:08:02,215 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 52 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 84 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:02,215 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 87 Invalid, 84 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-04-01 06:08:02,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2023-04-01 06:08:02,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2023-04-01 06:08:02,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 24 states have (on average 1.0416666666666667) internal successors, (25), 25 states have internal predecessors, (25), 4 states have call successors, (4), 3 states have call predecessors, (4), 10 states have return successors, (11), 10 states have call predecessors, (11), 3 states have call successors, (11) [2023-04-01 06:08:02,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 40 transitions. [2023-04-01 06:08:02,218 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 40 transitions. Word has length 55 [2023-04-01 06:08:02,218 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:02,218 INFO L495 AbstractCegarLoop]: Abstraction has 39 states and 40 transitions. [2023-04-01 06:08:02,218 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.1052631578947367) internal successors, (40), 21 states have internal predecessors, (40), 11 states have call successors, (12), 1 states have call predecessors, (12), 9 states have return successors, (17), 9 states have call predecessors, (17), 11 states have call successors, (17) [2023-04-01 06:08:02,218 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 40 transitions. [2023-04-01 06:08:02,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2023-04-01 06:08:02,219 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:02,219 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:02,226 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-04-01 06:08:02,424 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:02,424 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:02,425 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:02,425 INFO L85 PathProgramCache]: Analyzing trace with hash 849630205, now seen corresponding path program 8 times [2023-04-01 06:08:02,425 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:02,425 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719295993] [2023-04-01 06:08:02,425 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:02,425 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:02,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:02,568 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 06:08:02,569 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719295993] [2023-04-01 06:08:02,569 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719295993] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:02,569 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176080075] [2023-04-01 06:08:02,569 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:08:02,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:02,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:02,570 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:02,572 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-04-01 06:08:02,670 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2023-04-01 06:08:02,671 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:02,671 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 20 conjunts are in the unsatisfiable core [2023-04-01 06:08:02,673 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:02,726 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 100 trivial. 0 not checked. [2023-04-01 06:08:02,726 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:04,761 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 164 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2023-04-01 06:08:04,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176080075] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:04,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1843985849] [2023-04-01 06:08:04,763 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:04,763 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:04,763 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:04,763 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:04,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 21] total 23 [2023-04-01 06:08:04,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [376965918] [2023-04-01 06:08:04,764 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:04,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-04-01 06:08:04,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:04,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-04-01 06:08:04,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=372, Unknown=0, NotChecked=0, Total=506 [2023-04-01 06:08:04,765 INFO L87 Difference]: Start difference. First operand 39 states and 40 transitions. Second operand has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 06:08:04,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:04,884 INFO L93 Difference]: Finished difference Result 46 states and 47 transitions. [2023-04-01 06:08:04,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-04-01 06:08:04,884 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) Word has length 61 [2023-04-01 06:08:04,886 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:04,886 INFO L225 Difference]: With dead ends: 46 [2023-04-01 06:08:04,886 INFO L226 Difference]: Without dead ends: 42 [2023-04-01 06:08:04,887 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 112 SyntacticMatches, 9 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 234 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=323, Invalid=669, Unknown=0, NotChecked=0, Total=992 [2023-04-01 06:08:04,887 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 61 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:04,887 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 119 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:04,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2023-04-01 06:08:04,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2023-04-01 06:08:04,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 26 states have (on average 1.0384615384615385) internal successors, (27), 27 states have internal predecessors, (27), 4 states have call successors, (4), 3 states have call predecessors, (4), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2023-04-01 06:08:04,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 43 transitions. [2023-04-01 06:08:04,890 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 43 transitions. Word has length 61 [2023-04-01 06:08:04,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:04,890 INFO L495 AbstractCegarLoop]: Abstraction has 42 states and 43 transitions. [2023-04-01 06:08:04,891 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 23 states have internal predecessors, (44), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 12 states have call successors, (19) [2023-04-01 06:08:04,891 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 43 transitions. [2023-04-01 06:08:04,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2023-04-01 06:08:04,891 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:04,891 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:04,898 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:05,096 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2023-04-01 06:08:05,096 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:05,097 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:05,097 INFO L85 PathProgramCache]: Analyzing trace with hash 1226542021, now seen corresponding path program 9 times [2023-04-01 06:08:05,097 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:05,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [25081205] [2023-04-01 06:08:05,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:05,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:05,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:05,293 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-04-01 06:08:05,293 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:05,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [25081205] [2023-04-01 06:08:05,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [25081205] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:05,294 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [134867296] [2023-04-01 06:08:05,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:08:05,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:05,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:05,310 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:05,312 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-04-01 06:08:05,443 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:08:05,443 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:05,444 INFO L262 TraceCheckSpWp]: Trace formula consists of 226 conjuncts, 22 conjunts are in the unsatisfiable core [2023-04-01 06:08:05,445 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:05,487 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2023-04-01 06:08:05,488 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:08,215 INFO L134 CoverageAnalysis]: Checked inductivity of 252 backedges. 0 proven. 207 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2023-04-01 06:08:08,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [134867296] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:08,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [90551814] [2023-04-01 06:08:08,217 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:08,217 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:08,217 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:08,218 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:08,218 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 23] total 25 [2023-04-01 06:08:08,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117782122] [2023-04-01 06:08:08,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:08,218 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-04-01 06:08:08,218 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:08,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-04-01 06:08:08,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=442, Unknown=0, NotChecked=0, Total=600 [2023-04-01 06:08:08,219 INFO L87 Difference]: Start difference. First operand 42 states and 43 transitions. Second operand has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2023-04-01 06:08:08,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:08,359 INFO L93 Difference]: Finished difference Result 49 states and 50 transitions. [2023-04-01 06:08:08,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-04-01 06:08:08,360 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) Word has length 67 [2023-04-01 06:08:08,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:08,360 INFO L225 Difference]: With dead ends: 49 [2023-04-01 06:08:08,360 INFO L226 Difference]: Without dead ends: 45 [2023-04-01 06:08:08,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 123 SyntacticMatches, 10 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=388, Invalid=802, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 06:08:08,361 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 69 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:08,362 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 115 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:08,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2023-04-01 06:08:08,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2023-04-01 06:08:08,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 28 states have (on average 1.0357142857142858) internal successors, (29), 29 states have internal predecessors, (29), 4 states have call successors, (4), 3 states have call predecessors, (4), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2023-04-01 06:08:08,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 46 transitions. [2023-04-01 06:08:08,366 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 46 transitions. Word has length 67 [2023-04-01 06:08:08,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:08,366 INFO L495 AbstractCegarLoop]: Abstraction has 45 states and 46 transitions. [2023-04-01 06:08:08,366 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 2.0869565217391304) internal successors, (48), 25 states have internal predecessors, (48), 13 states have call successors, (14), 1 states have call predecessors, (14), 11 states have return successors, (21), 11 states have call predecessors, (21), 13 states have call successors, (21) [2023-04-01 06:08:08,366 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 46 transitions. [2023-04-01 06:08:08,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2023-04-01 06:08:08,367 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:08,367 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:08,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:08,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2023-04-01 06:08:08,573 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:08,573 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:08,573 INFO L85 PathProgramCache]: Analyzing trace with hash 2033651453, now seen corresponding path program 10 times [2023-04-01 06:08:08,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:08,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1517754915] [2023-04-01 06:08:08,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:08,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:08,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:08,759 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-04-01 06:08:08,760 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1517754915] [2023-04-01 06:08:08,760 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1517754915] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:08,760 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [964040841] [2023-04-01 06:08:08,760 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:08,760 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:08,760 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:08,766 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:08,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-04-01 06:08:08,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:08,947 INFO L262 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 24 conjunts are in the unsatisfiable core [2023-04-01 06:08:08,951 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:09,006 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2023-04-01 06:08:09,006 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:12,481 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2023-04-01 06:08:12,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [964040841] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:12,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1590261891] [2023-04-01 06:08:12,483 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:12,483 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:12,483 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:12,484 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:12,484 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 25] total 27 [2023-04-01 06:08:12,484 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072937146] [2023-04-01 06:08:12,484 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:12,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2023-04-01 06:08:12,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:12,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2023-04-01 06:08:12,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=518, Unknown=0, NotChecked=0, Total=702 [2023-04-01 06:08:12,485 INFO L87 Difference]: Start difference. First operand 45 states and 46 transitions. Second operand has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) [2023-04-01 06:08:12,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:12,621 INFO L93 Difference]: Finished difference Result 52 states and 53 transitions. [2023-04-01 06:08:12,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-04-01 06:08:12,622 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) Word has length 73 [2023-04-01 06:08:12,622 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:12,623 INFO L225 Difference]: With dead ends: 52 [2023-04-01 06:08:12,623 INFO L226 Difference]: Without dead ends: 48 [2023-04-01 06:08:12,624 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 134 SyntacticMatches, 11 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 352 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=459, Invalid=947, Unknown=0, NotChecked=0, Total=1406 [2023-04-01 06:08:12,624 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 30 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:12,624 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 141 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:12,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2023-04-01 06:08:12,636 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 48. [2023-04-01 06:08:12,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 30 states have (on average 1.0333333333333334) internal successors, (31), 31 states have internal predecessors, (31), 4 states have call successors, (4), 3 states have call predecessors, (4), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2023-04-01 06:08:12,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 49 transitions. [2023-04-01 06:08:12,637 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 49 transitions. Word has length 73 [2023-04-01 06:08:12,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:12,638 INFO L495 AbstractCegarLoop]: Abstraction has 48 states and 49 transitions. [2023-04-01 06:08:12,638 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 2.08) internal successors, (52), 27 states have internal predecessors, (52), 14 states have call successors, (15), 1 states have call predecessors, (15), 12 states have return successors, (23), 12 states have call predecessors, (23), 14 states have call successors, (23) [2023-04-01 06:08:12,638 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 49 transitions. [2023-04-01 06:08:12,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2023-04-01 06:08:12,640 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:12,640 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:12,646 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:12,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-04-01 06:08:12,846 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:12,846 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:12,846 INFO L85 PathProgramCache]: Analyzing trace with hash -1118482235, now seen corresponding path program 11 times [2023-04-01 06:08:12,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:12,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828561227] [2023-04-01 06:08:12,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:12,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:12,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:13,060 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-04-01 06:08:13,060 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828561227] [2023-04-01 06:08:13,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828561227] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:13,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1034960047] [2023-04-01 06:08:13,060 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:08:13,061 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:13,061 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:13,062 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:13,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-04-01 06:08:13,326 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2023-04-01 06:08:13,327 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:13,328 INFO L262 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 26 conjunts are in the unsatisfiable core [2023-04-01 06:08:13,329 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:13,381 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2023-04-01 06:08:13,381 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:17,763 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2023-04-01 06:08:17,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1034960047] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:17,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1582671743] [2023-04-01 06:08:17,765 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:17,765 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:17,765 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:17,765 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:17,765 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 27] total 29 [2023-04-01 06:08:17,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854238025] [2023-04-01 06:08:17,766 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:17,766 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-04-01 06:08:17,766 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:17,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-04-01 06:08:17,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=212, Invalid=600, Unknown=0, NotChecked=0, Total=812 [2023-04-01 06:08:17,767 INFO L87 Difference]: Start difference. First operand 48 states and 49 transitions. Second operand has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2023-04-01 06:08:17,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:17,947 INFO L93 Difference]: Finished difference Result 55 states and 56 transitions. [2023-04-01 06:08:17,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-04-01 06:08:17,948 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) Word has length 79 [2023-04-01 06:08:17,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:17,948 INFO L225 Difference]: With dead ends: 55 [2023-04-01 06:08:17,948 INFO L226 Difference]: Without dead ends: 51 [2023-04-01 06:08:17,950 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 196 GetRequests, 145 SyntacticMatches, 12 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 420 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=536, Invalid=1104, Unknown=0, NotChecked=0, Total=1640 [2023-04-01 06:08:17,950 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 124 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:17,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 113 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:17,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2023-04-01 06:08:17,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 51. [2023-04-01 06:08:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 32 states have (on average 1.03125) internal successors, (33), 33 states have internal predecessors, (33), 4 states have call successors, (4), 3 states have call predecessors, (4), 14 states have return successors, (15), 14 states have call predecessors, (15), 3 states have call successors, (15) [2023-04-01 06:08:17,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 52 transitions. [2023-04-01 06:08:17,953 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 52 transitions. Word has length 79 [2023-04-01 06:08:17,953 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:17,954 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 52 transitions. [2023-04-01 06:08:17,954 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 27 states have (on average 2.074074074074074) internal successors, (56), 29 states have internal predecessors, (56), 15 states have call successors, (16), 1 states have call predecessors, (16), 13 states have return successors, (25), 13 states have call predecessors, (25), 15 states have call successors, (25) [2023-04-01 06:08:17,954 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 52 transitions. [2023-04-01 06:08:17,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2023-04-01 06:08:17,954 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:17,954 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:17,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:18,161 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-04-01 06:08:18,161 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:18,161 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:18,161 INFO L85 PathProgramCache]: Analyzing trace with hash -173176323, now seen corresponding path program 12 times [2023-04-01 06:08:18,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:18,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [207381091] [2023-04-01 06:08:18,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:18,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:18,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:18,393 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-04-01 06:08:18,393 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:18,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [207381091] [2023-04-01 06:08:18,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [207381091] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:18,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1400446302] [2023-04-01 06:08:18,394 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:08:18,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:18,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:18,395 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:18,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-04-01 06:08:18,692 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:08:18,693 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:18,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 28 conjunts are in the unsatisfiable core [2023-04-01 06:08:18,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:18,771 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2023-04-01 06:08:18,771 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:24,288 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2023-04-01 06:08:24,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1400446302] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:24,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [146581094] [2023-04-01 06:08:24,290 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:24,290 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:24,290 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:24,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:24,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2023-04-01 06:08:24,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273913050] [2023-04-01 06:08:24,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:24,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-04-01 06:08:24,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:24,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-04-01 06:08:24,296 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2023-04-01 06:08:24,296 INFO L87 Difference]: Start difference. First operand 51 states and 52 transitions. Second operand has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) [2023-04-01 06:08:24,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:24,469 INFO L93 Difference]: Finished difference Result 58 states and 59 transitions. [2023-04-01 06:08:24,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-04-01 06:08:24,470 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) Word has length 85 [2023-04-01 06:08:24,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:24,470 INFO L225 Difference]: With dead ends: 58 [2023-04-01 06:08:24,470 INFO L226 Difference]: Without dead ends: 54 [2023-04-01 06:08:24,471 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 211 GetRequests, 156 SyntacticMatches, 13 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=619, Invalid=1273, Unknown=0, NotChecked=0, Total=1892 [2023-04-01 06:08:24,471 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 45 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:24,471 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 133 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:24,472 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2023-04-01 06:08:24,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2023-04-01 06:08:24,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 34 states have (on average 1.0294117647058822) internal successors, (35), 35 states have internal predecessors, (35), 4 states have call successors, (4), 3 states have call predecessors, (4), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2023-04-01 06:08:24,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 55 transitions. [2023-04-01 06:08:24,475 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 55 transitions. Word has length 85 [2023-04-01 06:08:24,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:24,475 INFO L495 AbstractCegarLoop]: Abstraction has 54 states and 55 transitions. [2023-04-01 06:08:24,475 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 16 states have call successors, (17), 1 states have call predecessors, (17), 14 states have return successors, (27), 14 states have call predecessors, (27), 16 states have call successors, (27) [2023-04-01 06:08:24,475 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 55 transitions. [2023-04-01 06:08:24,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2023-04-01 06:08:24,476 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:24,476 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:24,483 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-04-01 06:08:24,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-04-01 06:08:24,681 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:24,681 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:24,681 INFO L85 PathProgramCache]: Analyzing trace with hash 1199789509, now seen corresponding path program 13 times [2023-04-01 06:08:24,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:24,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1706114297] [2023-04-01 06:08:24,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:24,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:24,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:24,910 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-04-01 06:08:24,910 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:24,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1706114297] [2023-04-01 06:08:24,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1706114297] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:24,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [566521850] [2023-04-01 06:08:24,911 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:24,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:24,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:24,912 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:24,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-04-01 06:08:25,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:25,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 298 conjuncts, 30 conjunts are in the unsatisfiable core [2023-04-01 06:08:25,277 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:25,371 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2023-04-01 06:08:25,371 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:32,139 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2023-04-01 06:08:32,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [566521850] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:32,139 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [152616256] [2023-04-01 06:08:32,147 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:32,147 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:32,147 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:32,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:32,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 31] total 33 [2023-04-01 06:08:32,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [958425811] [2023-04-01 06:08:32,148 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:32,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-04-01 06:08:32,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:32,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-04-01 06:08:32,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=782, Unknown=0, NotChecked=0, Total=1056 [2023-04-01 06:08:32,156 INFO L87 Difference]: Start difference. First operand 54 states and 55 transitions. Second operand has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) [2023-04-01 06:08:32,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:32,383 INFO L93 Difference]: Finished difference Result 61 states and 62 transitions. [2023-04-01 06:08:32,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-04-01 06:08:32,384 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) Word has length 91 [2023-04-01 06:08:32,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:32,384 INFO L225 Difference]: With dead ends: 61 [2023-04-01 06:08:32,384 INFO L226 Difference]: Without dead ends: 57 [2023-04-01 06:08:32,385 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 226 GetRequests, 167 SyntacticMatches, 14 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=708, Invalid=1454, Unknown=0, NotChecked=0, Total=2162 [2023-04-01 06:08:32,386 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 179 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:32,386 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [195 Valid, 153 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:32,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-04-01 06:08:32,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-04-01 06:08:32,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 36 states have (on average 1.0277777777777777) internal successors, (37), 37 states have internal predecessors, (37), 4 states have call successors, (4), 3 states have call predecessors, (4), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2023-04-01 06:08:32,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 58 transitions. [2023-04-01 06:08:32,388 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 58 transitions. Word has length 91 [2023-04-01 06:08:32,389 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:32,389 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 58 transitions. [2023-04-01 06:08:32,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 2.064516129032258) internal successors, (64), 33 states have internal predecessors, (64), 17 states have call successors, (18), 1 states have call predecessors, (18), 15 states have return successors, (29), 15 states have call predecessors, (29), 17 states have call successors, (29) [2023-04-01 06:08:32,389 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 58 transitions. [2023-04-01 06:08:32,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2023-04-01 06:08:32,389 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:32,389 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:32,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:32,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-04-01 06:08:32,599 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:32,599 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:32,599 INFO L85 PathProgramCache]: Analyzing trace with hash -734542595, now seen corresponding path program 14 times [2023-04-01 06:08:32,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:32,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209710953] [2023-04-01 06:08:32,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:32,600 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:32,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:32,873 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-04-01 06:08:32,873 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:32,873 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209710953] [2023-04-01 06:08:32,873 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1209710953] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:32,874 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1157587786] [2023-04-01 06:08:32,874 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-04-01 06:08:32,874 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:32,874 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:32,875 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:32,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-04-01 06:08:33,371 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2023-04-01 06:08:33,371 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:33,372 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 32 conjunts are in the unsatisfiable core [2023-04-01 06:08:33,374 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:33,460 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2023-04-01 06:08:33,460 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:41,807 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2023-04-01 06:08:41,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1157587786] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:41,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1971720966] [2023-04-01 06:08:41,808 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:41,808 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:41,809 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:41,809 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:41,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 33] total 35 [2023-04-01 06:08:41,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1235683239] [2023-04-01 06:08:41,809 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:41,810 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-04-01 06:08:41,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-04-01 06:08:41,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=308, Invalid=882, Unknown=0, NotChecked=0, Total=1190 [2023-04-01 06:08:41,811 INFO L87 Difference]: Start difference. First operand 57 states and 58 transitions. Second operand has 35 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 16 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-01 06:08:42,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:42,049 INFO L93 Difference]: Finished difference Result 64 states and 65 transitions. [2023-04-01 06:08:42,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-04-01 06:08:42,049 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 16 states have call predecessors, (31), 18 states have call successors, (31) Word has length 97 [2023-04-01 06:08:42,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:42,050 INFO L225 Difference]: With dead ends: 64 [2023-04-01 06:08:42,050 INFO L226 Difference]: Without dead ends: 60 [2023-04-01 06:08:42,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 178 SyntacticMatches, 15 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 660 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=803, Invalid=1647, Unknown=0, NotChecked=0, Total=2450 [2023-04-01 06:08:42,051 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 241 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 129 mSolverCounterSat, 116 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 116 IncrementalHoareTripleChecker+Valid, 129 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:42,051 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [258 Valid, 161 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [116 Valid, 129 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:42,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2023-04-01 06:08:42,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2023-04-01 06:08:42,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 38 states have (on average 1.0263157894736843) internal successors, (39), 39 states have internal predecessors, (39), 4 states have call successors, (4), 3 states have call predecessors, (4), 17 states have return successors, (18), 17 states have call predecessors, (18), 3 states have call successors, (18) [2023-04-01 06:08:42,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 61 transitions. [2023-04-01 06:08:42,055 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 61 transitions. Word has length 97 [2023-04-01 06:08:42,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:42,055 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 61 transitions. [2023-04-01 06:08:42,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0606060606060606) internal successors, (68), 35 states have internal predecessors, (68), 18 states have call successors, (19), 1 states have call predecessors, (19), 16 states have return successors, (31), 16 states have call predecessors, (31), 18 states have call successors, (31) [2023-04-01 06:08:42,056 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 61 transitions. [2023-04-01 06:08:42,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2023-04-01 06:08:42,056 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:42,057 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:42,065 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:42,265 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:42,265 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:42,265 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:42,265 INFO L85 PathProgramCache]: Analyzing trace with hash 1702206149, now seen corresponding path program 15 times [2023-04-01 06:08:42,265 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:42,266 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797986688] [2023-04-01 06:08:42,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:42,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:42,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:42,540 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-04-01 06:08:42,540 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797986688] [2023-04-01 06:08:42,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797986688] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:42,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [319242041] [2023-04-01 06:08:42,540 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-04-01 06:08:42,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:42,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:42,541 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:42,543 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2023-04-01 06:08:43,140 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-04-01 06:08:43,140 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-04-01 06:08:43,142 INFO L262 TraceCheckSpWp]: Trace formula consists of 334 conjuncts, 34 conjunts are in the unsatisfiable core [2023-04-01 06:08:43,163 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:43,250 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2023-04-01 06:08:43,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-04-01 06:08:53,291 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2023-04-01 06:08:53,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [319242041] provided 0 perfect and 2 imperfect interpolant sequences [2023-04-01 06:08:53,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSifa [1729209831] [2023-04-01 06:08:53,292 INFO L159 IcfgInterpreter]: Started Sifa with 16 locations of interest [2023-04-01 06:08:53,293 INFO L166 IcfgInterpreter]: Building call graph [2023-04-01 06:08:53,293 FATAL L? ?]: Ignoring exception! java.lang.IllegalArgumentException: Recursive programs are not supported. at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.topsortRelevant(CallGraph.java:132) at de.uni_freiburg.informatik.ultimate.lib.sifa.CallGraph.(CallGraph.java:97) at de.uni_freiburg.informatik.ultimate.lib.sifa.IcfgInterpreter.(IcfgInterpreter.java:92) at de.uni_freiburg.informatik.ultimate.plugins.sifa.SifaBuilder.construct(SifaBuilder.java:96) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.SifaRunner.(SifaRunner.java:98) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSifa.construct(IpTcStrategyModuleSifa.java:68) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:101) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:77) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:267) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:148) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:137) at de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:85) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:82) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:337) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:431) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:366) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:415) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:302) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:262) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:154) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:124) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2023-04-01 06:08:53,293 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-04-01 06:08:53,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 35] total 37 [2023-04-01 06:08:53,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1957342927] [2023-04-01 06:08:53,293 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-04-01 06:08:53,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-04-01 06:08:53,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy SIFA_TAIPAN [2023-04-01 06:08:53,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-04-01 06:08:53,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=344, Invalid=988, Unknown=0, NotChecked=0, Total=1332 [2023-04-01 06:08:53,295 INFO L87 Difference]: Start difference. First operand 60 states and 61 transitions. Second operand has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 37 states have internal predecessors, (72), 19 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33) [2023-04-01 06:08:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-04-01 06:08:53,523 INFO L93 Difference]: Finished difference Result 67 states and 68 transitions. [2023-04-01 06:08:53,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-04-01 06:08:53,523 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 37 states have internal predecessors, (72), 19 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33) Word has length 103 [2023-04-01 06:08:53,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-04-01 06:08:53,524 INFO L225 Difference]: With dead ends: 67 [2023-04-01 06:08:53,524 INFO L226 Difference]: Without dead ends: 63 [2023-04-01 06:08:53,525 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 189 SyntacticMatches, 16 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=904, Invalid=1852, Unknown=0, NotChecked=0, Total=2756 [2023-04-01 06:08:53,525 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 71 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-04-01 06:08:53,525 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 163 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-04-01 06:08:53,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2023-04-01 06:08:53,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2023-04-01 06:08:53,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 40 states have (on average 1.025) internal successors, (41), 41 states have internal predecessors, (41), 4 states have call successors, (4), 3 states have call predecessors, (4), 18 states have return successors, (19), 18 states have call predecessors, (19), 3 states have call successors, (19) [2023-04-01 06:08:53,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 64 transitions. [2023-04-01 06:08:53,528 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 64 transitions. Word has length 103 [2023-04-01 06:08:53,528 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-04-01 06:08:53,528 INFO L495 AbstractCegarLoop]: Abstraction has 63 states and 64 transitions. [2023-04-01 06:08:53,528 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 35 states have (on average 2.057142857142857) internal successors, (72), 37 states have internal predecessors, (72), 19 states have call successors, (20), 1 states have call predecessors, (20), 17 states have return successors, (33), 17 states have call predecessors, (33), 19 states have call successors, (33) [2023-04-01 06:08:53,528 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 64 transitions. [2023-04-01 06:08:53,532 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 110 [2023-04-01 06:08:53,532 INFO L187 NwaCegarLoop]: Found error trace [2023-04-01 06:08:53,532 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-04-01 06:08:53,541 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2023-04-01 06:08:53,746 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-04-01 06:08:53,746 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting mainErr0ASSERT_VIOLATIONERROR_FUNCTION === [mainErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-04-01 06:08:53,746 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-04-01 06:08:53,746 INFO L85 PathProgramCache]: Analyzing trace with hash 1560657917, now seen corresponding path program 16 times [2023-04-01 06:08:53,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy SIFA_TAIPAN [2023-04-01 06:08:53,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1249789017] [2023-04-01 06:08:53,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-04-01 06:08:53,747 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-04-01 06:08:53,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:54,068 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-04-01 06:08:54,069 INFO L136 FreeRefinementEngine]: Strategy SIFA_TAIPAN found an infeasible trace [2023-04-01 06:08:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1249789017] [2023-04-01 06:08:54,069 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1249789017] provided 0 perfect and 1 imperfect interpolant sequences [2023-04-01 06:08:54,069 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [443632638] [2023-04-01 06:08:54,069 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-04-01 06:08:54,070 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-04-01 06:08:54,070 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-04-01 06:08:54,071 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-04-01 06:08:54,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2023-04-01 06:08:54,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-04-01 06:08:54,817 INFO L262 TraceCheckSpWp]: Trace formula consists of 352 conjuncts, 36 conjunts are in the unsatisfiable core [2023-04-01 06:08:54,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-04-01 06:08:54,900 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 0 proven. 392 refuted. 0 times theorem prover too weak. 392 trivial. 0 not checked. [2023-04-01 06:08:54,900 INFO L327 TraceCheckSpWp]: Computing backward predicates...