./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit
--------------------------------------------------------------------------------
Checking for ERROR reachability
Using default analysis
Version 8be7027f
Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) )
--witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b
--- Real Ultimate output ---
This is Ultimate 0.2.5-wip.dk.perfect-tracechecks-8be7027-m
[2024-11-11 20:56:32,424 INFO L188 SettingsManager]: Resetting all preferences to default values...
[2024-11-11 20:56:32,495 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf
[2024-11-11 20:56:32,501 WARN L101 SettingsManager]: Preference file contains the following unknown settings:
[2024-11-11 20:56:32,503 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class
[2024-11-11 20:56:32,534 INFO L130 SettingsManager]: Preferences different from defaults after loading the file:
[2024-11-11 20:56:32,535 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults:
[2024-11-11 20:56:32,535 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR;
[2024-11-11 20:56:32,536 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults:
[2024-11-11 20:56:32,537 INFO L153 SettingsManager]: * Use memory slicer=true
[2024-11-11 20:56:32,538 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults:
[2024-11-11 20:56:32,538 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS
[2024-11-11 20:56:32,539 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults:
[2024-11-11 20:56:32,541 INFO L153 SettingsManager]: * Create parallel compositions if possible=false
[2024-11-11 20:56:32,541 INFO L153 SettingsManager]: * Use SBE=true
[2024-11-11 20:56:32,541 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults:
[2024-11-11 20:56:32,541 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE
[2024-11-11 20:56:32,542 INFO L153 SettingsManager]: * sizeof long=4
[2024-11-11 20:56:32,542 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true
[2024-11-11 20:56:32,542 INFO L153 SettingsManager]: * sizeof POINTER=4
[2024-11-11 20:56:32,542 INFO L153 SettingsManager]: * Check division by zero=IGNORE
[2024-11-11 20:56:32,543 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE
[2024-11-11 20:56:32,543 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE
[2024-11-11 20:56:32,544 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE
[2024-11-11 20:56:32,544 INFO L153 SettingsManager]: * Allow undefined functions=false
[2024-11-11 20:56:32,544 INFO L153 SettingsManager]: * sizeof long double=12
[2024-11-11 20:56:32,544 INFO L153 SettingsManager]: * Check if freed pointer was valid=false
[2024-11-11 20:56:32,545 INFO L153 SettingsManager]: * Use constant arrays=true
[2024-11-11 20:56:32,545 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults:
[2024-11-11 20:56:32,545 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements
[2024-11-11 20:56:32,546 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true
[2024-11-11 20:56:32,546 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode
[2024-11-11 20:56:32,546 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 20:56:32,547 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults:
[2024-11-11 20:56:32,547 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP
[2024-11-11 20:56:32,547 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads
[2024-11-11 20:56:32,548 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL
[2024-11-11 20:56:32,548 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in
[2024-11-11 20:56:32,548 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false
[2024-11-11 20:56:32,549 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET
[2024-11-11 20:56:32,549 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO
[2024-11-11 20:56:32,549 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode
[2024-11-11 20:56:32,550 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC
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.generator.cacsl2boogietranslator: Entry function -> main
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) )
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit
Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 93bcf8b6df587e0bc8cb137c6415932ffc9083999b1b09826c5b148989ca1a7b
[2024-11-11 20:56:32,795 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp
[2024-11-11 20:56:32,823 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized
[2024-11-11 20:56:32,826 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected.
[2024-11-11 20:56:32,828 INFO L270 PluginConnector]: Initializing CDTParser...
[2024-11-11 20:56:32,828 INFO L274 PluginConnector]: CDTParser initialized
[2024-11-11 20:56:32,829 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Ackermann01-2.c
[2024-11-11 20:56:34,290 INFO L533 CDTParser]: Created temporary CDT project at NULL
[2024-11-11 20:56:34,467 INFO L384 CDTParser]: Found 1 translation units.
[2024-11-11 20:56:34,468 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c
[2024-11-11 20:56:34,475 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a001180/98b294eb27e64add9195373474d6c9c1/FLAGa4da73110
[2024-11-11 20:56:34,487 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64a001180/98b294eb27e64add9195373474d6c9c1
[2024-11-11 20:56:34,490 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] #######################
[2024-11-11 20:56:34,493 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements.
[2024-11-11 20:56:34,496 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator----------------------------
[2024-11-11 20:56:34,496 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator...
[2024-11-11 20:56:34,501 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized
[2024-11-11 20:56:34,503 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,505 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@71cacc73 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34, skipping insertion in model container
[2024-11-11 20:56:34,505 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,527 INFO L175 MainTranslator]: Built tables and reachable declarations
[2024-11-11 20:56:34,702 WARN L250 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/Ackermann01-2.c[1234,1247]
[2024-11-11 20:56:34,707 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-11 20:56:34,719 INFO L200 MainTranslator]: Completed pre-run
[2024-11-11 20:56:34,738 WARN L250 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/Ackermann01-2.c[1234,1247]
[2024-11-11 20:56:34,739 INFO L210 PostProcessor]: Analyzing one entry point: main
[2024-11-11 20:56:34,762 INFO L204 MainTranslator]: Completed translation
[2024-11-11 20:56:34,763 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34 WrapperNode
[2024-11-11 20:56:34,763 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator----------------------------
[2024-11-11 20:56:34,764 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner----------------------------
[2024-11-11 20:56:34,765 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner...
[2024-11-11 20:56:34,765 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized
[2024-11-11 20:56:34,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,778 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,794 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33
[2024-11-11 20:56:34,795 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner----------------------------
[2024-11-11 20:56:34,796 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor----------------------------
[2024-11-11 20:56:34,796 INFO L270 PluginConnector]: Initializing Boogie Preprocessor...
[2024-11-11 20:56:34,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized
[2024-11-11 20:56:34,812 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,815 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,816 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,835 INFO L175 MemorySlicer]: Split 2 memory accesses to 1 slices as follows [2]. 100 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2]. The 0 writes are split as follows [0].
[2024-11-11 20:56:34,836 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,836 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,839 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,842 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,844 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,847 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor----------------------------
[2024-11-11 20:56:34,851 INFO L112 PluginConnector]: ------------------------RCFGBuilder----------------------------
[2024-11-11 20:56:34,851 INFO L270 PluginConnector]: Initializing RCFGBuilder...
[2024-11-11 20:56:34,851 INFO L274 PluginConnector]: RCFGBuilder initialized
[2024-11-11 20:56:34,852 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (1/1) ...
[2024-11-11 20:56:34,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000
[2024-11-11 20:56:34,872 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 20:56:34,888 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null)
[2024-11-11 20:56:34,895 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process
[2024-11-11 20:56:34,960 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit
[2024-11-11 20:56:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start
[2024-11-11 20:56:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start
[2024-11-11 20:56:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann
[2024-11-11 20:56:34,961 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann
[2024-11-11 20:56:34,961 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0
[2024-11-11 20:56:35,019 INFO L238 CfgBuilder]: Building ICFG
[2024-11-11 20:56:35,020 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation
[2024-11-11 20:56:35,125 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live.
[2024-11-11 20:56:35,126 INFO L287 CfgBuilder]: Performing block encoding
[2024-11-11 20:56:35,141 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start)
[2024-11-11 20:56:35,141 INFO L316 CfgBuilder]: Removed 0 assume(true) statements.
[2024-11-11 20:56:35,142 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:35 BoogieIcfgContainer
[2024-11-11 20:56:35,142 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder----------------------------
[2024-11-11 20:56:35,143 INFO L112 PluginConnector]: ------------------------TraceAbstraction----------------------------
[2024-11-11 20:56:35,143 INFO L270 PluginConnector]: Initializing TraceAbstraction...
[2024-11-11 20:56:35,146 INFO L274 PluginConnector]: TraceAbstraction initialized
[2024-11-11 20:56:35,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 08:56:34" (1/3) ...
[2024-11-11 20:56:35,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4257c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:56:35, skipping insertion in model container
[2024-11-11 20:56:35,147 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 08:56:34" (2/3) ...
[2024-11-11 20:56:35,147 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b4257c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 08:56:35, skipping insertion in model container
[2024-11-11 20:56:35,148 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:35" (3/3) ...
[2024-11-11 20:56:35,149 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c
[2024-11-11 20:56:35,164 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION
[2024-11-11 20:56:35,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations.
[2024-11-11 20:56:35,217 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ========
[2024-11-11 20:56:35,223 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, 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;@37399f4a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms]
[2024-11-11 20:56:35,224 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations.
[2024-11-11 20:56:35,228 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4)
[2024-11-11 20:56:35,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13
[2024-11-11 20:56:35,235 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:35,236 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:35,236 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:35,242 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:35,242 INFO L85 PathProgramCache]: Analyzing trace with hash 1470704041, now seen corresponding path program 1 times
[2024-11-11 20:56:35,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:35,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046558587]
[2024-11-11 20:56:35,253 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:35,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:35,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:35,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:35,595 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:35,691 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked.
[2024-11-11 20:56:35,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:35,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046558587]
[2024-11-11 20:56:35,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046558587] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 20:56:35,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 20:56:35,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7
[2024-11-11 20:56:35,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1160147000]
[2024-11-11 20:56:35,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 20:56:35,699 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states
[2024-11-11 20:56:35,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:35,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants.
[2024-11-11 20:56:35,726 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42
[2024-11-11 20:56:35,728 INFO L87 Difference]: Start difference. First operand has 23 states, 16 states have (on average 1.375) internal successors, (22), 17 states have internal predecessors, (22), 4 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-11 20:56:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:35,930 INFO L93 Difference]: Finished difference Result 34 states and 47 transitions.
[2024-11-11 20:56:35,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states.
[2024-11-11 20:56:35,933 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12
[2024-11-11 20:56:35,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:35,940 INFO L225 Difference]: With dead ends: 34
[2024-11-11 20:56:35,940 INFO L226 Difference]: Without dead ends: 24
[2024-11-11 20:56:35,943 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72
[2024-11-11 20:56:35,947 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 7 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:35,948 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 20:56:35,966 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states.
[2024-11-11 20:56:36,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22.
[2024-11-11 20:56:36,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 16 states have internal predecessors, (17), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 4 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-11 20:56:36,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions.
[2024-11-11 20:56:36,022 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 12
[2024-11-11 20:56:36,022 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:36,022 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions.
[2024-11-11 20:56:36,022 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 6 states have internal predecessors, (10), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)
[2024-11-11 20:56:36,023 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions.
[2024-11-11 20:56:36,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20
[2024-11-11 20:56:36,026 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:36,027 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:36,027 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0
[2024-11-11 20:56:36,027 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:36,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:36,028 INFO L85 PathProgramCache]: Analyzing trace with hash 941922339, now seen corresponding path program 1 times
[2024-11-11 20:56:36,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:36,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906555532]
[2024-11-11 20:56:36,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:36,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:36,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,206 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:36,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,337 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked.
[2024-11-11 20:56:36,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:36,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906555532]
[2024-11-11 20:56:36,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906555532] provided 1 perfect and 0 imperfect interpolant sequences
[2024-11-11 20:56:36,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences.
[2024-11-11 20:56:36,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8
[2024-11-11 20:56:36,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820842074]
[2024-11-11 20:56:36,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton
[2024-11-11 20:56:36,345 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states
[2024-11-11 20:56:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:36,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants.
[2024-11-11 20:56:36,346 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56
[2024-11-11 20:56:36,347 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-11 20:56:36,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:36,485 INFO L93 Difference]: Finished difference Result 31 states and 42 transitions.
[2024-11-11 20:56:36,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-11 20:56:36,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 19
[2024-11-11 20:56:36,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:36,487 INFO L225 Difference]: With dead ends: 31
[2024-11-11 20:56:36,487 INFO L226 Difference]: Without dead ends: 27
[2024-11-11 20:56:36,488 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72
[2024-11-11 20:56:36,489 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 5 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:36,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 90 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 20:56:36,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states.
[2024-11-11 20:56:36,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23.
[2024-11-11 20:56:36,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 16 states have (on average 1.125) internal successors, (18), 16 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (7), 5 states have call predecessors, (7), 4 states have call successors, (7)
[2024-11-11 20:56:36,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 29 transitions.
[2024-11-11 20:56:36,503 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 29 transitions. Word has length 19
[2024-11-11 20:56:36,504 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:36,504 INFO L471 AbstractCegarLoop]: Abstraction has 23 states and 29 transitions.
[2024-11-11 20:56:36,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 6 states have internal predecessors, (15), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2)
[2024-11-11 20:56:36,504 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 29 transitions.
[2024-11-11 20:56:36,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26
[2024-11-11 20:56:36,507 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:36,508 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:36,508 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1
[2024-11-11 20:56:36,508 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:36,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:36,510 INFO L85 PathProgramCache]: Analyzing trace with hash -445405100, now seen corresponding path program 1 times
[2024-11-11 20:56:36,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:36,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560584584]
[2024-11-11 20:56:36,510 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:36,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:36,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:36,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,597 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:36,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,622 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9
[2024-11-11 20:56:36,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,627 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked.
[2024-11-11 20:56:36,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560584584]
[2024-11-11 20:56:36,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560584584] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 20:56:36,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [402187148]
[2024-11-11 20:56:36,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:36,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:36,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 20:56:36,631 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)
[2024-11-11 20:56:36,633 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process
[2024-11-11 20:56:36,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:36,678 INFO L256 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core
[2024-11-11 20:56:36,682 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 20:56:36,772 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-11 20:56:36,772 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-11 20:56:36,965 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked.
[2024-11-11 20:56:36,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [402187148] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-11 20:56:36,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-11 20:56:36,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12
[2024-11-11 20:56:36,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1660699028]
[2024-11-11 20:56:36,966 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-11 20:56:36,966 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states
[2024-11-11 20:56:36,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:36,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants.
[2024-11-11 20:56:36,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132
[2024-11-11 20:56:36,970 INFO L87 Difference]: Start difference. First operand 23 states and 29 transitions. Second operand has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-11 20:56:37,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:37,120 INFO L93 Difference]: Finished difference Result 48 states and 75 transitions.
[2024-11-11 20:56:37,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states.
[2024-11-11 20:56:37,121 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5) Word has length 25
[2024-11-11 20:56:37,122 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:37,123 INFO L225 Difference]: With dead ends: 48
[2024-11-11 20:56:37,123 INFO L226 Difference]: Without dead ends: 30
[2024-11-11 20:56:37,124 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 48 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=60, Invalid=150, Unknown=0, NotChecked=0, Total=210
[2024-11-11 20:56:37,125 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 43 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:37,126 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 88 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time]
[2024-11-11 20:56:37,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states.
[2024-11-11 20:56:37,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25.
[2024-11-11 20:56:37,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 4 states have call successors, (4), 1 states have call predecessors, (4), 3 states have return successors, (9), 5 states have call predecessors, (9), 4 states have call successors, (9)
[2024-11-11 20:56:37,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions.
[2024-11-11 20:56:37,135 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 32 transitions. Word has length 25
[2024-11-11 20:56:37,135 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:37,135 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 32 transitions.
[2024-11-11 20:56:37,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 12 states have internal predecessors, (31), 4 states have call successors, (5), 1 states have call predecessors, (5), 5 states have return successors, (5), 2 states have call predecessors, (5), 4 states have call successors, (5)
[2024-11-11 20:56:37,136 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 32 transitions.
[2024-11-11 20:56:37,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33
[2024-11-11 20:56:37,137 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:37,137 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:37,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0
[2024-11-11 20:56:37,338 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:37,339 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:37,339 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:37,340 INFO L85 PathProgramCache]: Analyzing trace with hash 1893657534, now seen corresponding path program 1 times
[2024-11-11 20:56:37,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:37,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1168824880]
[2024-11-11 20:56:37,340 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:37,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:37,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:37,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,563 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:37,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,617 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:37,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-11 20:56:37,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,731 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-11 20:56:37,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1168824880]
[2024-11-11 20:56:37,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1168824880] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 20:56:37,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [409638650]
[2024-11-11 20:56:37,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:37,737 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:37,737 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 20:56:37,739 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)
[2024-11-11 20:56:37,740 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process
[2024-11-11 20:56:37,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:37,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core
[2024-11-11 20:56:37,796 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 20:56:37,874 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked.
[2024-11-11 20:56:37,874 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-11 20:56:38,520 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked.
[2024-11-11 20:56:38,520 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [409638650] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-11 20:56:38,520 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-11 20:56:38,520 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25
[2024-11-11 20:56:38,520 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204139363]
[2024-11-11 20:56:38,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-11 20:56:38,525 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states
[2024-11-11 20:56:38,525 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:38,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants.
[2024-11-11 20:56:38,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600
[2024-11-11 20:56:38,527 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. Second operand has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9)
[2024-11-11 20:56:39,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:39,487 INFO L93 Difference]: Finished difference Result 74 states and 144 transitions.
[2024-11-11 20:56:39,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states.
[2024-11-11 20:56:39,488 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9) Word has length 32
[2024-11-11 20:56:39,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:39,492 INFO L225 Difference]: With dead ends: 74
[2024-11-11 20:56:39,492 INFO L226 Difference]: Without dead ends: 68
[2024-11-11 20:56:39,493 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 360 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=385, Invalid=1967, Unknown=0, NotChecked=0, Total=2352
[2024-11-11 20:56:39,494 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 37 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 609 mSolverCounterSat, 65 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 185 SdHoareTripleChecker+Invalid, 674 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 65 IncrementalHoareTripleChecker+Valid, 609 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:39,494 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 185 Invalid, 674 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [65 Valid, 609 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time]
[2024-11-11 20:56:39,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states.
[2024-11-11 20:56:39,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 38.
[2024-11-11 20:56:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 25 states have (on average 1.08) internal successors, (27), 26 states have internal predecessors, (27), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (31), 10 states have call predecessors, (31), 6 states have call successors, (31)
[2024-11-11 20:56:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 64 transitions.
[2024-11-11 20:56:39,522 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 64 transitions. Word has length 32
[2024-11-11 20:56:39,523 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:39,523 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 64 transitions.
[2024-11-11 20:56:39,523 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.48) internal successors, (37), 19 states have internal predecessors, (37), 3 states have call successors, (5), 1 states have call predecessors, (5), 8 states have return successors, (9), 8 states have call predecessors, (9), 3 states have call successors, (9)
[2024-11-11 20:56:39,523 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 64 transitions.
[2024-11-11 20:56:39,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47
[2024-11-11 20:56:39,524 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:39,525 INFO L218 NwaCegarLoop]: trace histogram [6, 6, 4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:39,542 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0
[2024-11-11 20:56:39,725 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3
[2024-11-11 20:56:39,726 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:39,726 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:39,726 INFO L85 PathProgramCache]: Analyzing trace with hash 372648096, now seen corresponding path program 2 times
[2024-11-11 20:56:39,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:39,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770081028]
[2024-11-11 20:56:39,727 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:39,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:39,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:39,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:39,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:39,855 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:39,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:39,909 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:39,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:39,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:39,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:39,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-11 20:56:39,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:40,009 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:40,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:40,022 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-11 20:56:40,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:40,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770081028]
[2024-11-11 20:56:40,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [770081028] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 20:56:40,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [577317036]
[2024-11-11 20:56:40,023 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1
[2024-11-11 20:56:40,023 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:40,023 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 20:56:40,029 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)
[2024-11-11 20:56:40,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process
[2024-11-11 20:56:40,085 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s)
[2024-11-11 20:56:40,085 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-11 20:56:40,087 INFO L256 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core
[2024-11-11 20:56:40,088 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 20:56:40,162 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked.
[2024-11-11 20:56:40,163 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-11 20:56:40,608 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked.
[2024-11-11 20:56:40,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [577317036] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-11 20:56:40,609 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-11 20:56:40,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20
[2024-11-11 20:56:40,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1945456930]
[2024-11-11 20:56:40,609 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-11 20:56:40,610 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states
[2024-11-11 20:56:40,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:40,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants.
[2024-11-11 20:56:40,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380
[2024-11-11 20:56:40,612 INFO L87 Difference]: Start difference. First operand 38 states and 64 transitions. Second operand has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13)
[2024-11-11 20:56:40,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:40,941 INFO L93 Difference]: Finished difference Result 96 states and 220 transitions.
[2024-11-11 20:56:40,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states.
[2024-11-11 20:56:40,942 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13) Word has length 46
[2024-11-11 20:56:40,942 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:40,944 INFO L225 Difference]: With dead ends: 96
[2024-11-11 20:56:40,944 INFO L226 Difference]: Without dead ends: 63
[2024-11-11 20:56:40,948 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 119 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=165, Invalid=705, Unknown=0, NotChecked=0, Total=870
[2024-11-11 20:56:40,949 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 43 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:40,950 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 130 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time]
[2024-11-11 20:56:40,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states.
[2024-11-11 20:56:40,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60.
[2024-11-11 20:56:40,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 39 states have (on average 1.0512820512820513) internal successors, (41), 40 states have internal predecessors, (41), 9 states have call successors, (9), 2 states have call predecessors, (9), 11 states have return successors, (57), 17 states have call predecessors, (57), 9 states have call successors, (57)
[2024-11-11 20:56:40,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 107 transitions.
[2024-11-11 20:56:40,975 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 107 transitions. Word has length 46
[2024-11-11 20:56:40,975 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:40,976 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 107 transitions.
[2024-11-11 20:56:40,976 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.35) internal successors, (47), 18 states have internal predecessors, (47), 6 states have call successors, (9), 1 states have call predecessors, (9), 10 states have return successors, (13), 9 states have call predecessors, (13), 6 states have call successors, (13)
[2024-11-11 20:56:40,976 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 107 transitions.
[2024-11-11 20:56:40,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87
[2024-11-11 20:56:40,980 INFO L210 NwaCegarLoop]: Found error trace
[2024-11-11 20:56:40,980 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 8, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1]
[2024-11-11 20:56:40,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0
[2024-11-11 20:56:41,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:41,185 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] ===
[2024-11-11 20:56:41,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier
[2024-11-11 20:56:41,185 INFO L85 PathProgramCache]: Analyzing trace with hash -558645120, now seen corresponding path program 3 times
[2024-11-11 20:56:41,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL
[2024-11-11 20:56:41,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203700302]
[2024-11-11 20:56:41,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY
[2024-11-11 20:56:41,186 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms
[2024-11-11 20:56:41,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,281 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 4
[2024-11-11 20:56:41,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,374 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,621 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,642 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,664 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-11 20:56:41,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,669 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36
[2024-11-11 20:56:41,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,715 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,754 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,773 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3
[2024-11-11 20:56:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16
[2024-11-11 20:56:41,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,794 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 100 proven. 93 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked.
[2024-11-11 20:56:41,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace
[2024-11-11 20:56:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203700302]
[2024-11-11 20:56:41,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1203700302] provided 0 perfect and 1 imperfect interpolant sequences
[2024-11-11 20:56:41,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2117160324]
[2024-11-11 20:56:41,795 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2
[2024-11-11 20:56:41,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:41,796 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3
[2024-11-11 20:56:41,797 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)
[2024-11-11 20:56:41,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process
[2024-11-11 20:56:41,865 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s)
[2024-11-11 20:56:41,865 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat
[2024-11-11 20:56:41,866 INFO L256 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjuncts are in the unsatisfiable core
[2024-11-11 20:56:41,869 INFO L279 TraceCheckSpWp]: Computing forward predicates...
[2024-11-11 20:56:42,042 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 20 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked.
[2024-11-11 20:56:42,042 INFO L312 TraceCheckSpWp]: Computing backward predicates...
[2024-11-11 20:56:44,057 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked.
[2024-11-11 20:56:44,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2117160324] provided 0 perfect and 2 imperfect interpolant sequences
[2024-11-11 20:56:44,058 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences.
[2024-11-11 20:56:44,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32
[2024-11-11 20:56:44,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079257224]
[2024-11-11 20:56:44,058 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton
[2024-11-11 20:56:44,059 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states
[2024-11-11 20:56:44,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL
[2024-11-11 20:56:44,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants.
[2024-11-11 20:56:44,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992
[2024-11-11 20:56:44,061 INFO L87 Difference]: Start difference. First operand 60 states and 107 transitions. Second operand has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27)
[2024-11-11 20:56:45,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization.
[2024-11-11 20:56:45,302 INFO L93 Difference]: Finished difference Result 153 states and 443 transitions.
[2024-11-11 20:56:45,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states.
[2024-11-11 20:56:45,303 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27) Word has length 86
[2024-11-11 20:56:45,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted.
[2024-11-11 20:56:45,306 INFO L225 Difference]: With dead ends: 153
[2024-11-11 20:56:45,306 INFO L226 Difference]: Without dead ends: 0
[2024-11-11 20:56:45,315 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 243 GetRequests, 177 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=676, Invalid=3880, Unknown=0, NotChecked=0, Total=4556
[2024-11-11 20:56:45,316 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 88 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 884 mSolverCounterSat, 88 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 972 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 88 IncrementalHoareTripleChecker+Valid, 884 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time
[2024-11-11 20:56:45,318 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 165 Invalid, 972 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [88 Valid, 884 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time]
[2024-11-11 20:56:45,319 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states.
[2024-11-11 20:56:45,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0.
[2024-11-11 20:56:45,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)
[2024-11-11 20:56:45,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions.
[2024-11-11 20:56:45,320 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 86
[2024-11-11 20:56:45,321 INFO L84 Accepts]: Finished accepts. word is rejected.
[2024-11-11 20:56:45,321 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions.
[2024-11-11 20:56:45,322 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 2.0) internal successors, (64), 24 states have internal predecessors, (64), 7 states have call successors, (11), 1 states have call predecessors, (11), 14 states have return successors, (27), 17 states have call predecessors, (27), 7 states have call successors, (27)
[2024-11-11 20:56:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions.
[2024-11-11 20:56:45,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run.
[2024-11-11 20:56:45,325 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining)
[2024-11-11 20:56:45,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0
[2024-11-11 20:56:45,525 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true
[2024-11-11 20:56:45,528 INFO L421 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1]
[2024-11-11 20:56:45,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.
[2024-11-11 20:56:46,479 INFO L170 ceAbstractionStarter]: Computing trace abstraction results
[2024-11-11 20:56:46,512 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.11 08:56:46 BoogieIcfgContainer
[2024-11-11 20:56:46,515 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction----------------------------
[2024-11-11 20:56:46,516 INFO L112 PluginConnector]: ------------------------Witness Printer----------------------------
[2024-11-11 20:56:46,516 INFO L270 PluginConnector]: Initializing Witness Printer...
[2024-11-11 20:56:46,516 INFO L274 PluginConnector]: Witness Printer initialized
[2024-11-11 20:56:46,517 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 08:56:35" (3/4) ...
[2024-11-11 20:56:46,520 INFO L142 WitnessPrinter]: Generating witness for correct program
[2024-11-11 20:56:46,525 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann
[2024-11-11 20:56:46,528 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges
[2024-11-11 20:56:46,529 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges
[2024-11-11 20:56:46,530 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges
[2024-11-11 20:56:46,530 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges
[2024-11-11 20:56:46,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml
[2024-11-11 20:56:46,622 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml
[2024-11-11 20:56:46,622 INFO L131 PluginConnector]: ------------------------ END Witness Printer----------------------------
[2024-11-11 20:56:46,623 INFO L158 Benchmark]: Toolchain (without parser) took 12130.18ms. Allocated memory was 176.2MB in the beginning and 293.6MB in the end (delta: 117.4MB). Free memory was 107.8MB in the beginning and 225.9MB in the end (delta: -118.2MB). Peak memory consumption was 1.3MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,623 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 20:56:46,623 INFO L158 Benchmark]: CACSL2BoogieTranslator took 267.29ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 95.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,624 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.75ms. Allocated memory is still 176.2MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,624 INFO L158 Benchmark]: Boogie Preprocessor took 53.79ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
[2024-11-11 20:56:46,624 INFO L158 Benchmark]: RCFGBuilder took 291.02ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 140.3MB in the end (delta: -48.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,624 INFO L158 Benchmark]: TraceAbstraction took 11372.15ms. Allocated memory was 176.2MB in the beginning and 293.6MB in the end (delta: 117.4MB). Free memory was 139.5MB in the beginning and 230.1MB in the end (delta: -90.6MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,624 INFO L158 Benchmark]: Witness Printer took 106.54ms. Allocated memory is still 293.6MB. Free memory was 230.1MB in the beginning and 225.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
[2024-11-11 20:56:46,627 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] #######################
--- Results ---
* Results from de.uni_freiburg.informatik.ultimate.core:
- StatisticsResult: Toolchain Benchmarks
Benchmark results are:
* CDTParser took 0.22ms. Allocated memory is still 176.2MB. Free memory was 134.1MB in the beginning and 133.9MB in the end (delta: 160.8kB). There was no memory consumed. Max. memory is 16.1GB.
* CACSL2BoogieTranslator took 267.29ms. Allocated memory is still 176.2MB. Free memory was 107.6MB in the beginning and 95.3MB in the end (delta: 12.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB.
* Boogie Procedure Inliner took 31.75ms. Allocated memory is still 176.2MB. Free memory was 95.3MB in the beginning and 93.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB.
* Boogie Preprocessor took 53.79ms. Allocated memory is still 176.2MB. Free memory was 93.9MB in the beginning and 92.2MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB.
* RCFGBuilder took 291.02ms. Allocated memory is still 176.2MB. Free memory was 92.2MB in the beginning and 140.3MB in the end (delta: -48.0MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB.
* TraceAbstraction took 11372.15ms. Allocated memory was 176.2MB in the beginning and 293.6MB in the end (delta: 117.4MB). Free memory was 139.5MB in the beginning and 230.1MB in the end (delta: -90.6MB). Peak memory consumption was 161.3MB. Max. memory is 16.1GB.
* Witness Printer took 106.54ms. Allocated memory is still 293.6MB. Free memory was 230.1MB in the beginning and 225.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB.
* Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction:
- StatisticsResult: ErrorAutomatonStatistics
NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0
- PositiveResult [Line: 46]: a call to reach_error is unreachable
For all program executions holds that a call to reach_error is unreachable at this location
- StatisticsResult: Ultimate Automizer benchmark data
CFG has 2 procedures, 23 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.3s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 246 SdHoareTripleChecker+Valid, 1.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 223 mSDsluCounter, 748 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 632 mSDsCounter, 244 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1983 IncrementalHoareTripleChecker+Invalid, 2227 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 244 mSolverCounterUnsat, 116 mSDtfsCounter, 1983 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 561 GetRequests, 389 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1431 ImplicationChecksByTransitivity, 2.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=60occurred in iteration=5, InterpolantAutomatonStates: 114, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 6 MinimizatonAttempts, 44 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 5.6s InterpolantComputationTime, 409 NumberOfCodeBlocks, 372 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 584 ConstructedInterpolants, 0 QuantifiedInterpolants, 1314 SizeOfPredicates, 2 NumberOfNonLiveVariables, 515 ConjunctsInSsa, 49 ConjunctsInUnsatCore, 14 InterpolantComputations, 2 PerfectInterpolantSequences, 1129/1303 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available
- AllSpecificationsHoldResult: All specifications hold
1 specifications checked. All of them hold
- ProcedureContractResult [Line: 17]: Procedure Contract for ackermann
Derived contract for procedure ackermann. Ensures: (((0 < m) || ((m == 0) && (((long long) n + 1) <= \result))) && (((((((2 <= m) && (0 <= \result)) && (n <= 0)) || ((m == 1) && (3 <= \result))) || (m < 1)) || (((2 <= \result) && (n <= 0)) && (m == 1))) || ((2 <= m) && (0 <= \result))))
RESULT: Ultimate proved your program to be correct!
[2024-11-11 20:56:46,658 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0
Received shutdown request...
--- End real Ultimate output ---
Execution finished normally
Writing output log to file Ultimate.log
Result:
TRUE