./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/unreach-call.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c -s /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 03:01:39,324 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 03:01:39,397 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-10-11 03:01:39,402 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 03:01:39,403 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 03:01:39,423 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 03:01:39,424 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 03:01:39,424 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 03:01:39,425 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 03:01:39,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 03:01:39,426 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 03:01:39,426 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 03:01:39,427 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 03:01:39,431 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 03:01:39,431 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 03:01:39,431 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 03:01:39,432 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-10-11 03:01:39,432 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 03:01:39,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 03:01:39,432 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 03:01:39,432 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 03:01:39,435 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-10-11 03:01:39,435 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 03:01:39,435 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-10-11 03:01:39,436 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 03:01:39,436 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 03:01:39,436 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-10-11 03:01:39,436 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 03:01:39,436 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 03:01:39,437 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 03:01:39,437 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 03:01:39,437 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 03:01:39,437 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:01:39,437 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 03:01:39,438 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 03:01:39,438 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-10-11 03:01:39,438 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 03:01:39,439 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 03:01:39,440 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 03:01:39,440 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 03:01:39,440 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 03:01:39,440 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 03:01:39,440 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-clean/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-clean/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-10-11 03:01:39,736 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 03:01:39,764 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 03:01:39,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 03:01:39,770 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 03:01:39,770 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 03:01:39,772 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2024-10-11 03:01:41,207 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 03:01:41,385 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 03:01:41,386 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Ackermann01-2.c [2024-10-11 03:01:41,393 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/862a2d5e2/0ac480b7bf364a878fdf4dfd999b0fb6/FLAG1f38bd791 [2024-10-11 03:01:41,406 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/862a2d5e2/0ac480b7bf364a878fdf4dfd999b0fb6 [2024-10-11 03:01:41,411 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 03:01:41,412 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 03:01:41,415 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 03:01:41,415 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 03:01:41,421 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 03:01:41,421 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,422 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57cd3a58 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41, skipping insertion in model container [2024-10-11 03:01:41,424 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,445 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 03:01:41,616 WARN L248 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-10-11 03:01:41,621 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:01:41,634 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 03:01:41,650 WARN L248 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-10-11 03:01:41,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 03:01:41,667 INFO L204 MainTranslator]: Completed translation [2024-10-11 03:01:41,667 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41 WrapperNode [2024-10-11 03:01:41,667 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 03:01:41,668 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 03:01:41,669 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 03:01:41,669 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 03:01:41,675 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,681 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,693 INFO L138 Inliner]: procedures = 13, calls = 11, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 33 [2024-10-11 03:01:41,694 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 03:01:41,695 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 03:01:41,695 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 03:01:41,695 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 03:01:41,703 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,704 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,705 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,716 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-10-11 03:01:41,716 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,716 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,719 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,721 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,721 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,722 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,724 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 03:01:41,725 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 03:01:41,725 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 03:01:41,725 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 03:01:41,726 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (1/1) ... [2024-10-11 03:01:41,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 03:01:41,744 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:41,757 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 03:01:41,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 03:01:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-10-11 03:01:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 03:01:41,803 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 03:01:41,803 INFO L130 BoogieDeclarations]: Found specification of procedure ackermann [2024-10-11 03:01:41,804 INFO L138 BoogieDeclarations]: Found implementation of procedure ackermann [2024-10-11 03:01:41,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-10-11 03:01:41,859 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 03:01:41,861 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 03:01:41,961 INFO L? ?]: Removed 13 outVars from TransFormulas that were not future-live. [2024-10-11 03:01:41,962 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 03:01:42,018 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 03:01:42,019 INFO L314 CfgBuilder]: Removed 0 assume(true) statements. [2024-10-11 03:01:42,019 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:42 BoogieIcfgContainer [2024-10-11 03:01:42,019 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 03:01:42,022 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 03:01:42,022 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 03:01:42,038 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 03:01:42,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 03:01:41" (1/3) ... [2024-10-11 03:01:42,039 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:01:42, skipping insertion in model container [2024-10-11 03:01:42,039 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 03:01:41" (2/3) ... [2024-10-11 03:01:42,040 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2c64f482 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 03:01:42, skipping insertion in model container [2024-10-11 03:01:42,040 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:42" (3/3) ... [2024-10-11 03:01:42,041 INFO L112 eAbstractionObserver]: Analyzing ICFG Ackermann01-2.c [2024-10-11 03:01:42,058 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 03:01:42,059 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-10-11 03:01:42,110 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 03:01:42,116 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;@581f1624, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 03:01:42,116 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-10-11 03:01:42,120 INFO L276 IsEmpty]: Start isEmpty. Operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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-10-11 03:01:42,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 03:01:42,126 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:42,127 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:42,127 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:42,131 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:42,132 INFO L85 PathProgramCache]: Analyzing trace with hash 1538870455, now seen corresponding path program 1 times [2024-10-11 03:01:42,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:42,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531606504] [2024-10-11 03:01:42,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:42,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:42,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:42,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:42,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:42,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-11 03:01:42,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:42,548 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531606504] [2024-10-11 03:01:42,548 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531606504] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:01:42,549 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:01:42,549 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-10-11 03:01:42,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1119709237] [2024-10-11 03:01:42,552 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:01:42,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 03:01:42,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:42,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 03:01:42,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-11 03:01:42,585 INFO L87 Difference]: Start difference. First operand has 21 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 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.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-11 03:01:42,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:42,790 INFO L93 Difference]: Finished difference Result 31 states and 44 transitions. [2024-10-11 03:01:42,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-11 03:01:42,793 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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 11 [2024-10-11 03:01:42,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:42,800 INFO L225 Difference]: With dead ends: 31 [2024-10-11 03:01:42,800 INFO L226 Difference]: Without dead ends: 23 [2024-10-11 03:01:42,803 INFO L431 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-10-11 03:01:42,806 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 7 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:42,807 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 72 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:42,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2024-10-11 03:01:42,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 21. [2024-10-11 03:01:42,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.1428571428571428) internal successors, (16), 15 states have internal predecessors, (16), 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-10-11 03:01:42,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 27 transitions. [2024-10-11 03:01:42,843 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 27 transitions. Word has length 11 [2024-10-11 03:01:42,843 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:42,843 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 27 transitions. [2024-10-11 03:01:42,843 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.5) internal successors, (9), 6 states have internal predecessors, (9), 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-10-11 03:01:42,844 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 27 transitions. [2024-10-11 03:01:42,845 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-11 03:01:42,845 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:42,845 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:42,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 03:01:42,846 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:42,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:42,846 INFO L85 PathProgramCache]: Analyzing trace with hash -108557995, now seen corresponding path program 1 times [2024-10-11 03:01:42,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:42,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107941350] [2024-10-11 03:01:42,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:42,847 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:42,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:42,956 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,021 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-11 03:01:43,114 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:43,114 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107941350] [2024-10-11 03:01:43,114 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107941350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 03:01:43,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 03:01:43,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-11 03:01:43,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052243161] [2024-10-11 03:01:43,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 03:01:43,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 03:01:43,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:43,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 03:01:43,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-10-11 03:01:43,122 INFO L87 Difference]: Start difference. First operand 21 states and 27 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 03:01:43,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:43,270 INFO L93 Difference]: Finished difference Result 30 states and 41 transitions. [2024-10-11 03:01:43,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:01:43,271 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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 18 [2024-10-11 03:01:43,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:43,272 INFO L225 Difference]: With dead ends: 30 [2024-10-11 03:01:43,272 INFO L226 Difference]: Without dead ends: 26 [2024-10-11 03:01:43,273 INFO L431 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-10-11 03:01:43,276 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 5 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:43,277 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 80 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:43,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2024-10-11 03:01:43,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 22. [2024-10-11 03:01:43,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 15 states have (on average 1.1333333333333333) internal successors, (17), 15 states have internal predecessors, (17), 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-10-11 03:01:43,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2024-10-11 03:01:43,292 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 18 [2024-10-11 03:01:43,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:43,293 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2024-10-11 03:01:43,293 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 6 states have internal predecessors, (14), 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-10-11 03:01:43,294 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2024-10-11 03:01:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-10-11 03:01:43,297 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:43,297 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 03:01:43,298 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 03:01:43,298 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:43,298 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:43,299 INFO L85 PathProgramCache]: Analyzing trace with hash -1474991098, now seen corresponding path program 1 times [2024-10-11 03:01:43,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:43,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [952180166] [2024-10-11 03:01:43,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:43,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:43,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,367 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:43,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,398 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:43,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,426 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 9 [2024-10-11 03:01:43,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,432 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-11 03:01:43,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:43,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [952180166] [2024-10-11 03:01:43,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [952180166] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:43,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1844129340] [2024-10-11 03:01:43,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:43,433 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:43,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:43,437 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:43,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 03:01:43,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:43,497 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-10-11 03:01:43,505 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:43,595 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:01:43,598 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:43,812 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 6 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-11 03:01:43,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1844129340] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:43,812 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:43,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-10-11 03:01:43,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099969852] [2024-10-11 03:01:43,813 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:43,813 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-11 03:01:43,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:43,814 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-11 03:01:43,814 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2024-10-11 03:01:43,815 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-10-11 03:01:43,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:43,954 INFO L93 Difference]: Finished difference Result 47 states and 74 transitions. [2024-10-11 03:01:43,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 03:01:43,955 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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 24 [2024-10-11 03:01:43,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:43,956 INFO L225 Difference]: With dead ends: 47 [2024-10-11 03:01:43,956 INFO L226 Difference]: Without dead ends: 29 [2024-10-11 03:01:43,957 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 46 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-10-11 03:01:43,958 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 25 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:43,958 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 71 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:43,959 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2024-10-11 03:01:43,970 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 24. [2024-10-11 03:01:43,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 16 states have (on average 1.125) internal successors, (18), 17 states have internal predecessors, (18), 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-10-11 03:01:43,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 31 transitions. [2024-10-11 03:01:43,973 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 31 transitions. Word has length 24 [2024-10-11 03:01:43,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:43,973 INFO L471 AbstractCegarLoop]: Abstraction has 24 states and 31 transitions. [2024-10-11 03:01:43,974 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 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-10-11 03:01:43,974 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 31 transitions. [2024-10-11 03:01:43,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-10-11 03:01:43,979 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:43,979 INFO L215 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] [2024-10-11 03:01:43,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 03:01:44,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:44,181 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:44,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:44,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1725758412, now seen corresponding path program 1 times [2024-10-11 03:01:44,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:44,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775928538] [2024-10-11 03:01:44,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:44,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:44,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,282 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:44,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,360 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:44,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:44,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,463 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:44,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,507 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 13 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:01:44,507 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:44,507 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775928538] [2024-10-11 03:01:44,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775928538] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:44,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240636628] [2024-10-11 03:01:44,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:44,508 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:44,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:44,511 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:44,513 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 03:01:44,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:44,564 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-10-11 03:01:44,566 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:44,628 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-10-11 03:01:44,628 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:45,299 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 15 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-10-11 03:01:45,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240636628] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:45,301 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:45,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 11, 13] total 25 [2024-10-11 03:01:45,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1699919494] [2024-10-11 03:01:45,302 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:45,302 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-10-11 03:01:45,302 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:45,303 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-10-11 03:01:45,304 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=520, Unknown=0, NotChecked=0, Total=600 [2024-10-11 03:01:45,304 INFO L87 Difference]: Start difference. First operand 24 states and 31 transitions. Second operand has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 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-10-11 03:01:46,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:46,229 INFO L93 Difference]: Finished difference Result 73 states and 143 transitions. [2024-10-11 03:01:46,229 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2024-10-11 03:01:46,230 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 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 31 [2024-10-11 03:01:46,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:46,237 INFO L225 Difference]: With dead ends: 73 [2024-10-11 03:01:46,238 INFO L226 Difference]: Without dead ends: 67 [2024-10-11 03:01:46,240 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=385, Invalid=1967, Unknown=0, NotChecked=0, Total=2352 [2024-10-11 03:01:46,243 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 36 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 529 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:46,245 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 121 Invalid, 529 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-11 03:01:46,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2024-10-11 03:01:46,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 37. [2024-10-11 03:01:46,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.0833333333333333) internal successors, (26), 25 states have internal predecessors, (26), 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-10-11 03:01:46,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 63 transitions. [2024-10-11 03:01:46,281 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 63 transitions. Word has length 31 [2024-10-11 03:01:46,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:46,282 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 63 transitions. [2024-10-11 03:01:46,282 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 1.44) internal successors, (36), 19 states have internal predecessors, (36), 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-10-11 03:01:46,283 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 63 transitions. [2024-10-11 03:01:46,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-10-11 03:01:46,286 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:46,286 INFO L215 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] [2024-10-11 03:01:46,304 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 03:01:46,490 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:46,491 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:46,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:46,492 INFO L85 PathProgramCache]: Analyzing trace with hash 1482164270, now seen corresponding path program 2 times [2024-10-11 03:01:46,492 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:46,492 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524351390] [2024-10-11 03:01:46,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:46,493 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:46,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,542 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:46,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:46,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,663 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:46,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:46,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,718 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:46,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,739 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:46,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:46,752 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 14 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 03:01:46,752 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524351390] [2024-10-11 03:01:46,753 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524351390] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:46,753 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1012351960] [2024-10-11 03:01:46,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-11 03:01:46,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:46,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:46,755 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:46,759 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 03:01:46,820 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-11 03:01:46,821 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:01:46,822 INFO L255 TraceCheckSpWp]: Trace formula consists of 152 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 03:01:46,823 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:46,898 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 31 proven. 13 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2024-10-11 03:01:46,899 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:47,291 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2024-10-11 03:01:47,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1012351960] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:47,291 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:47,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 9] total 20 [2024-10-11 03:01:47,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534451859] [2024-10-11 03:01:47,292 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:47,292 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-11 03:01:47,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:47,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-11 03:01:47,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=325, Unknown=0, NotChecked=0, Total=380 [2024-10-11 03:01:47,294 INFO L87 Difference]: Start difference. First operand 37 states and 63 transitions. Second operand has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 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-10-11 03:01:47,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:47,566 INFO L93 Difference]: Finished difference Result 95 states and 219 transitions. [2024-10-11 03:01:47,566 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 03:01:47,567 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 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 45 [2024-10-11 03:01:47,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:47,569 INFO L225 Difference]: With dead ends: 95 [2024-10-11 03:01:47,569 INFO L226 Difference]: Without dead ends: 62 [2024-10-11 03:01:47,571 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 94 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-10-11 03:01:47,571 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 53 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:47,572 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [53 Valid, 84 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-11 03:01:47,572 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2024-10-11 03:01:47,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 59. [2024-10-11 03:01:47,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 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-10-11 03:01:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 106 transitions. [2024-10-11 03:01:47,587 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 106 transitions. Word has length 45 [2024-10-11 03:01:47,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:47,590 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 106 transitions. [2024-10-11 03:01:47,590 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 2.3) internal successors, (46), 18 states have internal predecessors, (46), 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-10-11 03:01:47,591 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 106 transitions. [2024-10-11 03:01:47,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2024-10-11 03:01:47,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 03:01:47,596 INFO L215 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] [2024-10-11 03:01:47,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 03:01:47,800 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:47,801 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-10-11 03:01:47,801 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 03:01:47,801 INFO L85 PathProgramCache]: Analyzing trace with hash 841120270, now seen corresponding path program 3 times [2024-10-11 03:01:47,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 03:01:47,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88567432] [2024-10-11 03:01:47,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 03:01:47,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 03:01:47,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:47,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:47,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,042 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,157 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,253 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,274 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,298 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:48,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,303 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2024-10-11 03:01:48,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,366 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,410 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,446 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2024-10-11 03:01:48,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,461 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 16 [2024-10-11 03:01:48,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 03:01:48,465 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 100 proven. 93 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-10-11 03:01:48,467 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 03:01:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88567432] [2024-10-11 03:01:48,467 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88567432] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 03:01:48,467 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1199777187] [2024-10-11 03:01:48,467 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-10-11 03:01:48,467 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 03:01:48,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 03:01:48,470 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 03:01:48,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 03:01:48,537 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2024-10-11 03:01:48,538 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-11 03:01:48,539 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-10-11 03:01:48,564 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 03:01:48,735 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 112 proven. 20 refuted. 0 times theorem prover too weak. 192 trivial. 0 not checked. [2024-10-11 03:01:48,736 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 03:01:50,706 INFO L134 CoverageAnalysis]: Checked inductivity of 324 backedges. 133 proven. 2 refuted. 0 times theorem prover too weak. 189 trivial. 0 not checked. [2024-10-11 03:01:50,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1199777187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 03:01:50,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 03:01:50,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 12, 14] total 32 [2024-10-11 03:01:50,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050760887] [2024-10-11 03:01:50,706 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 03:01:50,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 03:01:50,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 03:01:50,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 03:01:50,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=893, Unknown=0, NotChecked=0, Total=992 [2024-10-11 03:01:50,710 INFO L87 Difference]: Start difference. First operand 59 states and 106 transitions. Second operand has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 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-10-11 03:01:51,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 03:01:51,860 INFO L93 Difference]: Finished difference Result 152 states and 442 transitions. [2024-10-11 03:01:51,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2024-10-11 03:01:51,861 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 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 85 [2024-10-11 03:01:51,863 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 03:01:51,864 INFO L225 Difference]: With dead ends: 152 [2024-10-11 03:01:51,864 INFO L226 Difference]: Without dead ends: 0 [2024-10-11 03:01:51,874 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 241 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 933 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=676, Invalid=3880, Unknown=0, NotChecked=0, Total=4556 [2024-10-11 03:01:51,877 INFO L432 NwaCegarLoop]: 16 mSDtfsCounter, 57 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 932 mSolverCounterSat, 70 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 161 SdHoareTripleChecker+Invalid, 1002 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 70 IncrementalHoareTripleChecker+Valid, 932 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 03:01:51,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [57 Valid, 161 Invalid, 1002 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [70 Valid, 932 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 03:01:51,878 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-10-11 03:01:51,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-10-11 03:01:51,879 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-10-11 03:01:51,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-10-11 03:01:51,879 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 85 [2024-10-11 03:01:51,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 03:01:51,879 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-10-11 03:01:51,880 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.96875) internal successors, (63), 24 states have internal predecessors, (63), 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-10-11 03:01:51,880 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-10-11 03:01:51,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-10-11 03:01:51,886 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2024-10-11 03:01:51,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 03:01:52,090 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-10-11 03:01:52,093 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1] [2024-10-11 03:01:52,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2024-10-11 03:01:53,086 INFO L165 ceAbstractionStarter]: Computing trace abstraction results [2024-10-11 03:01:53,125 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.10 03:01:53 BoogieIcfgContainer [2024-10-11 03:01:53,127 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-10-11 03:01:53,128 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-10-11 03:01:53,128 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-10-11 03:01:53,129 INFO L274 PluginConnector]: Witness Printer initialized [2024-10-11 03:01:53,129 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 03:01:42" (3/4) ... [2024-10-11 03:01:53,131 INFO L139 WitnessPrinter]: Generating witness for correct program [2024-10-11 03:01:53,135 INFO L361 RCFGBacktranslator]: Ignoring RootEdge to procedure ackermann [2024-10-11 03:01:53,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2024-10-11 03:01:53,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2024-10-11 03:01:53,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2024-10-11 03:01:53,139 INFO L904 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2024-10-11 03:01:53,221 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-10-11 03:01:53,222 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/witness.yml [2024-10-11 03:01:53,222 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-10-11 03:01:53,222 INFO L158 Benchmark]: Toolchain (without parser) took 11810.29ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 120.2MB in the beginning and 205.6MB in the end (delta: -85.3MB). Peak memory consumption was 59.7MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,223 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 98.6MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-10-11 03:01:53,223 INFO L158 Benchmark]: CACSL2BoogieTranslator took 253.12ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 108.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,223 INFO L158 Benchmark]: Boogie Procedure Inliner took 25.49ms. Allocated memory is still 165.7MB. Free memory was 108.4MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,224 INFO L158 Benchmark]: Boogie Preprocessor took 29.30ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,224 INFO L158 Benchmark]: RCFGBuilder took 294.61ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 135.2MB in the end (delta: -30.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,224 INFO L158 Benchmark]: TraceAbstraction took 11105.46ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 134.3MB in the beginning and 209.8MB in the end (delta: -75.5MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,224 INFO L158 Benchmark]: Witness Printer took 93.77ms. Allocated memory is still 312.5MB. Free memory was 209.8MB in the beginning and 205.6MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-10-11 03:01:53,226 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.29ms. Allocated memory is still 98.6MB. Free memory is still 59.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 253.12ms. Allocated memory is still 165.7MB. Free memory was 120.2MB in the beginning and 108.4MB in the end (delta: 11.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 25.49ms. Allocated memory is still 165.7MB. Free memory was 108.4MB in the beginning and 106.9MB in the end (delta: 1.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.30ms. Allocated memory is still 165.7MB. Free memory was 106.9MB in the beginning and 105.2MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 294.61ms. Allocated memory is still 165.7MB. Free memory was 105.2MB in the beginning and 135.2MB in the end (delta: -30.0MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 11105.46ms. Allocated memory was 165.7MB in the beginning and 312.5MB in the end (delta: 146.8MB). Free memory was 134.3MB in the beginning and 209.8MB in the end (delta: -75.5MB). Peak memory consumption was 181.8MB. Max. memory is 16.1GB. * Witness Printer took 93.77ms. Allocated memory is still 312.5MB. Free memory was 209.8MB in the beginning and 205.6MB 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, 21 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.0s, OverallIterations: 6, TraceHistogramMax: 12, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 3.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 205 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 183 mSDsluCounter, 589 SdHoareTripleChecker+Invalid, 1.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 487 mSDsCounter, 230 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1884 IncrementalHoareTripleChecker+Invalid, 2114 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 230 mSolverCounterUnsat, 102 mSDtfsCounter, 1884 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 553 GetRequests, 381 SyntacticMatches, 4 SemanticMatches, 168 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1429 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=59occurred 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.5s InterpolantComputationTime, 399 NumberOfCodeBlocks, 362 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 570 ConstructedInterpolants, 0 QuantifiedInterpolants, 1300 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-10-11 03:01:53,254 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/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