./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive/Fibonacci01-1.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 8fc3dc66 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/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.6.800.v20240513-1750.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/Fibonacci01-1.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 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-16 18:50:56,293 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-16 18:50:56,340 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-16 18:50:56,343 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-16 18:50:56,343 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-16 18:50:56,367 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-16 18:50:56,368 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-16 18:50:56,368 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-16 18:50:56,369 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-16 18:50:56,369 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-16 18:50:56,369 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-16 18:50:56,369 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-16 18:50:56,370 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-16 18:50:56,370 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-16 18:50:56,370 INFO L153 SettingsManager]: * Use SBE=true [2025-03-16 18:50:56,370 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-16 18:50:56,370 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-16 18:50:56,371 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-16 18:50:56,371 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:50:56,372 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-16 18:50:56,372 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-16 18:50:56,373 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> 6b0570f2e0d80d68bc280040cce27f654b3fe7a2c0bad30f9bb811af9ca3d994 [2025-03-16 18:50:56,595 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-16 18:50:56,604 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-16 18:50:56,605 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-16 18:50:56,606 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-16 18:50:56,606 INFO L274 PluginConnector]: CDTParser initialized [2025-03-16 18:50:56,607 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-03-16 18:50:57,704 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ce2f11d/73e794ad9d90429491e5464375132834/FLAGa0058dbee [2025-03-16 18:50:57,908 INFO L384 CDTParser]: Found 1 translation units. [2025-03-16 18:50:57,909 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive/Fibonacci01-1.c [2025-03-16 18:50:57,920 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ce2f11d/73e794ad9d90429491e5464375132834/FLAGa0058dbee [2025-03-16 18:50:57,930 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/98ce2f11d/73e794ad9d90429491e5464375132834 [2025-03-16 18:50:57,932 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-16 18:50:57,934 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-16 18:50:57,934 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-16 18:50:57,934 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-16 18:50:57,937 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-16 18:50:57,938 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:50:57" (1/1) ... [2025-03-16 18:50:57,938 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@723a4f88 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:57, skipping insertion in model container [2025-03-16 18:50:57,939 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.03 06:50:57" (1/1) ... [2025-03-16 18:50:57,948 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-16 18:50:58,051 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/Fibonacci01-1.c[804,817] [2025-03-16 18:50:58,054 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:50:58,060 INFO L200 MainTranslator]: Completed pre-run [2025-03-16 18:50:58,071 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/Fibonacci01-1.c[804,817] [2025-03-16 18:50:58,071 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-16 18:50:58,081 INFO L204 MainTranslator]: Completed translation [2025-03-16 18:50:58,082 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58 WrapperNode [2025-03-16 18:50:58,082 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-16 18:50:58,083 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-16 18:50:58,083 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-16 18:50:58,083 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-16 18:50:58,088 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,092 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,102 INFO L138 Inliner]: procedures = 13, calls = 10, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 26 [2025-03-16 18:50:58,102 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-16 18:50:58,103 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-16 18:50:58,103 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-16 18:50:58,103 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-16 18:50:58,108 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,109 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,110 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,121 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]. [2025-03-16 18:50:58,121 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,121 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,125 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,126 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,127 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,127 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,129 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-16 18:50:58,130 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-16 18:50:58,130 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-16 18:50:58,130 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-16 18:50:58,131 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (1/1) ... [2025-03-16 18:50:58,135 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-16 18:50:58,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:50:58,160 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) [2025-03-16 18:50:58,163 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 [2025-03-16 18:50:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure fibonacci [2025-03-16 18:50:58,182 INFO L138 BoogieDeclarations]: Found implementation of procedure fibonacci [2025-03-16 18:50:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-16 18:50:58,182 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-16 18:50:58,183 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-16 18:50:58,183 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-16 18:50:58,223 INFO L256 CfgBuilder]: Building ICFG [2025-03-16 18:50:58,224 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-16 18:50:58,279 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint L22: havoc #t~ret4;havoc #t~ret5; [2025-03-16 18:50:58,330 INFO L? ?]: Removed 9 outVars from TransFormulas that were not future-live. [2025-03-16 18:50:58,330 INFO L307 CfgBuilder]: Performing block encoding [2025-03-16 18:50:58,337 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-16 18:50:58,338 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-16 18:50:58,338 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:50:58 BoogieIcfgContainer [2025-03-16 18:50:58,339 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-16 18:50:58,341 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-16 18:50:58,341 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-16 18:50:58,344 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-16 18:50:58,345 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.03 06:50:57" (1/3) ... [2025-03-16 18:50:58,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6ad63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:50:58, skipping insertion in model container [2025-03-16 18:50:58,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.03 06:50:58" (2/3) ... [2025-03-16 18:50:58,346 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7d6ad63c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.03 06:50:58, skipping insertion in model container [2025-03-16 18:50:58,346 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:50:58" (3/3) ... [2025-03-16 18:50:58,348 INFO L128 eAbstractionObserver]: Analyzing ICFG Fibonacci01-1.c [2025-03-16 18:50:58,360 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-16 18:50:58,362 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG Fibonacci01-1.c that has 2 procedures, 19 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-16 18:50:58,438 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-16 18:50:58,451 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;@6c1562ef, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-16 18:50:58,451 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-16 18:50:58,455 INFO L276 IsEmpty]: Start isEmpty. Operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-16 18:50:58,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-16 18:50:58,460 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:50:58,460 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:50:58,461 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:50:58,465 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:50:58,465 INFO L85 PathProgramCache]: Analyzing trace with hash -165355574, now seen corresponding path program 1 times [2025-03-16 18:50:58,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:50:58,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1359998013] [2025-03-16 18:50:58,471 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:50:58,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:50:58,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-16 18:50:58,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-16 18:50:58,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:50:58,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:50:58,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:50:58,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:50:58,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1359998013] [2025-03-16 18:50:58,724 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1359998013] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:50:58,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:50:58,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:50:58,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755905933] [2025-03-16 18:50:58,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:50:58,728 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:50:58,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:50:58,744 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:50:58,744 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:50:58,745 INFO L87 Difference]: Start difference. First operand has 19 states, 13 states have (on average 1.3846153846153846) internal successors, (18), 14 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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) [2025-03-16 18:50:58,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:50:58,846 INFO L93 Difference]: Finished difference Result 30 states and 39 transitions. [2025-03-16 18:50:58,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:50:58,848 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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 10 [2025-03-16 18:50:58,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:50:58,853 INFO L225 Difference]: With dead ends: 30 [2025-03-16 18:50:58,853 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:50:58,855 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:50:58,856 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 50 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:50:58,857 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 50 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:50:58,866 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:50:58,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-16 18:50:58,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 18:50:58,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 18:50:58,888 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 10 [2025-03-16 18:50:58,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:50:58,888 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 18:50:58,888 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 5 states have internal predecessors, (8), 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) [2025-03-16 18:50:58,889 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 18:50:58,889 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-16 18:50:58,889 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:50:58,889 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:50:58,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-16 18:50:58,890 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:50:58,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:50:58,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1699155895, now seen corresponding path program 1 times [2025-03-16 18:50:58,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:50:58,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731284309] [2025-03-16 18:50:58,891 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:50:58,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:50:58,896 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-16 18:50:58,904 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-16 18:50:58,904 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:50:58,904 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:50:58,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-16 18:50:58,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:50:58,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731284309] [2025-03-16 18:50:58,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731284309] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-16 18:50:58,985 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-16 18:50:58,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-03-16 18:50:58,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1360802811] [2025-03-16 18:50:58,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-16 18:50:58,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-16 18:50:58,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:50:58,986 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-16 18:50:58,986 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:50:58,987 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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) [2025-03-16 18:50:59,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:50:59,053 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2025-03-16 18:50:59,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-16 18:50:59,054 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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 [2025-03-16 18:50:59,054 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:50:59,054 INFO L225 Difference]: With dead ends: 24 [2025-03-16 18:50:59,054 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:50:59,054 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-03-16 18:50:59,055 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 4 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:50:59,055 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 48 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:50:59,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:50:59,058 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 18. [2025-03-16 18:50:59,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.1666666666666667) internal successors, (14), 13 states have internal predecessors, (14), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-16 18:50:59,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 22 transitions. [2025-03-16 18:50:59,059 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 22 transitions. Word has length 11 [2025-03-16 18:50:59,059 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:50:59,059 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 22 transitions. [2025-03-16 18:50:59,059 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.5) internal successors, (9), 5 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) [2025-03-16 18:50:59,059 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 22 transitions. [2025-03-16 18:50:59,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-16 18:50:59,060 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:50:59,060 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:50:59,060 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-16 18:50:59,060 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:50:59,061 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:50:59,061 INFO L85 PathProgramCache]: Analyzing trace with hash -1017906903, now seen corresponding path program 1 times [2025-03-16 18:50:59,061 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:50:59,061 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [150831000] [2025-03-16 18:50:59,061 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:50:59,061 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:50:59,066 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 18:50:59,071 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 18:50:59,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:50:59,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:50:59,145 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 5 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:50:59,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:50:59,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [150831000] [2025-03-16 18:50:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [150831000] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:50:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1896079120] [2025-03-16 18:50:59,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:50:59,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:50:59,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:50:59,149 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) [2025-03-16 18:50:59,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-16 18:50:59,182 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-16 18:50:59,191 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-16 18:50:59,192 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:50:59,192 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:50:59,193 INFO L256 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:50:59,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:50:59,368 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-03-16 18:50:59,369 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:50:59,750 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:50:59,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1896079120] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:50:59,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:50:59,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 11] total 20 [2025-03-16 18:50:59,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097936285] [2025-03-16 18:50:59,750 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:50:59,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-03-16 18:50:59,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:50:59,751 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-03-16 18:50:59,751 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=318, Unknown=0, NotChecked=0, Total=380 [2025-03-16 18:50:59,751 INFO L87 Difference]: Start difference. First operand 18 states and 22 transitions. Second operand has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-16 18:50:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:50:59,878 INFO L93 Difference]: Finished difference Result 35 states and 46 transitions. [2025-03-16 18:50:59,878 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-16 18:50:59,878 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) Word has length 23 [2025-03-16 18:50:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:50:59,879 INFO L225 Difference]: With dead ends: 35 [2025-03-16 18:50:59,879 INFO L226 Difference]: Without dead ends: 20 [2025-03-16 18:50:59,879 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=386, Unknown=0, NotChecked=0, Total=462 [2025-03-16 18:50:59,880 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:50:59,880 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:50:59,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2025-03-16 18:50:59,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2025-03-16 18:50:59,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 13 states have (on average 1.1538461538461537) internal successors, (15), 15 states have internal predecessors, (15), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-03-16 18:50:59,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2025-03-16 18:50:59,886 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 23 [2025-03-16 18:50:59,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:50:59,886 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2025-03-16 18:50:59,886 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 1.9473684210526316) internal successors, (37), 16 states have internal predecessors, (37), 7 states have call successors, (7), 1 states have call predecessors, (7), 7 states have return successors, (9), 7 states have call predecessors, (9), 7 states have call successors, (9) [2025-03-16 18:50:59,886 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2025-03-16 18:50:59,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2025-03-16 18:50:59,887 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:50:59,887 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:50:59,894 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-16 18:51:00,087 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 [2025-03-16 18:51:00,088 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:00,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:00,088 INFO L85 PathProgramCache]: Analyzing trace with hash 1716168056, now seen corresponding path program 1 times [2025-03-16 18:51:00,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:00,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1258342574] [2025-03-16 18:51:00,088 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:51:00,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:00,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:51:00,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:51:00,102 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:51:00,102 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:00,254 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:51:00,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1258342574] [2025-03-16 18:51:00,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1258342574] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:00,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2132601172] [2025-03-16 18:51:00,255 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-16 18:51:00,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:00,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:00,257 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) [2025-03-16 18:51:00,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-16 18:51:00,280 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-03-16 18:51:00,288 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-03-16 18:51:00,288 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:51:00,288 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:00,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-16 18:51:00,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:00,430 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-16 18:51:00,430 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:00,684 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-16 18:51:00,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2132601172] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:00,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:00,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 21 [2025-03-16 18:51:00,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493866154] [2025-03-16 18:51:00,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:00,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-03-16 18:51:00,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:00,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-03-16 18:51:00,685 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=347, Unknown=0, NotChecked=0, Total=420 [2025-03-16 18:51:00,686 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-16 18:51:00,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:00,841 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2025-03-16 18:51:00,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-03-16 18:51:00,841 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 24 [2025-03-16 18:51:00,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:00,842 INFO L225 Difference]: With dead ends: 31 [2025-03-16 18:51:00,842 INFO L226 Difference]: Without dead ends: 27 [2025-03-16 18:51:00,842 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=120, Invalid=530, Unknown=0, NotChecked=0, Total=650 [2025-03-16 18:51:00,843 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 16 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:00,843 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 77 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:51:00,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2025-03-16 18:51:00,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2025-03-16 18:51:00,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 16 states have (on average 1.125) internal successors, (18), 18 states have internal predecessors, (18), 4 states have call successors, (4), 1 states have call predecessors, (4), 4 states have return successors, (12), 5 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-16 18:51:00,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 34 transitions. [2025-03-16 18:51:00,852 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 34 transitions. Word has length 24 [2025-03-16 18:51:00,852 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:00,852 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 34 transitions. [2025-03-16 18:51:00,852 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 16 states have internal predecessors, (33), 6 states have call successors, (6), 1 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-16 18:51:00,852 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 34 transitions. [2025-03-16 18:51:00,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2025-03-16 18:51:00,853 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:00,853 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:00,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-16 18:51:01,053 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 [2025-03-16 18:51:01,053 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:01,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:01,054 INFO L85 PathProgramCache]: Analyzing trace with hash 499105723, now seen corresponding path program 2 times [2025-03-16 18:51:01,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:01,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [396507454] [2025-03-16 18:51:01,054 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:51:01,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:01,058 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 18:51:01,064 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:51:01,064 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:51:01,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:01,177 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 24 proven. 7 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:51:01,177 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:01,177 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [396507454] [2025-03-16 18:51:01,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [396507454] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:01,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423263359] [2025-03-16 18:51:01,178 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-16 18:51:01,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:01,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:01,180 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) [2025-03-16 18:51:01,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-16 18:51:01,206 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 37 statements into 2 equivalence classes. [2025-03-16 18:51:01,216 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 37 of 37 statements. [2025-03-16 18:51:01,216 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-16 18:51:01,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:01,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-16 18:51:01,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:01,266 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 13 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-16 18:51:01,266 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:01,461 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 22 proven. 14 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2025-03-16 18:51:01,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423263359] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:01,462 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:01,462 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 9] total 15 [2025-03-16 18:51:01,462 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817725453] [2025-03-16 18:51:01,462 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:01,462 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2025-03-16 18:51:01,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:01,463 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2025-03-16 18:51:01,463 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:51:01,463 INFO L87 Difference]: Start difference. First operand 25 states and 34 transitions. Second operand has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-16 18:51:01,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:01,535 INFO L93 Difference]: Finished difference Result 52 states and 76 transitions. [2025-03-16 18:51:01,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-03-16 18:51:01,536 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) Word has length 37 [2025-03-16 18:51:01,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:01,537 INFO L225 Difference]: With dead ends: 52 [2025-03-16 18:51:01,537 INFO L226 Difference]: Without dead ends: 30 [2025-03-16 18:51:01,537 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=96, Invalid=210, Unknown=0, NotChecked=0, Total=306 [2025-03-16 18:51:01,538 INFO L435 NwaCegarLoop]: 18 mSDtfsCounter, 15 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:01,538 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 70 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:51:01,538 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-03-16 18:51:01,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 27. [2025-03-16 18:51:01,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 18 states have (on average 1.1111111111111112) internal successors, (20), 19 states have internal predecessors, (20), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (11), 5 states have call predecessors, (11), 4 states have call successors, (11) [2025-03-16 18:51:01,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2025-03-16 18:51:01,548 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 37 [2025-03-16 18:51:01,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:01,548 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2025-03-16 18:51:01,548 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.6) internal successors, (39), 15 states have internal predecessors, (39), 6 states have call successors, (8), 1 states have call predecessors, (8), 5 states have return successors, (8), 4 states have call predecessors, (8), 6 states have call successors, (8) [2025-03-16 18:51:01,548 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2025-03-16 18:51:01,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-16 18:51:01,549 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:01,549 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:01,558 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-16 18:51:01,749 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 [2025-03-16 18:51:01,750 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:01,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:01,750 INFO L85 PathProgramCache]: Analyzing trace with hash 1857756560, now seen corresponding path program 3 times [2025-03-16 18:51:01,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:01,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82382817] [2025-03-16 18:51:01,750 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:51:01,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:01,754 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-16 18:51:01,759 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-16 18:51:01,759 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 18:51:01,759 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:01,972 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 9 proven. 27 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2025-03-16 18:51:01,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82382817] [2025-03-16 18:51:01,973 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82382817] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:01,973 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [911600991] [2025-03-16 18:51:01,973 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-16 18:51:01,973 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:01,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:01,975 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) [2025-03-16 18:51:01,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-16 18:51:02,002 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 38 statements into 5 equivalence classes. [2025-03-16 18:51:02,013 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 30 of 38 statements. [2025-03-16 18:51:02,013 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-03-16 18:51:02,013 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:02,014 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-03-16 18:51:02,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:02,165 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 22 proven. 10 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-03-16 18:51:02,165 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:02,588 INFO L134 CoverageAnalysis]: Checked inductivity of 50 backedges. 13 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2025-03-16 18:51:02,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [911600991] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:02,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:02,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 14] total 29 [2025-03-16 18:51:02,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409243049] [2025-03-16 18:51:02,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:02,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-16 18:51:02,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:02,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-16 18:51:02,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=710, Unknown=0, NotChecked=0, Total=812 [2025-03-16 18:51:02,591 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-16 18:51:02,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:02,898 INFO L93 Difference]: Finished difference Result 44 states and 64 transitions. [2025-03-16 18:51:02,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-16 18:51:02,899 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) Word has length 38 [2025-03-16 18:51:02,899 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:02,900 INFO L225 Difference]: With dead ends: 44 [2025-03-16 18:51:02,900 INFO L226 Difference]: Without dead ends: 40 [2025-03-16 18:51:02,900 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 101 GetRequests, 56 SyntacticMatches, 6 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=261, Invalid=1379, Unknown=0, NotChecked=0, Total=1640 [2025-03-16 18:51:02,901 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 21 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 147 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:02,901 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 147 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:51:02,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2025-03-16 18:51:02,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 30. [2025-03-16 18:51:02,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.1) internal successors, (22), 21 states have internal predecessors, (22), 4 states have call successors, (4), 2 states have call predecessors, (4), 5 states have return successors, (14), 6 states have call predecessors, (14), 4 states have call successors, (14) [2025-03-16 18:51:02,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 40 transitions. [2025-03-16 18:51:02,906 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 40 transitions. Word has length 38 [2025-03-16 18:51:02,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:02,906 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 40 transitions. [2025-03-16 18:51:02,906 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 21 states have internal predecessors, (46), 8 states have call successors, (9), 1 states have call predecessors, (9), 8 states have return successors, (13), 13 states have call predecessors, (13), 8 states have call successors, (13) [2025-03-16 18:51:02,906 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 40 transitions. [2025-03-16 18:51:02,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-16 18:51:02,907 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:02,907 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 6, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:02,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-16 18:51:03,108 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 [2025-03-16 18:51:03,108 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:03,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:03,109 INFO L85 PathProgramCache]: Analyzing trace with hash 446257138, now seen corresponding path program 4 times [2025-03-16 18:51:03,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:03,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1281695355] [2025-03-16 18:51:03,109 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:51:03,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:03,113 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-16 18:51:03,119 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 52 statements. [2025-03-16 18:51:03,119 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 18:51:03,119 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:03,163 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 18:51:03,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:03,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1281695355] [2025-03-16 18:51:03,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1281695355] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:03,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [768359289] [2025-03-16 18:51:03,164 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-16 18:51:03,164 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:03,164 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:03,165 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:51:03,167 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-16 18:51:03,196 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-16 18:51:03,203 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) and asserted 43 of 52 statements. [2025-03-16 18:51:03,204 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 1 check-sat command(s) [2025-03-16 18:51:03,204 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:03,204 INFO L256 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-16 18:51:03,205 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:03,225 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 18:51:03,225 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:03,351 INFO L134 CoverageAnalysis]: Checked inductivity of 111 backedges. 30 proven. 31 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2025-03-16 18:51:03,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [768359289] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:03,352 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:03,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 9 [2025-03-16 18:51:03,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604220594] [2025-03-16 18:51:03,352 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:03,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-16 18:51:03,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:03,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-16 18:51:03,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-03-16 18:51:03,353 INFO L87 Difference]: Start difference. First operand 30 states and 40 transitions. Second operand has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:51:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:03,424 INFO L93 Difference]: Finished difference Result 60 states and 88 transitions. [2025-03-16 18:51:03,424 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-16 18:51:03,424 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) Word has length 52 [2025-03-16 18:51:03,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:03,425 INFO L225 Difference]: With dead ends: 60 [2025-03-16 18:51:03,425 INFO L226 Difference]: Without dead ends: 32 [2025-03-16 18:51:03,425 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 99 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=138, Unknown=0, NotChecked=0, Total=210 [2025-03-16 18:51:03,426 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 28 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:03,426 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 54 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-16 18:51:03,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-16 18:51:03,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2025-03-16 18:51:03,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 20 states have (on average 1.1) internal successors, (22), 20 states have internal predecessors, (22), 4 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (8), 5 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-16 18:51:03,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2025-03-16 18:51:03,430 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 52 [2025-03-16 18:51:03,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:03,430 INFO L471 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2025-03-16 18:51:03,430 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.4444444444444446) internal successors, (31), 9 states have internal predecessors, (31), 3 states have call successors, (6), 1 states have call predecessors, (6), 4 states have return successors, (7), 4 states have call predecessors, (7), 3 states have call successors, (7) [2025-03-16 18:51:03,430 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2025-03-16 18:51:03,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2025-03-16 18:51:03,431 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:03,431 INFO L218 NwaCegarLoop]: trace histogram [7, 7, 5, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:03,437 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-16 18:51:03,636 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:03,636 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:03,636 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:03,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1233021197, now seen corresponding path program 5 times [2025-03-16 18:51:03,637 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:03,637 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242294370] [2025-03-16 18:51:03,637 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:51:03,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:03,642 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-03-16 18:51:03,645 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 51 statements. [2025-03-16 18:51:03,645 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-16 18:51:03,645 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:03,718 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 34 proven. 35 refuted. 0 times theorem prover too weak. 37 trivial. 0 not checked. [2025-03-16 18:51:03,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242294370] [2025-03-16 18:51:03,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242294370] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:03,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1183022260] [2025-03-16 18:51:03,718 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-16 18:51:03,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:03,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:03,720 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:51:03,721 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-16 18:51:03,744 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 51 statements into 6 equivalence classes. [2025-03-16 18:51:03,750 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) and asserted 31 of 51 statements. [2025-03-16 18:51:03,750 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2025-03-16 18:51:03,750 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:03,750 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjuncts are in the unsatisfiable core [2025-03-16 18:51:03,751 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:03,805 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 39 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-03-16 18:51:03,806 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:04,027 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 31 proven. 41 refuted. 0 times theorem prover too weak. 34 trivial. 0 not checked. [2025-03-16 18:51:04,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1183022260] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:04,027 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:04,027 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 10] total 17 [2025-03-16 18:51:04,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237903386] [2025-03-16 18:51:04,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:04,028 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2025-03-16 18:51:04,028 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:04,028 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2025-03-16 18:51:04,028 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=209, Unknown=0, NotChecked=0, Total=272 [2025-03-16 18:51:04,028 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-16 18:51:04,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:04,140 INFO L93 Difference]: Finished difference Result 61 states and 79 transitions. [2025-03-16 18:51:04,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-03-16 18:51:04,141 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) Word has length 51 [2025-03-16 18:51:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:04,141 INFO L225 Difference]: With dead ends: 61 [2025-03-16 18:51:04,141 INFO L226 Difference]: Without dead ends: 37 [2025-03-16 18:51:04,142 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 95 SyntacticMatches, 4 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=177, Invalid=423, Unknown=0, NotChecked=0, Total=600 [2025-03-16 18:51:04,142 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 46 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 151 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:04,142 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 70 Invalid, 151 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-16 18:51:04,143 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2025-03-16 18:51:04,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2025-03-16 18:51:04,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:51:04,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-16 18:51:04,147 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 51 [2025-03-16 18:51:04,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:04,147 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-16 18:51:04,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 7 states have call successors, (10), 1 states have call predecessors, (10), 6 states have return successors, (11), 5 states have call predecessors, (11), 7 states have call successors, (11) [2025-03-16 18:51:04,147 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-16 18:51:04,148 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-03-16 18:51:04,148 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:04,148 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 9, 5, 5, 5, 5, 5, 5, 5, 4, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:04,154 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-16 18:51:04,348 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:04,348 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:04,349 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:04,349 INFO L85 PathProgramCache]: Analyzing trace with hash -867442915, now seen corresponding path program 6 times [2025-03-16 18:51:04,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:04,349 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1108604643] [2025-03-16 18:51:04,349 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:51:04,349 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:04,353 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 10 equivalence classes. [2025-03-16 18:51:04,361 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 71 of 79 statements. [2025-03-16 18:51:04,362 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-16 18:51:04,362 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:04,725 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 47 proven. 130 refuted. 0 times theorem prover too weak. 119 trivial. 0 not checked. [2025-03-16 18:51:04,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1108604643] [2025-03-16 18:51:04,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1108604643] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:04,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [925223996] [2025-03-16 18:51:04,725 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-16 18:51:04,725 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:04,726 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:04,727 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:51:04,729 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-16 18:51:04,756 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 79 statements into 10 equivalence classes. [2025-03-16 18:51:04,776 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) and asserted 71 of 79 statements. [2025-03-16 18:51:04,776 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2025-03-16 18:51:04,777 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:04,778 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 31 conjuncts are in the unsatisfiable core [2025-03-16 18:51:04,779 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:05,019 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 106 proven. 53 refuted. 0 times theorem prover too weak. 137 trivial. 0 not checked. [2025-03-16 18:51:05,019 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:06,246 INFO L134 CoverageAnalysis]: Checked inductivity of 296 backedges. 77 proven. 89 refuted. 0 times theorem prover too weak. 130 trivial. 0 not checked. [2025-03-16 18:51:06,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [925223996] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:06,246 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:06,246 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 20] total 40 [2025-03-16 18:51:06,246 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689650966] [2025-03-16 18:51:06,247 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:06,247 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-16 18:51:06,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:06,248 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-16 18:51:06,248 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=180, Invalid=1380, Unknown=0, NotChecked=0, Total=1560 [2025-03-16 18:51:06,248 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 40 states, 40 states have (on average 1.475) internal successors, (59), 27 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (22), 21 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-16 18:51:06,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:06,608 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-03-16 18:51:06,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-16 18:51:06,609 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 40 states have (on average 1.475) internal successors, (59), 27 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (22), 21 states have call predecessors, (22), 12 states have call successors, (22) Word has length 79 [2025-03-16 18:51:06,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:06,609 INFO L225 Difference]: With dead ends: 51 [2025-03-16 18:51:06,609 INFO L226 Difference]: Without dead ends: 45 [2025-03-16 18:51:06,610 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 132 SyntacticMatches, 14 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1122 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=441, Invalid=2639, Unknown=0, NotChecked=0, Total=3080 [2025-03-16 18:51:06,610 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 36 mSDsluCounter, 185 mSDsCounter, 0 mSdLazyCounter, 457 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 457 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:06,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 200 Invalid, 483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 457 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:51:06,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2025-03-16 18:51:06,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2025-03-16 18:51:06,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 26 states have (on average 1.0769230769230769) internal successors, (28), 25 states have internal predecessors, (28), 5 states have call successors, (5), 4 states have call predecessors, (5), 5 states have return successors, (11), 7 states have call predecessors, (11), 5 states have call successors, (11) [2025-03-16 18:51:06,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 44 transitions. [2025-03-16 18:51:06,615 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 44 transitions. Word has length 79 [2025-03-16 18:51:06,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:06,615 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 44 transitions. [2025-03-16 18:51:06,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 40 states have (on average 1.475) internal successors, (59), 27 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (22), 21 states have call predecessors, (22), 12 states have call successors, (22) [2025-03-16 18:51:06,615 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2025-03-16 18:51:06,616 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2025-03-16 18:51:06,616 INFO L210 NwaCegarLoop]: Found error trace [2025-03-16 18:51:06,616 INFO L218 NwaCegarLoop]: trace histogram [9, 9, 7, 4, 4, 4, 4, 4, 4, 4, 3, 2, 1, 1, 1, 1, 1, 1, 1] [2025-03-16 18:51:06,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-16 18:51:06,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:06,818 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-16 18:51:06,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-16 18:51:06,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1757126261, now seen corresponding path program 7 times [2025-03-16 18:51:06,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-16 18:51:06,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171065291] [2025-03-16 18:51:06,818 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 18:51:06,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-16 18:51:06,821 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 18:51:06,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 18:51:06,825 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:51:06,825 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:07,083 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 113 refuted. 0 times theorem prover too weak. 76 trivial. 0 not checked. [2025-03-16 18:51:07,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-16 18:51:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171065291] [2025-03-16 18:51:07,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171065291] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-16 18:51:07,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1937955849] [2025-03-16 18:51:07,083 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-16 18:51:07,083 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-16 18:51:07,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-16 18:51:07,085 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-16 18:51:07,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-16 18:51:07,125 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 65 statements into 1 equivalence classes. [2025-03-16 18:51:07,138 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 65 of 65 statements. [2025-03-16 18:51:07,138 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-16 18:51:07,138 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-16 18:51:07,140 INFO L256 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-03-16 18:51:07,143 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-16 18:51:07,387 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 25 proven. 92 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-16 18:51:07,387 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-16 18:51:08,388 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 14 proven. 118 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-03-16 18:51:08,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1937955849] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-16 18:51:08,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-16 18:51:08,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 19, 22] total 39 [2025-03-16 18:51:08,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091272757] [2025-03-16 18:51:08,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-16 18:51:08,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2025-03-16 18:51:08,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-16 18:51:08,389 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2025-03-16 18:51:08,389 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=199, Invalid=1283, Unknown=0, NotChecked=0, Total=1482 [2025-03-16 18:51:08,389 INFO L87 Difference]: Start difference. First operand 37 states and 44 transitions. Second operand has 39 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 26 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (23), 20 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-16 18:51:08,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-16 18:51:08,745 INFO L93 Difference]: Finished difference Result 56 states and 76 transitions. [2025-03-16 18:51:08,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2025-03-16 18:51:08,745 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 26 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (23), 20 states have call predecessors, (23), 12 states have call successors, (23) Word has length 65 [2025-03-16 18:51:08,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-16 18:51:08,746 INFO L225 Difference]: With dead ends: 56 [2025-03-16 18:51:08,746 INFO L226 Difference]: Without dead ends: 0 [2025-03-16 18:51:08,747 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 106 SyntacticMatches, 10 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=472, Invalid=2720, Unknown=0, NotChecked=0, Total=3192 [2025-03-16 18:51:08,747 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 34 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 376 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 376 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-16 18:51:08,747 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 117 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 376 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-16 18:51:08,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-16 18:51:08,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-16 18:51:08,747 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) [2025-03-16 18:51:08,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-16 18:51:08,747 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 65 [2025-03-16 18:51:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-16 18:51:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-16 18:51:08,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.5128205128205128) internal successors, (59), 26 states have internal predecessors, (59), 12 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (23), 20 states have call predecessors, (23), 12 states have call successors, (23) [2025-03-16 18:51:08,748 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-16 18:51:08,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-16 18:51:08,760 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-16 18:51:08,768 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-03-16 18:51:08,961 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-16 18:51:08,964 INFO L422 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1] [2025-03-16 18:51:08,966 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-16 18:51:09,337 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-16 18:51:09,341 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 16.03 06:51:09 BoogieIcfgContainer [2025-03-16 18:51:09,342 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-16 18:51:09,342 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-16 18:51:09,342 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-16 18:51:09,342 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-16 18:51:09,343 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.03 06:50:58" (3/4) ... [2025-03-16 18:51:09,344 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-16 18:51:09,348 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure fibonacci [2025-03-16 18:51:09,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2025-03-16 18:51:09,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2025-03-16 18:51:09,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2025-03-16 18:51:09,350 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-16 18:51:09,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-16 18:51:09,399 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-16 18:51:09,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-16 18:51:09,401 INFO L158 Benchmark]: Toolchain (without parser) took 11466.43ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 134.8MB in the beginning and 91.7MB in the end (delta: 43.1MB). Peak memory consumption was 116.7MB. Max. memory is 16.1GB. [2025-03-16 18:51:09,402 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:51:09,402 INFO L158 Benchmark]: CACSL2BoogieTranslator took 148.35ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 124.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:51:09,402 INFO L158 Benchmark]: Boogie Procedure Inliner took 19.19ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 122.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:51:09,402 INFO L158 Benchmark]: Boogie Preprocessor took 26.00ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-16 18:51:09,403 INFO L158 Benchmark]: IcfgBuilder took 209.13ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-16 18:51:09,403 INFO L158 Benchmark]: TraceAbstraction took 11000.69ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 110.1MB in the beginning and 97.7MB in the end (delta: 12.4MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. [2025-03-16 18:51:09,403 INFO L158 Benchmark]: Witness Printer took 57.21ms. Allocated memory is still 243.3MB. Free memory was 97.7MB in the beginning and 91.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-16 18:51:09,407 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.12ms. Allocated memory is still 201.3MB. Free memory is still 116.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 148.35ms. Allocated memory is still 167.8MB. Free memory was 134.4MB in the beginning and 124.0MB in the end (delta: 10.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 19.19ms. Allocated memory is still 167.8MB. Free memory was 124.0MB in the beginning and 122.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 26.00ms. Allocated memory is still 167.8MB. Free memory was 122.9MB in the beginning and 121.7MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 209.13ms. Allocated memory is still 167.8MB. Free memory was 121.7MB in the beginning and 110.8MB in the end (delta: 10.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 11000.69ms. Allocated memory was 167.8MB in the beginning and 243.3MB in the end (delta: 75.5MB). Free memory was 110.1MB in the beginning and 97.7MB in the end (delta: 12.4MB). Peak memory consumption was 83.9MB. Max. memory is 16.1GB. * Witness Printer took 57.21ms. Allocated memory is still 243.3MB. Free memory was 97.7MB in the beginning and 91.7MB in the end (delta: 6.0MB). Peak memory consumption was 8.4MB. 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: 36]: 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, 19 locations, 27 edges, 1 error locations. Started 1 CEGAR loops. OverallTime: 10.5s, OverallIterations: 10, TraceHistogramMax: 11, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 1.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 238 SdHoareTripleChecker+Valid, 1.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 217 mSDsluCounter, 914 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 776 mSDsCounter, 234 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1820 IncrementalHoareTripleChecker+Invalid, 2054 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 234 mSolverCounterUnsat, 138 mSDtfsCounter, 1820 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 923 GetRequests, 626 SyntacticMatches, 45 SemanticMatches, 252 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3129 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=8, InterpolantAutomatonStates: 126, 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, 10 MinimizatonAttempts, 30 StatesRemovedByMinimization, 7 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 6.4s InterpolantComputationTime, 759 NumberOfCodeBlocks, 669 NumberOfCodeBlocksAsserted, 44 NumberOfCheckSat, 1102 ConstructedInterpolants, 0 QuantifiedInterpolants, 3246 SizeOfPredicates, 13 NumberOfNonLiveVariables, 844 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 26 InterpolantComputations, 2 PerfectInterpolantSequences, 1535/2472 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, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2025-03-16 18:51:09,418 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