./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 798a7b37 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-simple/id_i25_o25-2.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-03 14:35:46,850 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-03 14:35:46,903 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-03 14:35:46,906 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-03 14:35:46,906 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-03 14:35:46,923 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-03 14:35:46,924 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-03 14:35:46,924 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-03 14:35:46,925 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-03 14:35:46,925 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-03 14:35:46,925 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-03 14:35:46,925 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-03 14:35:46,925 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Use SBE=true [2025-03-03 14:35:46,926 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-03 14:35:46,926 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-03 14:35:46,927 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:46,927 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-03 14:35:46,927 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-03 14:35:46,928 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-03 14:35:46,928 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-03 14:35:46,928 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 -> 76955366716759eb9478710f6ef46e3de93d252b9c3177ff4beaca56ee5c75a7 [2025-03-03 14:35:47,150 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-03 14:35:47,160 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-03 14:35:47,161 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-03 14:35:47,162 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-03 14:35:47,162 INFO L274 PluginConnector]: CDTParser initialized [2025-03-03 14:35:47,164 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2025-03-03 14:35:48,251 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13679c16/a18f7171874b469d99bf96f930b73f95/FLAG8d7246220 [2025-03-03 14:35:48,474 INFO L384 CDTParser]: Found 1 translation units. [2025-03-03 14:35:48,474 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/recursive-simple/id_i25_o25-2.c [2025-03-03 14:35:48,479 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13679c16/a18f7171874b469d99bf96f930b73f95/FLAG8d7246220 [2025-03-03 14:35:48,828 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f13679c16/a18f7171874b469d99bf96f930b73f95 [2025-03-03 14:35:48,830 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-03 14:35:48,831 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-03 14:35:48,831 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:48,831 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-03 14:35:48,834 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-03 14:35:48,834 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,835 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@404a5b4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48, skipping insertion in model container [2025-03-03 14:35:48,835 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,843 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-03 14:35:48,931 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-simple/id_i25_o25-2.c[454,467] [2025-03-03 14:35:48,934 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:48,941 INFO L200 MainTranslator]: Completed pre-run [2025-03-03 14:35:48,950 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-simple/id_i25_o25-2.c[454,467] [2025-03-03 14:35:48,950 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-03 14:35:48,960 INFO L204 MainTranslator]: Completed translation [2025-03-03 14:35:48,961 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48 WrapperNode [2025-03-03 14:35:48,961 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-03 14:35:48,961 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:48,961 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-03 14:35:48,962 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-03 14:35:48,965 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,978 INFO L138 Inliner]: procedures = 13, calls = 9, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 18 [2025-03-03 14:35:48,979 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-03 14:35:48,979 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-03 14:35:48,980 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-03 14:35:48,980 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-03 14:35:48,984 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,985 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,985 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,993 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-03 14:35:48,993 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,994 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,997 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,998 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,998 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,999 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:48,999 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-03 14:35:49,000 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-03 14:35:49,000 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-03 14:35:49,000 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-03 14:35:49,001 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (1/1) ... [2025-03-03 14:35:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-03 14:35:49,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:49,029 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-03 14:35:49,034 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-03 14:35:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-03 14:35:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-03 14:35:49,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-03 14:35:49,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-03 14:35:49,053 INFO L130 BoogieDeclarations]: Found specification of procedure id [2025-03-03 14:35:49,053 INFO L138 BoogieDeclarations]: Found implementation of procedure id [2025-03-03 14:35:49,088 INFO L256 CfgBuilder]: Building ICFG [2025-03-03 14:35:49,089 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-03 14:35:49,154 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L8: havoc #t~ret4; [2025-03-03 14:35:49,161 INFO L? ?]: Removed 5 outVars from TransFormulas that were not future-live. [2025-03-03 14:35:49,161 INFO L307 CfgBuilder]: Performing block encoding [2025-03-03 14:35:49,169 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-03 14:35:49,170 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-03 14:35:49,171 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:49 BoogieIcfgContainer [2025-03-03 14:35:49,171 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-03 14:35:49,172 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-03 14:35:49,172 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-03 14:35:49,175 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-03 14:35:49,176 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.03 02:35:48" (1/3) ... [2025-03-03 14:35:49,176 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ef2e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:49, skipping insertion in model container [2025-03-03 14:35:49,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.03 02:35:48" (2/3) ... [2025-03-03 14:35:49,177 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55ef2e24 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.03 02:35:49, skipping insertion in model container [2025-03-03 14:35:49,177 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:49" (3/3) ... [2025-03-03 14:35:49,178 INFO L128 eAbstractionObserver]: Analyzing ICFG id_i25_o25-2.c [2025-03-03 14:35:49,189 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-03 14:35:49,191 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG id_i25_o25-2.c that has 2 procedures, 16 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-03-03 14:35:49,226 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-03 14:35:49,235 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;@139cdcf3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-03 14:35:49,235 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-03 14:35:49,238 INFO L276 IsEmpty]: Start isEmpty. Operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-03-03 14:35:49,242 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2025-03-03 14:35:49,242 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:49,242 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:49,242 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:49,246 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:49,246 INFO L85 PathProgramCache]: Analyzing trace with hash 1536782931, now seen corresponding path program 1 times [2025-03-03 14:35:49,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:49,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1290780811] [2025-03-03 14:35:49,251 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:49,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:49,289 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 10 statements into 1 equivalence classes. [2025-03-03 14:35:49,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 10 of 10 statements. [2025-03-03 14:35:49,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:49,304 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:49,396 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-03 14:35:49,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:49,396 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1290780811] [2025-03-03 14:35:49,397 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1290780811] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-03 14:35:49,397 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-03 14:35:49,397 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-03 14:35:49,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055777755] [2025-03-03 14:35:49,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-03 14:35:49,401 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-03 14:35:49,401 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:49,414 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-03 14:35:49,414 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:49,416 INFO L87 Difference]: Start difference. First operand has 16 states, 11 states have (on average 1.2727272727272727) internal successors, (14), 12 states have internal predecessors, (14), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-03 14:35:49,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:49,439 INFO L93 Difference]: Finished difference Result 25 states and 28 transitions. [2025-03-03 14:35:49,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-03 14:35:49,441 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-03 14:35:49,441 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:49,445 INFO L225 Difference]: With dead ends: 25 [2025-03-03 14:35:49,445 INFO L226 Difference]: Without dead ends: 15 [2025-03-03 14:35:49,446 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-03 14:35:49,448 INFO L435 NwaCegarLoop]: 15 mSDtfsCounter, 0 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:49,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 53 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:49,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2025-03-03 14:35:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2025-03-03 14:35:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 10 states have (on average 1.1) internal successors, (11), 11 states have internal predecessors, (11), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-03 14:35:49,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 16 transitions. [2025-03-03 14:35:49,471 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 16 transitions. Word has length 10 [2025-03-03 14:35:49,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:49,472 INFO L471 AbstractCegarLoop]: Abstraction has 15 states and 16 transitions. [2025-03-03 14:35:49,472 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 1.6) internal successors, (8), 4 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-03 14:35:49,472 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 16 transitions. [2025-03-03 14:35:49,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-03 14:35:49,473 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:49,473 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:49,473 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-03 14:35:49,474 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:49,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:49,475 INFO L85 PathProgramCache]: Analyzing trace with hash -808024836, now seen corresponding path program 1 times [2025-03-03 14:35:49,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:49,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1303205702] [2025-03-03 14:35:49,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:49,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:49,483 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:35:49,490 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:35:49,490 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:49,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:49,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:35:49,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:49,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1303205702] [2025-03-03 14:35:49,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1303205702] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:49,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864875138] [2025-03-03 14:35:49,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-03 14:35:49,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:49,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:49,573 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-03 14:35:49,574 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-03 14:35:49,597 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-03 14:35:49,606 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-03 14:35:49,606 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:35:49,606 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:49,608 INFO L256 TraceCheckSpWp]: Trace formula consists of 57 conjuncts, 6 conjuncts are in the unsatisfiable core [2025-03-03 14:35:49,611 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:49,654 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-03 14:35:49,654 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:49,822 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-03 14:35:49,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864875138] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:49,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:49,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 7] total 9 [2025-03-03 14:35:49,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1153878297] [2025-03-03 14:35:49,824 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:49,824 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-03 14:35:49,825 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:49,825 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-03 14:35:49,826 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2025-03-03 14:35:49,826 INFO L87 Difference]: Start difference. First operand 15 states and 16 transitions. Second operand has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:35:49,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:49,865 INFO L93 Difference]: Finished difference Result 22 states and 23 transitions. [2025-03-03 14:35:49,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-03 14:35:49,866 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) Word has length 16 [2025-03-03 14:35:49,866 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:49,866 INFO L225 Difference]: With dead ends: 22 [2025-03-03 14:35:49,866 INFO L226 Difference]: Without dead ends: 18 [2025-03-03 14:35:49,867 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2025-03-03 14:35:49,867 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 14 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:49,868 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 32 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-03 14:35:49,868 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2025-03-03 14:35:49,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2025-03-03 14:35:49,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 12 states have (on average 1.0833333333333333) internal successors, (13), 13 states have internal predecessors, (13), 2 states have call successors, (2), 1 states have call predecessors, (2), 3 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2025-03-03 14:35:49,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2025-03-03 14:35:49,885 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 16 [2025-03-03 14:35:49,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:49,885 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2025-03-03 14:35:49,885 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 9 states have internal predecessors, (16), 4 states have call successors, (4), 1 states have call predecessors, (4), 2 states have return successors, (4), 2 states have call predecessors, (4), 4 states have call successors, (4) [2025-03-03 14:35:49,885 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2025-03-03 14:35:49,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-03 14:35:49,886 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:49,886 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:49,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-03 14:35:50,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:50,087 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:50,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:50,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1152729037, now seen corresponding path program 2 times [2025-03-03 14:35:50,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:50,088 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-03 14:35:50,088 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:50,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:50,093 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 14:35:50,102 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:35:50,104 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:50,104 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:50,255 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:35:50,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511812354] [2025-03-03 14:35:50,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511812354] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:50,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [572389322] [2025-03-03 14:35:50,255 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:35:50,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:50,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:50,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-03 14:35:50,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-03 14:35:50,276 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 22 statements into 2 equivalence classes. [2025-03-03 14:35:50,285 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 22 of 22 statements. [2025-03-03 14:35:50,285 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:35:50,285 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:50,286 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 8 conjuncts are in the unsatisfiable core [2025-03-03 14:35:50,287 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:50,355 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-03 14:35:50,355 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:50,650 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-03 14:35:50,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [572389322] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:50,652 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:50,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 9] total 18 [2025-03-03 14:35:50,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188826400] [2025-03-03 14:35:50,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:50,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-03-03 14:35:50,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:50,653 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-03-03 14:35:50,654 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=256, Unknown=0, NotChecked=0, Total=306 [2025-03-03 14:35:50,654 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-03 14:35:50,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:50,769 INFO L93 Difference]: Finished difference Result 25 states and 26 transitions. [2025-03-03 14:35:50,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-03-03 14:35:50,769 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 22 [2025-03-03 14:35:50,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:50,770 INFO L225 Difference]: With dead ends: 25 [2025-03-03 14:35:50,770 INFO L226 Difference]: Without dead ends: 21 [2025-03-03 14:35:50,770 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=99, Invalid=407, Unknown=0, NotChecked=0, Total=506 [2025-03-03 14:35:50,771 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:50,771 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 82 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:50,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2025-03-03 14:35:50,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2025-03-03 14:35:50,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 14 states have (on average 1.0714285714285714) internal successors, (15), 15 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (5), 4 states have call predecessors, (5), 2 states have call successors, (5) [2025-03-03 14:35:50,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 22 transitions. [2025-03-03 14:35:50,774 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 22 transitions. Word has length 22 [2025-03-03 14:35:50,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:50,774 INFO L471 AbstractCegarLoop]: Abstraction has 21 states and 22 transitions. [2025-03-03 14:35:50,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 16 states have (on average 1.9375) internal successors, (31), 15 states have internal predecessors, (31), 6 states have call successors, (7), 1 states have call predecessors, (7), 6 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-03-03 14:35:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 22 transitions. [2025-03-03 14:35:50,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-03-03 14:35:50,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:50,775 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:50,781 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-03 14:35:50,979 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,SelfDestructingSolverStorable2 [2025-03-03 14:35:50,979 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:50,979 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:50,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1224835100, now seen corresponding path program 3 times [2025-03-03 14:35:50,979 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:50,979 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733994633] [2025-03-03 14:35:50,979 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:50,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:50,983 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-03 14:35:50,992 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:35:50,992 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:35:50,992 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:51,120 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-03 14:35:51,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733994633] [2025-03-03 14:35:51,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1733994633] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:51,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043621333] [2025-03-03 14:35:51,120 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:35:51,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:51,120 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:51,123 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-03 14:35:51,125 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-03 14:35:51,145 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 28 statements into 4 equivalence classes. [2025-03-03 14:35:51,154 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 28 of 28 statements. [2025-03-03 14:35:51,155 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-03-03 14:35:51,155 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:51,155 INFO L256 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-03-03 14:35:51,156 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:51,264 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:35:51,264 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:51,598 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-03-03 14:35:51,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043621333] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:51,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:51,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 28 [2025-03-03 14:35:51,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788742794] [2025-03-03 14:35:51,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:51,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-03 14:35:51,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:51,600 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-03 14:35:51,600 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=105, Invalid=651, Unknown=0, NotChecked=0, Total=756 [2025-03-03 14:35:51,600 INFO L87 Difference]: Start difference. First operand 21 states and 22 transitions. Second operand has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 20 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:35:51,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:51,935 INFO L93 Difference]: Finished difference Result 39 states and 43 transitions. [2025-03-03 14:35:51,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:35:51,936 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 20 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) Word has length 28 [2025-03-03 14:35:51,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:51,936 INFO L225 Difference]: With dead ends: 39 [2025-03-03 14:35:51,936 INFO L226 Difference]: Without dead ends: 33 [2025-03-03 14:35:51,937 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 317 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=291, Invalid=1601, Unknown=0, NotChecked=0, Total=1892 [2025-03-03 14:35:51,938 INFO L435 NwaCegarLoop]: 9 mSDtfsCounter, 45 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:51,938 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 89 Invalid, 133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 110 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:51,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-03-03 14:35:51,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-03-03 14:35:51,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 23 states have internal predecessors, (23), 2 states have call successors, (2), 1 states have call predecessors, (2), 8 states have return successors, (9), 8 states have call predecessors, (9), 2 states have call successors, (9) [2025-03-03 14:35:51,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 34 transitions. [2025-03-03 14:35:51,942 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 34 transitions. Word has length 28 [2025-03-03 14:35:51,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:51,942 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 34 transitions. [2025-03-03 14:35:51,942 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 1.5185185185185186) internal successors, (41), 20 states have internal predecessors, (41), 4 states have call successors, (5), 1 states have call predecessors, (5), 12 states have return successors, (12), 12 states have call predecessors, (12), 4 states have call successors, (12) [2025-03-03 14:35:51,942 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 34 transitions. [2025-03-03 14:35:51,943 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-03 14:35:51,943 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:51,943 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:51,949 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-03 14:35:52,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:52,144 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:52,144 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:52,144 INFO L85 PathProgramCache]: Analyzing trace with hash 854543964, now seen corresponding path program 4 times [2025-03-03 14:35:52,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:52,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993425652] [2025-03-03 14:35:52,145 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:52,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:52,149 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-03 14:35:52,158 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:35:52,158 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:35:52,158 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:52,363 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 11 proven. 90 refuted. 0 times theorem prover too weak. 53 trivial. 0 not checked. [2025-03-03 14:35:52,363 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993425652] [2025-03-03 14:35:52,363 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993425652] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:52,363 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736424629] [2025-03-03 14:35:52,363 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:35:52,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:52,364 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:52,365 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-03 14:35:52,367 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-03 14:35:52,401 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 52 statements into 2 equivalence classes. [2025-03-03 14:35:52,414 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 52 of 52 statements. [2025-03-03 14:35:52,415 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:35:52,415 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:52,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 141 conjuncts, 18 conjuncts are in the unsatisfiable core [2025-03-03 14:35:52,418 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 77 refuted. 0 times theorem prover too weak. 77 trivial. 0 not checked. [2025-03-03 14:35:52,506 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:54,236 INFO L134 CoverageAnalysis]: Checked inductivity of 154 backedges. 0 proven. 126 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2025-03-03 14:35:54,237 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736424629] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:54,237 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:54,237 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 19] total 26 [2025-03-03 14:35:54,237 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1453044460] [2025-03-03 14:35:54,237 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:54,238 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2025-03-03 14:35:54,238 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:54,238 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2025-03-03 14:35:54,239 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=160, Invalid=490, Unknown=0, NotChecked=0, Total=650 [2025-03-03 14:35:54,239 INFO L87 Difference]: Start difference. First operand 33 states and 34 transitions. Second operand has 26 states, 23 states have (on average 2.130434782608696) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) [2025-03-03 14:35:54,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:54,378 INFO L93 Difference]: Finished difference Result 52 states and 65 transitions. [2025-03-03 14:35:54,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-03-03 14:35:54,379 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.130434782608696) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) Word has length 52 [2025-03-03 14:35:54,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:54,380 INFO L225 Difference]: With dead ends: 52 [2025-03-03 14:35:54,380 INFO L226 Difference]: Without dead ends: 48 [2025-03-03 14:35:54,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 89 SyntacticMatches, 8 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 392 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=380, Invalid=880, Unknown=0, NotChecked=0, Total=1260 [2025-03-03 14:35:54,381 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 70 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:54,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 103 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:54,382 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2025-03-03 14:35:54,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2025-03-03 14:35:54,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.0666666666666667) internal successors, (32), 31 states have internal predecessors, (32), 3 states have call successors, (3), 2 states have call predecessors, (3), 11 states have return successors, (12), 11 states have call predecessors, (12), 3 states have call successors, (12) [2025-03-03 14:35:54,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 47 transitions. [2025-03-03 14:35:54,387 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 47 transitions. Word has length 52 [2025-03-03 14:35:54,387 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:54,387 INFO L471 AbstractCegarLoop]: Abstraction has 45 states and 47 transitions. [2025-03-03 14:35:54,387 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.130434782608696) internal successors, (49), 26 states have internal predecessors, (49), 13 states have call successors, (13), 1 states have call predecessors, (13), 10 states have return successors, (19), 10 states have call predecessors, (19), 13 states have call successors, (19) [2025-03-03 14:35:54,387 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 47 transitions. [2025-03-03 14:35:54,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-03-03 14:35:54,388 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:54,388 INFO L218 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:54,394 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-03 14:35:54,593 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:54,593 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:54,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:54,593 INFO L85 PathProgramCache]: Analyzing trace with hash 1425680307, now seen corresponding path program 5 times [2025-03-03 14:35:54,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:54,594 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-03-03 14:35:54,594 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:54,594 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:54,598 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 11 equivalence classes. [2025-03-03 14:35:54,620 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:35:54,621 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:35:54,621 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:54,920 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 14:35:54,920 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:54,920 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719165338] [2025-03-03 14:35:54,921 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719165338] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:54,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1229907047] [2025-03-03 14:35:54,921 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:35:54,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:54,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:54,922 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-03 14:35:54,923 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-03 14:35:54,964 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 70 statements into 11 equivalence classes. [2025-03-03 14:35:54,981 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) and asserted 70 of 70 statements. [2025-03-03 14:35:54,981 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 11 check-sat command(s) [2025-03-03 14:35:54,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:54,982 INFO L256 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 24 conjuncts are in the unsatisfiable core [2025-03-03 14:35:54,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:35:55,188 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 155 refuted. 0 times theorem prover too weak. 155 trivial. 0 not checked. [2025-03-03 14:35:55,188 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:35:58,931 INFO L134 CoverageAnalysis]: Checked inductivity of 310 backedges. 0 proven. 255 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2025-03-03 14:35:58,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1229907047] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:35:58,931 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:35:58,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 15, 25] total 50 [2025-03-03 14:35:58,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397701359] [2025-03-03 14:35:58,931 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:35:58,932 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-03 14:35:58,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:35:58,932 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-03 14:35:58,933 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=2120, Unknown=0, NotChecked=0, Total=2450 [2025-03-03 14:35:58,933 INFO L87 Difference]: Start difference. First operand 45 states and 47 transitions. Second operand has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 14 states have call successors, (15), 1 states have call predecessors, (15), 22 states have return successors, (33), 22 states have call predecessors, (33), 14 states have call successors, (33) [2025-03-03 14:35:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:35:59,309 INFO L93 Difference]: Finished difference Result 58 states and 61 transitions. [2025-03-03 14:35:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-03-03 14:35:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 14 states have call successors, (15), 1 states have call predecessors, (15), 22 states have return successors, (33), 22 states have call predecessors, (33), 14 states have call successors, (33) Word has length 70 [2025-03-03 14:35:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:35:59,311 INFO L225 Difference]: With dead ends: 58 [2025-03-03 14:35:59,311 INFO L226 Difference]: Without dead ends: 51 [2025-03-03 14:35:59,312 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 104 SyntacticMatches, 11 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1319 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=955, Invalid=4015, Unknown=0, NotChecked=0, Total=4970 [2025-03-03 14:35:59,312 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 67 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:35:59,312 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [80 Valid, 149 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:35:59,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-03 14:35:59,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 48. [2025-03-03 14:35:59,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 32 states have (on average 1.0625) internal successors, (34), 33 states have internal predecessors, (34), 3 states have call successors, (3), 2 states have call predecessors, (3), 12 states have return successors, (13), 12 states have call predecessors, (13), 3 states have call successors, (13) [2025-03-03 14:35:59,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 50 transitions. [2025-03-03 14:35:59,319 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 50 transitions. Word has length 70 [2025-03-03 14:35:59,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:35:59,319 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 50 transitions. [2025-03-03 14:35:59,320 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 48 states have (on average 1.6458333333333333) internal successors, (79), 39 states have internal predecessors, (79), 14 states have call successors, (15), 1 states have call predecessors, (15), 22 states have return successors, (33), 22 states have call predecessors, (33), 14 states have call successors, (33) [2025-03-03 14:35:59,320 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 50 transitions. [2025-03-03 14:35:59,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2025-03-03 14:35:59,320 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:35:59,321 INFO L218 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:35:59,326 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-03 14:35:59,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:59,521 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:35:59,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:35:59,522 INFO L85 PathProgramCache]: Analyzing trace with hash 1101675676, now seen corresponding path program 6 times [2025-03-03 14:35:59,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:35:59,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550575003] [2025-03-03 14:35:59,522 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:59,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:35:59,528 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 76 statements into 12 equivalence classes. [2025-03-03 14:35:59,541 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:35:59,542 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-03 14:35:59,542 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:59,885 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 14:35:59,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:35:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550575003] [2025-03-03 14:35:59,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550575003] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:35:59,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442808593] [2025-03-03 14:35:59,885 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:35:59,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:35:59,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:35:59,887 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-03 14:35:59,889 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-03 14:35:59,979 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 76 statements into 12 equivalence classes. [2025-03-03 14:35:59,997 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) and asserted 76 of 76 statements. [2025-03-03 14:35:59,997 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 12 check-sat command(s) [2025-03-03 14:35:59,997 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:35:59,998 INFO L256 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-03-03 14:36:00,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:00,224 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 187 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2025-03-03 14:36:00,224 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:04,774 INFO L134 CoverageAnalysis]: Checked inductivity of 374 backedges. 0 proven. 308 refuted. 0 times theorem prover too weak. 66 trivial. 0 not checked. [2025-03-03 14:36:04,774 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442808593] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:04,774 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:04,774 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 16, 27] total 54 [2025-03-03 14:36:04,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [470350105] [2025-03-03 14:36:04,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:04,775 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-03-03 14:36:04,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:04,776 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-03-03 14:36:04,776 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=2479, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:36:04,776 INFO L87 Difference]: Start difference. First operand 48 states and 50 transitions. Second operand has 54 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 42 states have internal predecessors, (85), 15 states have call successors, (16), 1 states have call predecessors, (16), 24 states have return successors, (36), 24 states have call predecessors, (36), 15 states have call successors, (36) [2025-03-03 14:36:05,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:05,209 INFO L93 Difference]: Finished difference Result 61 states and 64 transitions. [2025-03-03 14:36:05,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-03 14:36:05,210 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 42 states have internal predecessors, (85), 15 states have call successors, (16), 1 states have call predecessors, (16), 24 states have return successors, (36), 24 states have call predecessors, (36), 15 states have call successors, (36) Word has length 76 [2025-03-03 14:36:05,210 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:05,210 INFO L225 Difference]: With dead ends: 61 [2025-03-03 14:36:05,210 INFO L226 Difference]: Without dead ends: 54 [2025-03-03 14:36:05,212 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1578 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=1125, Invalid=4727, Unknown=0, NotChecked=0, Total=5852 [2025-03-03 14:36:05,212 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 64 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:05,212 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [78 Valid, 151 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:05,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-03-03 14:36:05,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 51. [2025-03-03 14:36:05,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 34 states have (on average 1.0588235294117647) internal successors, (36), 35 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 13 states have return successors, (14), 13 states have call predecessors, (14), 3 states have call successors, (14) [2025-03-03 14:36:05,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 53 transitions. [2025-03-03 14:36:05,224 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 53 transitions. Word has length 76 [2025-03-03 14:36:05,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:05,224 INFO L471 AbstractCegarLoop]: Abstraction has 51 states and 53 transitions. [2025-03-03 14:36:05,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 1.6346153846153846) internal successors, (85), 42 states have internal predecessors, (85), 15 states have call successors, (16), 1 states have call predecessors, (16), 24 states have return successors, (36), 24 states have call predecessors, (36), 15 states have call successors, (36) [2025-03-03 14:36:05,225 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 53 transitions. [2025-03-03 14:36:05,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2025-03-03 14:36:05,226 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:05,226 INFO L218 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:05,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-03 14:36:05,426 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:05,427 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:05,427 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:05,427 INFO L85 PathProgramCache]: Analyzing trace with hash -121729645, now seen corresponding path program 7 times [2025-03-03 14:36:05,427 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:05,427 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-03-03 14:36:05,427 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:36:05,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:05,433 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:36:05,444 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:36:05,445 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:36:05,445 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:05,684 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-03 14:36:05,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1466295372] [2025-03-03 14:36:05,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1466295372] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:05,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [24360050] [2025-03-03 14:36:05,684 INFO L95 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2025-03-03 14:36:05,685 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:05,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:05,687 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-03 14:36:05,688 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-03 14:36:05,841 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 82 statements into 1 equivalence classes. [2025-03-03 14:36:05,858 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 82 of 82 statements. [2025-03-03 14:36:05,858 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:36:05,858 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:05,859 INFO L256 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 28 conjuncts are in the unsatisfiable core [2025-03-03 14:36:05,860 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:05,922 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 222 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2025-03-03 14:36:05,923 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:11,604 INFO L134 CoverageAnalysis]: Checked inductivity of 444 backedges. 0 proven. 366 refuted. 0 times theorem prover too weak. 78 trivial. 0 not checked. [2025-03-03 14:36:11,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [24360050] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:11,604 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:11,604 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 29] total 31 [2025-03-03 14:36:11,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1449076249] [2025-03-03 14:36:11,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:11,605 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2025-03-03 14:36:11,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:11,605 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2025-03-03 14:36:11,605 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=242, Invalid=688, Unknown=0, NotChecked=0, Total=930 [2025-03-03 14:36:11,605 INFO L87 Difference]: Start difference. First operand 51 states and 53 transitions. Second operand has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2025-03-03 14:36:11,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:11,741 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-03 14:36:11,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2025-03-03 14:36:11,741 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) Word has length 82 [2025-03-03 14:36:11,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:11,743 INFO L225 Difference]: With dead ends: 64 [2025-03-03 14:36:11,743 INFO L226 Difference]: Without dead ends: 57 [2025-03-03 14:36:11,743 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 149 SyntacticMatches, 13 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=578, Invalid=1228, Unknown=0, NotChecked=0, Total=1806 [2025-03-03 14:36:11,744 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 51 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:11,744 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 115 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:11,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2025-03-03 14:36:11,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 54. [2025-03-03 14:36:11,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 36 states have (on average 1.0555555555555556) internal successors, (38), 37 states have internal predecessors, (38), 3 states have call successors, (3), 2 states have call predecessors, (3), 14 states have return successors, (15), 14 states have call predecessors, (15), 3 states have call successors, (15) [2025-03-03 14:36:11,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 56 transitions. [2025-03-03 14:36:11,749 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 56 transitions. Word has length 82 [2025-03-03 14:36:11,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:11,749 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 56 transitions. [2025-03-03 14:36:11,750 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 29 states have (on average 2.0689655172413794) internal successors, (60), 31 states have internal predecessors, (60), 15 states have call successors, (15), 1 states have call predecessors, (15), 13 states have return successors, (26), 13 states have call predecessors, (26), 15 states have call successors, (26) [2025-03-03 14:36:11,750 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 56 transitions. [2025-03-03 14:36:11,750 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2025-03-03 14:36:11,750 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:11,750 INFO L218 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:11,757 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-03 14:36:11,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:11,952 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:11,952 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:11,952 INFO L85 PathProgramCache]: Analyzing trace with hash -977952836, now seen corresponding path program 8 times [2025-03-03 14:36:11,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:11,953 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [957468919] [2025-03-03 14:36:11,953 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:36:11,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:11,959 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-03 14:36:11,966 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:36:11,967 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:36:11,967 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:12,219 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 273 refuted. 0 times theorem prover too weak. 247 trivial. 0 not checked. [2025-03-03 14:36:12,219 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [957468919] [2025-03-03 14:36:12,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [957468919] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:12,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1639475927] [2025-03-03 14:36:12,219 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-03 14:36:12,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:12,220 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:12,221 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-03 14:36:12,223 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-03 14:36:12,448 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 88 statements into 2 equivalence classes. [2025-03-03 14:36:12,463 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 88 of 88 statements. [2025-03-03 14:36:12,463 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-03 14:36:12,463 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:12,464 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-03 14:36:12,465 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:12,529 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 260 refuted. 0 times theorem prover too weak. 260 trivial. 0 not checked. [2025-03-03 14:36:12,529 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:19,588 INFO L134 CoverageAnalysis]: Checked inductivity of 520 backedges. 0 proven. 429 refuted. 0 times theorem prover too weak. 91 trivial. 0 not checked. [2025-03-03 14:36:19,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1639475927] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:19,589 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:19,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 31] total 35 [2025-03-03 14:36:19,589 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936995253] [2025-03-03 14:36:19,589 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:19,589 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-03 14:36:19,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:19,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-03 14:36:19,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=321, Invalid=869, Unknown=0, NotChecked=0, Total=1190 [2025-03-03 14:36:19,590 INFO L87 Difference]: Start difference. First operand 54 states and 56 transitions. Second operand has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 35 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) [2025-03-03 14:36:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:19,827 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-03 14:36:19,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-03-03 14:36:19,828 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 35 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) Word has length 88 [2025-03-03 14:36:19,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:19,828 INFO L225 Difference]: With dead ends: 67 [2025-03-03 14:36:19,829 INFO L226 Difference]: Without dead ends: 60 [2025-03-03 14:36:19,829 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 219 GetRequests, 158 SyntacticMatches, 14 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 720 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=755, Invalid=1597, Unknown=0, NotChecked=0, Total=2352 [2025-03-03 14:36:19,830 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 179 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 96 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 180 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 96 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:19,830 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [180 Valid, 126 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [96 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:19,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-03-03 14:36:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 57. [2025-03-03 14:36:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 38 states have (on average 1.0526315789473684) internal successors, (40), 39 states have internal predecessors, (40), 3 states have call successors, (3), 2 states have call predecessors, (3), 15 states have return successors, (16), 15 states have call predecessors, (16), 3 states have call successors, (16) [2025-03-03 14:36:19,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 59 transitions. [2025-03-03 14:36:19,834 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 59 transitions. Word has length 88 [2025-03-03 14:36:19,834 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:19,835 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 59 transitions. [2025-03-03 14:36:19,835 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 2.0303030303030303) internal successors, (67), 35 states have internal predecessors, (67), 16 states have call successors, (16), 1 states have call predecessors, (16), 15 states have return successors, (29), 14 states have call predecessors, (29), 16 states have call successors, (29) [2025-03-03 14:36:19,835 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 59 transitions. [2025-03-03 14:36:19,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2025-03-03 14:36:19,836 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:19,836 INFO L218 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:19,842 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-03 14:36:20,036 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,SelfDestructingSolverStorable8 [2025-03-03 14:36:20,036 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:20,037 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:20,037 INFO L85 PathProgramCache]: Analyzing trace with hash -994104461, now seen corresponding path program 9 times [2025-03-03 14:36:20,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:20,037 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-03 14:36:20,037 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:36:20,037 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:20,045 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 15 equivalence classes. [2025-03-03 14:36:20,056 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:36:20,056 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 14:36:20,056 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:20,326 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 40 proven. 361 refuted. 0 times theorem prover too weak. 201 trivial. 0 not checked. [2025-03-03 14:36:20,326 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:20,326 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464680206] [2025-03-03 14:36:20,326 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464680206] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:20,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816912304] [2025-03-03 14:36:20,327 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-03-03 14:36:20,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:20,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:20,328 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:36:20,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-03 14:36:20,618 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 94 statements into 15 equivalence classes. [2025-03-03 14:36:20,637 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) and asserted 94 of 94 statements. [2025-03-03 14:36:20,637 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2025-03-03 14:36:20,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:20,638 INFO L256 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 32 conjuncts are in the unsatisfiable core [2025-03-03 14:36:20,640 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:20,709 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 301 refuted. 0 times theorem prover too weak. 301 trivial. 0 not checked. [2025-03-03 14:36:20,709 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:29,555 INFO L134 CoverageAnalysis]: Checked inductivity of 602 backedges. 0 proven. 497 refuted. 0 times theorem prover too weak. 105 trivial. 0 not checked. [2025-03-03 14:36:29,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1816912304] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:29,555 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:29,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 19, 33] total 40 [2025-03-03 14:36:29,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1420455584] [2025-03-03 14:36:29,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:29,556 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-03 14:36:29,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:29,557 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-03 14:36:29,557 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=425, Invalid=1135, Unknown=0, NotChecked=0, Total=1560 [2025-03-03 14:36:29,557 INFO L87 Difference]: Start difference. First operand 57 states and 59 transitions. Second operand has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 40 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) [2025-03-03 14:36:29,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:29,738 INFO L93 Difference]: Finished difference Result 70 states and 73 transitions. [2025-03-03 14:36:29,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-03-03 14:36:29,739 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 40 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) Word has length 94 [2025-03-03 14:36:29,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:29,740 INFO L225 Difference]: With dead ends: 70 [2025-03-03 14:36:29,741 INFO L226 Difference]: Without dead ends: 63 [2025-03-03 14:36:29,742 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 233 GetRequests, 166 SyntacticMatches, 15 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=916, Invalid=1946, Unknown=0, NotChecked=0, Total=2862 [2025-03-03 14:36:29,742 INFO L435 NwaCegarLoop]: 11 mSDtfsCounter, 119 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:29,743 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 142 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:29,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-03 14:36:29,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 60. [2025-03-03 14:36:29,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 40 states have (on average 1.05) internal successors, (42), 41 states have internal predecessors, (42), 3 states have call successors, (3), 2 states have call predecessors, (3), 16 states have return successors, (17), 16 states have call predecessors, (17), 3 states have call successors, (17) [2025-03-03 14:36:29,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 62 transitions. [2025-03-03 14:36:29,748 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 62 transitions. Word has length 94 [2025-03-03 14:36:29,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:29,748 INFO L471 AbstractCegarLoop]: Abstraction has 60 states and 62 transitions. [2025-03-03 14:36:29,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 2.026315789473684) internal successors, (77), 40 states have internal predecessors, (77), 19 states have call successors, (19), 1 states have call predecessors, (19), 17 states have return successors, (35), 16 states have call predecessors, (35), 19 states have call successors, (35) [2025-03-03 14:36:29,749 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 62 transitions. [2025-03-03 14:36:29,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2025-03-03 14:36:29,749 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:29,749 INFO L218 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:29,757 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-03-03 14:36:29,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-03 14:36:29,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:29,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:29,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1090669276, now seen corresponding path program 10 times [2025-03-03 14:36:29,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:29,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2007748185] [2025-03-03 14:36:29,950 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:36:29,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:29,967 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-03 14:36:29,972 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:36:29,972 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:36:29,972 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 27 proven. 374 refuted. 0 times theorem prover too weak. 289 trivial. 0 not checked. [2025-03-03 14:36:30,220 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2007748185] [2025-03-03 14:36:30,221 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2007748185] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:30,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [864784557] [2025-03-03 14:36:30,221 INFO L95 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2025-03-03 14:36:30,221 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:30,221 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:30,222 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:36:30,223 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-03-03 14:36:30,612 INFO L108 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST partitioned 100 statements into 2 equivalence classes. [2025-03-03 14:36:30,629 INFO L111 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) and asserted 100 of 100 statements. [2025-03-03 14:36:30,629 INFO L114 AnnotateAndAsserter]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 2 check-sat command(s) [2025-03-03 14:36:30,629 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:30,630 INFO L256 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 34 conjuncts are in the unsatisfiable core [2025-03-03 14:36:30,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:30,731 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 345 refuted. 0 times theorem prover too weak. 345 trivial. 0 not checked. [2025-03-03 14:36:30,732 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:36:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 690 backedges. 0 proven. 570 refuted. 0 times theorem prover too weak. 120 trivial. 0 not checked. [2025-03-03 14:36:41,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [864784557] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:36:41,649 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:36:41,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 35] total 42 [2025-03-03 14:36:41,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1239803243] [2025-03-03 14:36:41,649 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:36:41,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-03-03 14:36:41,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:36:41,650 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-03-03 14:36:41,650 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=424, Invalid=1298, Unknown=0, NotChecked=0, Total=1722 [2025-03-03 14:36:41,650 INFO L87 Difference]: Start difference. First operand 60 states and 62 transitions. Second operand has 42 states, 39 states have (on average 2.076923076923077) internal successors, (81), 42 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (35), 18 states have call predecessors, (35), 21 states have call successors, (35) [2025-03-03 14:36:41,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:36:41,897 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2025-03-03 14:36:41,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-03 14:36:41,898 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.076923076923077) internal successors, (81), 42 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (35), 18 states have call predecessors, (35), 21 states have call successors, (35) Word has length 100 [2025-03-03 14:36:41,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:36:41,898 INFO L225 Difference]: With dead ends: 82 [2025-03-03 14:36:41,898 INFO L226 Difference]: Without dead ends: 72 [2025-03-03 14:36:41,899 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 177 SyntacticMatches, 16 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1288 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1108, Invalid=2432, Unknown=0, NotChecked=0, Total=3540 [2025-03-03 14:36:41,900 INFO L435 NwaCegarLoop]: 10 mSDtfsCounter, 178 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:36:41,900 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 148 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:36:41,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-03 14:36:41,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-03 14:36:41,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 46 states have (on average 1.0434782608695652) internal successors, (48), 47 states have internal predecessors, (48), 3 states have call successors, (3), 2 states have call predecessors, (3), 19 states have return successors, (20), 19 states have call predecessors, (20), 3 states have call successors, (20) [2025-03-03 14:36:41,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 71 transitions. [2025-03-03 14:36:41,909 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 71 transitions. Word has length 100 [2025-03-03 14:36:41,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:36:41,910 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 71 transitions. [2025-03-03 14:36:41,910 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.076923076923077) internal successors, (81), 42 states have internal predecessors, (81), 21 states have call successors, (21), 1 states have call predecessors, (21), 18 states have return successors, (35), 18 states have call predecessors, (35), 21 states have call successors, (35) [2025-03-03 14:36:41,910 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 71 transitions. [2025-03-03 14:36:41,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-03 14:36:41,911 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:36:41,912 INFO L218 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:36:41,920 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-03-03 14:36:42,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-03-03 14:36:42,112 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:36:42,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:36:42,113 INFO L85 PathProgramCache]: Analyzing trace with hash 67964723, now seen corresponding path program 11 times [2025-03-03 14:36:42,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:36:42,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617622197] [2025-03-03 14:36:42,113 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:36:42,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:36:42,123 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 118 statements into 19 equivalence classes. [2025-03-03 14:36:42,143 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:36:42,143 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-03-03 14:36:42,143 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:42,688 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 14:36:42,688 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-03 14:36:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617622197] [2025-03-03 14:36:42,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617622197] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-03 14:36:42,688 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582286815] [2025-03-03 14:36:42,688 INFO L95 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2025-03-03 14:36:42,689 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-03 14:36:42,689 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-03 14:36:42,690 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-03 14:36:42,691 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-03-03 14:36:43,209 INFO L108 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 partitioned 118 statements into 19 equivalence classes. [2025-03-03 14:36:43,237 INFO L111 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) and asserted 118 of 118 statements. [2025-03-03 14:36:43,237 INFO L114 AnnotateAndAsserter]: Assert order INSIDE_LOOP_FIRST1 issued 19 check-sat command(s) [2025-03-03 14:36:43,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-03 14:36:43,238 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 40 conjuncts are in the unsatisfiable core [2025-03-03 14:36:43,240 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-03 14:36:43,307 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 14:36:43,307 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-03 14:37:01,168 INFO L134 CoverageAnalysis]: Checked inductivity of 990 backedges. 0 proven. 495 refuted. 0 times theorem prover too weak. 495 trivial. 0 not checked. [2025-03-03 14:37:01,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582286815] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-03 14:37:01,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-03 14:37:01,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [41, 41, 41] total 55 [2025-03-03 14:37:01,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [820145651] [2025-03-03 14:37:01,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-03 14:37:01,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-03-03 14:37:01,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-03 14:37:01,171 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-03-03 14:37:01,171 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=685, Invalid=2285, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 14:37:01,171 INFO L87 Difference]: Start difference. First operand 69 states and 71 transitions. Second operand has 55 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 29 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 26 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 14:37:01,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-03 14:37:01,248 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2025-03-03 14:37:01,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 55 states. [2025-03-03 14:37:01,248 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 29 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 26 states have call predecessors, (26), 1 states have call successors, (26) Word has length 118 [2025-03-03 14:37:01,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-03 14:37:01,249 INFO L225 Difference]: With dead ends: 120 [2025-03-03 14:37:01,249 INFO L226 Difference]: Without dead ends: 93 [2025-03-03 14:37:01,250 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 275 GetRequests, 197 SyntacticMatches, 25 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1623 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=685, Invalid=2285, Unknown=0, NotChecked=0, Total=2970 [2025-03-03 14:37:01,250 INFO L435 NwaCegarLoop]: 12 mSDtfsCounter, 0 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 162 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-03 14:37:01,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 162 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-03 14:37:01,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-03-03 14:37:01,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 90. [2025-03-03 14:37:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.0333333333333334) internal successors, (62), 61 states have internal predecessors, (62), 3 states have call successors, (3), 2 states have call predecessors, (3), 26 states have return successors, (27), 26 states have call predecessors, (27), 3 states have call successors, (27) [2025-03-03 14:37:01,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 92 transitions. [2025-03-03 14:37:01,257 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 92 transitions. Word has length 118 [2025-03-03 14:37:01,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-03 14:37:01,257 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 92 transitions. [2025-03-03 14:37:01,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 55 states have (on average 1.0909090909090908) internal successors, (60), 29 states have internal predecessors, (60), 1 states have call successors, (2), 1 states have call predecessors, (2), 25 states have return successors, (26), 26 states have call predecessors, (26), 1 states have call successors, (26) [2025-03-03 14:37:01,257 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 92 transitions. [2025-03-03 14:37:01,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 161 [2025-03-03 14:37:01,258 INFO L210 NwaCegarLoop]: Found error trace [2025-03-03 14:37:01,258 INFO L218 NwaCegarLoop]: trace histogram [26, 26, 25, 25, 25, 25, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-03 14:37:01,267 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-03-03 14:37:01,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-03-03 14:37:01,459 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-03 14:37:01,459 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-03 14:37:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1992107396, now seen corresponding path program 12 times [2025-03-03 14:37:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-03 14:37:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098956423] [2025-03-03 14:37:01,459 INFO L95 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2025-03-03 14:37:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-03 14:37:01,485 INFO L108 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE partitioned 160 statements into 26 equivalence classes. [2025-03-03 14:37:01,508 INFO L111 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:37:01,508 INFO L114 AnnotateAndAsserter]: Assert order MIX_INSIDE_OUTSIDE issued 26 check-sat command(s) [2025-03-03 14:37:01,508 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:37:01,508 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-03 14:37:01,511 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 160 statements into 1 equivalence classes. [2025-03-03 14:37:01,526 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 160 of 160 statements. [2025-03-03 14:37:01,526 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-03 14:37:01,526 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-03 14:37:01,562 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-03 14:37:01,562 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-03 14:37:01,563 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-03-03 14:37:01,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-03 14:37:01,566 INFO L422 BasicCegarLoop]: Path program histogram: [12, 1] [2025-03-03 14:37:01,601 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-03 14:37:01,603 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.03 02:37:01 BoogieIcfgContainer [2025-03-03 14:37:01,604 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-03 14:37:01,604 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-03 14:37:01,604 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-03 14:37:01,605 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-03 14:37:01,605 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 03.03 02:35:49" (3/4) ... [2025-03-03 14:37:01,606 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-03 14:37:01,655 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 80. [2025-03-03 14:37:01,717 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-03 14:37:01,718 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-03 14:37:01,718 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-03 14:37:01,719 INFO L158 Benchmark]: Toolchain (without parser) took 72887.99ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 110.8MB in the beginning and 365.9MB in the end (delta: -255.1MB). Peak memory consumption was 81.0MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,719 INFO L158 Benchmark]: CDTParser took 0.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:37:01,719 INFO L158 Benchmark]: CACSL2BoogieTranslator took 129.70ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 100.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,719 INFO L158 Benchmark]: Boogie Procedure Inliner took 17.61ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-03 14:37:01,719 INFO L158 Benchmark]: Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.3MB in the end (delta: 812.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,720 INFO L158 Benchmark]: IcfgBuilder took 170.88ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 88.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,720 INFO L158 Benchmark]: TraceAbstraction took 72431.54ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 87.5MB in the beginning and 374.3MB in the end (delta: -286.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,720 INFO L158 Benchmark]: Witness Printer took 113.66ms. Allocated memory is still 478.2MB. Free memory was 374.3MB in the beginning and 365.9MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-03 14:37:01,721 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.25ms. Allocated memory is still 201.3MB. Free memory is still 123.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 129.70ms. Allocated memory is still 142.6MB. Free memory was 110.8MB in the beginning and 100.2MB in the end (delta: 10.6MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 17.61ms. Allocated memory is still 142.6MB. Free memory was 100.2MB in the beginning and 99.1MB in the end (delta: 1.1MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 20.05ms. Allocated memory is still 142.6MB. Free memory was 99.1MB in the beginning and 98.3MB in the end (delta: 812.2kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 170.88ms. Allocated memory is still 142.6MB. Free memory was 98.3MB in the beginning and 88.0MB in the end (delta: 10.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 72431.54ms. Allocated memory was 142.6MB in the beginning and 478.2MB in the end (delta: 335.5MB). Free memory was 87.5MB in the beginning and 374.3MB in the end (delta: -286.8MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * Witness Printer took 113.66ms. Allocated memory is still 478.2MB. Free memory was 374.3MB in the beginning and 365.9MB in the end (delta: 8.4MB). 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 - CounterExampleResult [Line: 15]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L12] int input = 25; VAL [input=25] [L13] CALL, EXPR id(input) VAL [\old(x)=25] [L7] COND FALSE !(x==0) VAL [\old(x)=25, x=25] [L8] CALL, EXPR id(x-1) VAL [\old(x)=24] [L7] COND FALSE !(x==0) VAL [\old(x)=24, x=24] [L8] CALL, EXPR id(x-1) VAL [\old(x)=23] [L7] COND FALSE !(x==0) VAL [\old(x)=23, x=23] [L8] CALL, EXPR id(x-1) VAL [\old(x)=22] [L7] COND FALSE !(x==0) VAL [\old(x)=22, x=22] [L8] CALL, EXPR id(x-1) VAL [\old(x)=21] [L7] COND FALSE !(x==0) VAL [\old(x)=21, x=21] [L8] CALL, EXPR id(x-1) VAL [\old(x)=20] [L7] COND FALSE !(x==0) VAL [\old(x)=20, x=20] [L8] CALL, EXPR id(x-1) VAL [\old(x)=19] [L7] COND FALSE !(x==0) VAL [\old(x)=19, x=19] [L8] CALL, EXPR id(x-1) VAL [\old(x)=18] [L7] COND FALSE !(x==0) VAL [\old(x)=18, x=18] [L8] CALL, EXPR id(x-1) VAL [\old(x)=17] [L7] COND FALSE !(x==0) VAL [\old(x)=17, x=17] [L8] CALL, EXPR id(x-1) VAL [\old(x)=16] [L7] COND FALSE !(x==0) VAL [\old(x)=16, x=16] [L8] CALL, EXPR id(x-1) VAL [\old(x)=15] [L7] COND FALSE !(x==0) VAL [\old(x)=15, x=15] [L8] CALL, EXPR id(x-1) VAL [\old(x)=14] [L7] COND FALSE !(x==0) VAL [\old(x)=14, x=14] [L8] CALL, EXPR id(x-1) VAL [\old(x)=13] [L7] COND FALSE !(x==0) VAL [\old(x)=13, x=13] [L8] CALL, EXPR id(x-1) VAL [\old(x)=12] [L7] COND FALSE !(x==0) VAL [\old(x)=12, x=12] [L8] CALL, EXPR id(x-1) VAL [\old(x)=11] [L7] COND FALSE !(x==0) VAL [\old(x)=11, x=11] [L8] CALL, EXPR id(x-1) VAL [\old(x)=10] [L7] COND FALSE !(x==0) VAL [\old(x)=10, x=10] [L8] CALL, EXPR id(x-1) VAL [\old(x)=9] [L7] COND FALSE !(x==0) VAL [\old(x)=9, x=9] [L8] CALL, EXPR id(x-1) VAL [\old(x)=8] [L7] COND FALSE !(x==0) VAL [\old(x)=8, x=8] [L8] CALL, EXPR id(x-1) VAL [\old(x)=7] [L7] COND FALSE !(x==0) VAL [\old(x)=7, x=7] [L8] CALL, EXPR id(x-1) VAL [\old(x)=6] [L7] COND FALSE !(x==0) VAL [\old(x)=6, x=6] [L8] CALL, EXPR id(x-1) VAL [\old(x)=5] [L7] COND FALSE !(x==0) VAL [\old(x)=5, x=5] [L8] CALL, EXPR id(x-1) VAL [\old(x)=4] [L7] COND FALSE !(x==0) VAL [\old(x)=4, x=4] [L8] CALL, EXPR id(x-1) VAL [\old(x)=3] [L7] COND FALSE !(x==0) VAL [\old(x)=3, x=3] [L8] CALL, EXPR id(x-1) VAL [\old(x)=2] [L7] COND FALSE !(x==0) VAL [\old(x)=2, x=2] [L8] CALL, EXPR id(x-1) VAL [\old(x)=1] [L7] COND FALSE !(x==0) VAL [\old(x)=1, x=1] [L8] CALL, EXPR id(x-1) VAL [\old(x)=0] [L7] COND TRUE x==0 [L7] return 0; VAL [\old(x)=0, \result=0] [L8] RET, EXPR id(x-1) VAL [\old(x)=1, x=1] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=2, x=2] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=3, x=3] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=4, x=4] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=5, x=5] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=6, x=6] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=7, x=7] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=8, x=8] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=9, x=9] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=10, x=10] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=11, x=11] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=12, x=12] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=13, x=13] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=14, x=14] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=15, x=15] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=16, x=16] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=17, x=17] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=18, x=18] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=19, x=19] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=20, x=20] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=21, x=21] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=22, x=22] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=23, x=23] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=24, x=24] [L8] return id(x-1) + 1; [L8] RET, EXPR id(x-1) VAL [\old(x)=25, x=25] [L8] return id(x-1) + 1; [L13] RET, EXPR id(input) VAL [input=25] [L13] int result = id(input); [L14] COND TRUE result == 25 VAL [input=25] [L15] reach_error() VAL [input=25] - StatisticsResult: Ultimate Automizer benchmark data CFG has 2 procedures, 16 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 72.4s, OverallIterations: 13, TraceHistogramMax: 26, PathProgramHistogramMax: 12, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 901 SdHoareTripleChecker+Valid, 0.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 796 mSDsluCounter, 1352 SdHoareTripleChecker+Invalid, 0.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1222 mSDsCounter, 374 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1017 IncrementalHoareTripleChecker+Invalid, 1391 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 374 mSolverCounterUnsat, 130 mSDtfsCounter, 1017 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1877 GetRequests, 1255 SyntacticMatches, 119 SemanticMatches, 503 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8909 ImplicationChecksByTransitivity, 5.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=90occurred in iteration=12, InterpolantAutomatonStates: 240, 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, 12 MinimizatonAttempts, 24 StatesRemovedByMinimization, 8 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 65.2s InterpolantComputationTime, 1662 NumberOfCodeBlocks, 1662 NumberOfCodeBlocksAsserted, 169 NumberOfCheckSat, 2214 ConstructedInterpolants, 0 QuantifiedInterpolants, 6114 SizeOfPredicates, 85 NumberOfNonLiveVariables, 1957 ConjunctsInSsa, 256 ConjunctsInUnsatCore, 34 InterpolantComputations, 1 PerfectInterpolantSequences, 5067/12396 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 RESULT: Ultimate proved your program to be incorrect! [2025-03-03 14:37:01,754 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 Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE