./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version c00e63dc Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/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 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 --- Real Ultimate output --- This is Ultimate 0.3.0-?-c00e63d-m [2025-02-05 14:29:39,018 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-05 14:29:39,073 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-02-05 14:29:39,080 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-05 14:29:39,081 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-05 14:29:39,099 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-05 14:29:39,100 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-05 14:29:39,100 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-05 14:29:39,100 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-05 14:29:39,100 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-05 14:29:39,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-05 14:29:39,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-05 14:29:39,100 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-05 14:29:39,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Use SBE=true [2025-02-05 14:29:39,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-05 14:29:39,101 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-05 14:29:39,102 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:29:39,102 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-05 14:29:39,102 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-05 14:29:39,102 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-jdk21/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 -> 5dc0e184171498e703ccf08545f4f79d3c1c383c8c0fc13a1f35990befb669a4 [2025-02-05 14:29:39,333 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-05 14:29:39,341 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-05 14:29:39,343 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-05 14:29:39,344 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-05 14:29:39,344 INFO L274 PluginConnector]: CDTParser initialized [2025-02-05 14:29:39,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2025-02-05 14:29:40,544 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1ee8e3d/98f828d08af54ce0aaf0dfa4ca1c2930/FLAG3ac6ada1d [2025-02-05 14:29:40,814 INFO L384 CDTParser]: Found 1 translation units. [2025-02-05 14:29:40,815 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i [2025-02-05 14:29:40,827 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1ee8e3d/98f828d08af54ce0aaf0dfa4ca1c2930/FLAG3ac6ada1d [2025-02-05 14:29:40,841 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/1e1ee8e3d/98f828d08af54ce0aaf0dfa4ca1c2930 [2025-02-05 14:29:40,844 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-05 14:29:40,845 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-05 14:29:40,846 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-05 14:29:40,846 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-05 14:29:40,849 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-05 14:29:40,850 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:29:40" (1/1) ... [2025-02-05 14:29:40,850 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6da76ceb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:40, skipping insertion in model container [2025-02-05 14:29:40,850 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 05.02 02:29:40" (1/1) ... [2025-02-05 14:29:40,874 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-05 14:29:40,978 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2025-02-05 14:29:41,081 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:29:41,091 INFO L200 MainTranslator]: Completed pre-run [2025-02-05 14:29:41,097 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/ldv-regression/rule60_list2.c_1.i[296,309] [2025-02-05 14:29:41,127 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-05 14:29:41,145 INFO L204 MainTranslator]: Completed translation [2025-02-05 14:29:41,145 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41 WrapperNode [2025-02-05 14:29:41,145 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-05 14:29:41,146 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-05 14:29:41,146 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-05 14:29:41,146 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-05 14:29:41,150 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,157 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,174 INFO L138 Inliner]: procedures = 126, calls = 20, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 55 [2025-02-05 14:29:41,174 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-05 14:29:41,175 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-05 14:29:41,176 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-05 14:29:41,176 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-05 14:29:41,180 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,181 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,184 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,194 INFO L175 MemorySlicer]: Split 4 memory accesses to 3 slices as follows [2, 0, 2]. 50 percent of accesses are in the largest equivalence class. The 4 initializations are split as follows [2, 0, 2]. The 0 writes are split as follows [0, 0, 0]. [2025-02-05 14:29:41,194 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,194 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,198 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,198 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,199 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,199 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,202 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-05 14:29:41,203 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-05 14:29:41,203 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-05 14:29:41,203 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-05 14:29:41,203 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (1/1) ... [2025-02-05 14:29:41,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-05 14:29:41,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:41,226 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-05 14:29:41,229 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-05 14:29:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure my_malloc [2025-02-05 14:29:41,246 INFO L138 BoogieDeclarations]: Found implementation of procedure my_malloc [2025-02-05 14:29:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-05 14:29:41,246 INFO L130 BoogieDeclarations]: Found specification of procedure list_add [2025-02-05 14:29:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure list_add [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure __blast_assert [2025-02-05 14:29:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure __blast_assert [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-05 14:29:41,247 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-05 14:29:41,247 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-05 14:29:41,332 INFO L257 CfgBuilder]: Building ICFG [2025-02-05 14:29:41,333 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-05 14:29:41,386 INFO L1309 $ProcedureCfgBuilder]: dead code at ProgramPoint L529: havoc #t~ret8#1.base, #t~ret8#1.offset; [2025-02-05 14:29:41,457 INFO L? ?]: Removed 22 outVars from TransFormulas that were not future-live. [2025-02-05 14:29:41,457 INFO L308 CfgBuilder]: Performing block encoding [2025-02-05 14:29:41,467 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-05 14:29:41,467 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-05 14:29:41,467 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:41 BoogieIcfgContainer [2025-02-05 14:29:41,467 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-05 14:29:41,469 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-05 14:29:41,469 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-05 14:29:41,473 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-05 14:29:41,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 05.02 02:29:40" (1/3) ... [2025-02-05 14:29:41,473 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcabaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:29:41, skipping insertion in model container [2025-02-05 14:29:41,473 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 05.02 02:29:41" (2/3) ... [2025-02-05 14:29:41,474 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bcabaa9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.02 02:29:41, skipping insertion in model container [2025-02-05 14:29:41,474 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:41" (3/3) ... [2025-02-05 14:29:41,474 INFO L128 eAbstractionObserver]: Analyzing ICFG rule60_list2.c_1.i [2025-02-05 14:29:41,485 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-05 14:29:41,486 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG rule60_list2.c_1.i that has 4 procedures, 37 locations, 1 initial locations, 0 loop locations, and 1 error locations. [2025-02-05 14:29:41,531 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-05 14:29:41,540 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;@83fb5b0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-05 14:29:41,540 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-02-05 14:29:41,543 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2025-02-05 14:29:41,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-02-05 14:29:41,547 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:41,547 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:41,547 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:41,552 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:41,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1786922780, now seen corresponding path program 1 times [2025-02-05 14:29:41,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:41,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816912304] [2025-02-05 14:29:41,560 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:41,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:41,624 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-02-05 14:29:41,636 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-02-05 14:29:41,637 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:41,637 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:41,758 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:41,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:41,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816912304] [2025-02-05 14:29:41,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816912304] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:41,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:41,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-05 14:29:41,760 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1677534024] [2025-02-05 14:29:41,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:41,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-05 14:29:41,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:41,777 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-05 14:29:41,777 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-02-05 14:29:41,779 INFO L87 Difference]: Start difference. First operand has 37 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 28 states have internal predecessors, (31), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:29:41,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:41,832 INFO L93 Difference]: Finished difference Result 68 states and 93 transitions. [2025-02-05 14:29:41,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-05 14:29:41,833 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2025-02-05 14:29:41,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:41,837 INFO L225 Difference]: With dead ends: 68 [2025-02-05 14:29:41,837 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 14:29:41,840 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-02-05 14:29:41,841 INFO L435 NwaCegarLoop]: 37 mSDtfsCounter, 7 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:41,842 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 103 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:41,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 14:29:41,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 14:29:41,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.2) internal successors, (24), 21 states have internal predecessors, (24), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:41,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2025-02-05 14:29:41,864 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 7 [2025-02-05 14:29:41,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:41,864 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2025-02-05 14:29:41,864 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.25) internal successors, (5), 3 states have internal predecessors, (5), 2 states have call successors, (2), 2 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-05 14:29:41,865 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2025-02-05 14:29:41,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:29:41,865 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:41,865 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:41,866 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-05 14:29:41,866 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:41,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:41,866 INFO L85 PathProgramCache]: Analyzing trace with hash 303788984, now seen corresponding path program 1 times [2025-02-05 14:29:41,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:41,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58506216] [2025-02-05 14:29:41,866 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:41,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:41,881 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:29:41,894 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:29:41,895 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:41,895 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:42,082 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:42,083 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:42,083 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58506216] [2025-02-05 14:29:42,084 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58506216] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:42,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1685446831] [2025-02-05 14:29:42,084 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,084 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:42,084 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:42,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:42,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-05 14:29:42,146 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:29:42,178 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:29:42,179 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,179 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:42,181 INFO L256 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 14:29:42,184 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:42,236 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:42,236 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:42,328 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:42,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1685446831] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:42,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:42,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 6 [2025-02-05 14:29:42,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124994371] [2025-02-05 14:29:42,329 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:42,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:29:42,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:42,331 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:29:42,331 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,331 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:29:42,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:42,349 INFO L93 Difference]: Finished difference Result 53 states and 66 transitions. [2025-02-05 14:29:42,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:29:42,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-05 14:29:42,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:42,352 INFO L225 Difference]: With dead ends: 53 [2025-02-05 14:29:42,352 INFO L226 Difference]: Without dead ends: 33 [2025-02-05 14:29:42,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,352 INFO L435 NwaCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:42,353 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 172 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:42,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2025-02-05 14:29:42,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2025-02-05 14:29:42,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 24 states have internal predecessors, (26), 7 states have call successors, (7), 3 states have call predecessors, (7), 3 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-05 14:29:42,360 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2025-02-05 14:29:42,360 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 26 [2025-02-05 14:29:42,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:42,360 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2025-02-05 14:29:42,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:29:42,360 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2025-02-05 14:29:42,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:29:42,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:42,362 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:42,368 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-02-05 14:29:42,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:42,564 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:42,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:42,565 INFO L85 PathProgramCache]: Analyzing trace with hash -513859466, now seen corresponding path program 1 times [2025-02-05 14:29:42,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:42,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-02-05 14:29:42,565 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:42,576 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:29:42,583 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:29:42,586 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,586 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:42,708 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:42,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:42,708 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2146258668] [2025-02-05 14:29:42,708 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2146258668] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:42,708 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-05 14:29:42,708 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2025-02-05 14:29:42,708 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1498490992] [2025-02-05 14:29:42,708 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:42,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-05 14:29:42,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:42,709 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-05 14:29:42,709 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,709 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:29:42,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:42,734 INFO L93 Difference]: Finished difference Result 51 states and 61 transitions. [2025-02-05 14:29:42,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-05 14:29:42,734 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2025-02-05 14:29:42,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:42,735 INFO L225 Difference]: With dead ends: 51 [2025-02-05 14:29:42,735 INFO L226 Difference]: Without dead ends: 30 [2025-02-05 14:29:42,735 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-05 14:29:42,736 INFO L435 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:42,736 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-05 14:29:42,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2025-02-05 14:29:42,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2025-02-05 14:29:42,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 20 states have (on average 1.15) internal successors, (23), 21 states have internal predecessors, (23), 7 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-02-05 14:29:42,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2025-02-05 14:29:42,740 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 26 [2025-02-05 14:29:42,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:42,740 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2025-02-05 14:29:42,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 5 states have internal predecessors, (17), 2 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-05 14:29:42,740 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2025-02-05 14:29:42,741 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2025-02-05 14:29:42,741 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:42,741 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:42,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-05 14:29:42,741 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:42,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:42,742 INFO L85 PathProgramCache]: Analyzing trace with hash 187205112, now seen corresponding path program 1 times [2025-02-05 14:29:42,742 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:42,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310578262] [2025-02-05 14:29:42,742 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:42,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:42,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:29:42,753 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:29:42,754 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:42,754 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:43,028 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:43,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310578262] [2025-02-05 14:29:43,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310578262] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:43,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988296115] [2025-02-05 14:29:43,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:43,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:43,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:43,031 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:43,033 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-05 14:29:43,074 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 26 statements into 1 equivalence classes. [2025-02-05 14:29:43,092 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 26 of 26 statements. [2025-02-05 14:29:43,092 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:43,092 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:43,093 INFO L256 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 14:29:43,095 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:43,363 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-02-05 14:29:43,363 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:43,364 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [988296115] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:43,364 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:29:43,364 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [11] total 21 [2025-02-05 14:29:43,364 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7216980] [2025-02-05 14:29:43,364 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:43,365 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-02-05 14:29:43,365 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:43,365 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-02-05 14:29:43,366 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2025-02-05 14:29:43,366 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:29:43,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:43,670 INFO L93 Difference]: Finished difference Result 57 states and 68 transitions. [2025-02-05 14:29:43,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-02-05 14:29:43,670 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 26 [2025-02-05 14:29:43,671 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:43,671 INFO L225 Difference]: With dead ends: 57 [2025-02-05 14:29:43,671 INFO L226 Difference]: Without dead ends: 54 [2025-02-05 14:29:43,672 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=800, Unknown=0, NotChecked=0, Total=930 [2025-02-05 14:29:43,673 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 50 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:43,673 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 127 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-05 14:29:43,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2025-02-05 14:29:43,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 48. [2025-02-05 14:29:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 33 states have (on average 1.2121212121212122) internal successors, (40), 34 states have internal predecessors, (40), 10 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-05 14:29:43,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2025-02-05 14:29:43,678 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 26 [2025-02-05 14:29:43,678 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:43,678 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2025-02-05 14:29:43,678 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 1.4166666666666667) internal successors, (17), 9 states have internal predecessors, (17), 4 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-02-05 14:29:43,679 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2025-02-05 14:29:43,679 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 14:29:43,679 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:43,679 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:43,685 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-02-05 14:29:43,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:43,880 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:43,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:43,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1614044748, now seen corresponding path program 1 times [2025-02-05 14:29:43,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:43,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-02-05 14:29:43,880 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:43,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:43,886 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 14:29:43,891 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 14:29:43,891 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:43,891 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:44,138 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:44,138 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1820046324] [2025-02-05 14:29:44,138 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1820046324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:44,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817606132] [2025-02-05 14:29:44,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:44,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:44,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:44,142 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:44,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-05 14:29:44,181 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 14:29:44,198 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 14:29:44,198 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:44,198 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:44,199 INFO L256 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:29:44,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:44,308 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:44,309 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:44,554 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:44,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817606132] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:44,554 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:44,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 21 [2025-02-05 14:29:44,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130544518] [2025-02-05 14:29:44,555 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:44,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-05 14:29:44,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:44,555 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-05 14:29:44,556 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=371, Unknown=0, NotChecked=0, Total=420 [2025-02-05 14:29:44,556 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:29:44,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:44,954 INFO L93 Difference]: Finished difference Result 64 states and 80 transitions. [2025-02-05 14:29:44,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-02-05 14:29:44,955 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2025-02-05 14:29:44,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:44,956 INFO L225 Difference]: With dead ends: 64 [2025-02-05 14:29:44,956 INFO L226 Difference]: Without dead ends: 60 [2025-02-05 14:29:44,956 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 47 SyntacticMatches, 15 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=115, Invalid=815, Unknown=0, NotChecked=0, Total=930 [2025-02-05 14:29:44,957 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 59 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 587 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 623 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:44,957 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 121 Invalid, 623 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 587 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:29:44,957 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2025-02-05 14:29:44,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 56. [2025-02-05 14:29:44,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 39 states have (on average 1.205128205128205) internal successors, (47), 41 states have internal predecessors, (47), 10 states have call successors, (10), 6 states have call predecessors, (10), 6 states have return successors, (10), 8 states have call predecessors, (10), 7 states have call successors, (10) [2025-02-05 14:29:44,963 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 67 transitions. [2025-02-05 14:29:44,963 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 67 transitions. Word has length 33 [2025-02-05 14:29:44,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:44,963 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 67 transitions. [2025-02-05 14:29:44,963 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 1.736842105263158) internal successors, (33), 17 states have internal predecessors, (33), 5 states have call successors, (6), 5 states have call predecessors, (6), 4 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:29:44,964 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 67 transitions. [2025-02-05 14:29:44,964 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2025-02-05 14:29:44,964 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:44,964 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:44,972 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-02-05 14:29:45,164 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:45,165 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:45,165 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:45,165 INFO L85 PathProgramCache]: Analyzing trace with hash -938112213, now seen corresponding path program 1 times [2025-02-05 14:29:45,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:45,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-02-05 14:29:45,165 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:45,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:45,170 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 14:29:45,179 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 14:29:45,183 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:45,183 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:45,346 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:45,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730767718] [2025-02-05 14:29:45,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730767718] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:45,346 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639389480] [2025-02-05 14:29:45,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:45,346 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:45,346 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:45,349 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:45,350 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-05 14:29:45,387 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 33 statements into 1 equivalence classes. [2025-02-05 14:29:45,404 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 33 of 33 statements. [2025-02-05 14:29:45,404 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:45,404 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:45,405 INFO L256 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-02-05 14:29:45,407 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:45,620 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:45,874 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-05 14:29:45,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639389480] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:45,874 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:45,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 32 [2025-02-05 14:29:45,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911373916] [2025-02-05 14:29:45,874 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:45,875 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2025-02-05 14:29:45,875 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:45,875 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2025-02-05 14:29:45,875 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=875, Unknown=0, NotChecked=0, Total=992 [2025-02-05 14:29:45,876 INFO L87 Difference]: Start difference. First operand 56 states and 67 transitions. Second operand has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-05 14:29:46,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:46,376 INFO L93 Difference]: Finished difference Result 71 states and 82 transitions. [2025-02-05 14:29:46,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-02-05 14:29:46,377 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) Word has length 33 [2025-02-05 14:29:46,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:46,378 INFO L225 Difference]: With dead ends: 71 [2025-02-05 14:29:46,378 INFO L226 Difference]: Without dead ends: 61 [2025-02-05 14:29:46,378 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 260 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=252, Invalid=1470, Unknown=0, NotChecked=0, Total=1722 [2025-02-05 14:29:46,379 INFO L435 NwaCegarLoop]: 23 mSDtfsCounter, 111 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 819 mSolverCounterSat, 61 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 61 IncrementalHoareTripleChecker+Valid, 819 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:46,379 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 180 Invalid, 880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [61 Valid, 819 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-05 14:29:46,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2025-02-05 14:29:46,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2025-02-05 14:29:46,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 35 states have (on average 1.1428571428571428) internal successors, (40), 36 states have internal predecessors, (40), 8 states have call successors, (8), 6 states have call predecessors, (8), 5 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-05 14:29:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2025-02-05 14:29:46,384 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 33 [2025-02-05 14:29:46,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:46,384 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2025-02-05 14:29:46,384 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 1.9375) internal successors, (62), 26 states have internal predecessors, (62), 7 states have call successors, (13), 11 states have call predecessors, (13), 7 states have return successors, (9), 6 states have call predecessors, (9), 6 states have call successors, (9) [2025-02-05 14:29:46,384 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2025-02-05 14:29:46,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:29:46,385 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:46,385 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:46,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-05 14:29:46,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2025-02-05 14:29:46,586 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:46,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:46,586 INFO L85 PathProgramCache]: Analyzing trace with hash 1257828861, now seen corresponding path program 1 times [2025-02-05 14:29:46,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:46,586 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-02-05 14:29:46,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:46,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:46,592 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:29:46,596 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:29:46,597 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:46,597 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:46,768 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:29:46,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510784571] [2025-02-05 14:29:46,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510784571] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:46,769 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [952762194] [2025-02-05 14:29:46,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:46,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:46,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:46,771 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:46,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-05 14:29:46,810 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:29:46,828 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:29:46,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:46,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:46,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-02-05 14:29:46,832 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:47,156 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:29:47,156 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-05 14:29:47,502 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 12 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-05 14:29:47,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [952762194] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-05 14:29:47,502 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-05 14:29:47,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 17] total 35 [2025-02-05 14:29:47,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548674469] [2025-02-05 14:29:47,502 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-05 14:29:47,503 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-02-05 14:29:47,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:47,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-02-05 14:29:47,504 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=1112, Unknown=0, NotChecked=0, Total=1190 [2025-02-05 14:29:47,504 INFO L87 Difference]: Start difference. First operand 49 states and 56 transitions. Second operand has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 14:29:48,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:48,353 INFO L93 Difference]: Finished difference Result 89 states and 102 transitions. [2025-02-05 14:29:48,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-02-05 14:29:48,354 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) Word has length 43 [2025-02-05 14:29:48,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:48,354 INFO L225 Difference]: With dead ends: 89 [2025-02-05 14:29:48,354 INFO L226 Difference]: Without dead ends: 71 [2025-02-05 14:29:48,355 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 63 SyntacticMatches, 13 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 404 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=307, Invalid=2999, Unknown=0, NotChecked=0, Total=3306 [2025-02-05 14:29:48,356 INFO L435 NwaCegarLoop]: 16 mSDtfsCounter, 75 mSDsluCounter, 251 mSDsCounter, 0 mSdLazyCounter, 1512 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 1567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 1512 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:48,356 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 267 Invalid, 1567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 1512 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2025-02-05 14:29:48,356 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2025-02-05 14:29:48,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 62. [2025-02-05 14:29:48,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.1333333333333333) internal successors, (51), 45 states have internal predecessors, (51), 10 states have call successors, (10), 8 states have call predecessors, (10), 6 states have return successors, (9), 8 states have call predecessors, (9), 7 states have call successors, (9) [2025-02-05 14:29:48,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 70 transitions. [2025-02-05 14:29:48,364 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 70 transitions. Word has length 43 [2025-02-05 14:29:48,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:48,364 INFO L471 AbstractCegarLoop]: Abstraction has 62 states and 70 transitions. [2025-02-05 14:29:48,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.7575757575757576) internal successors, (58), 28 states have internal predecessors, (58), 8 states have call successors, (10), 6 states have call predecessors, (10), 8 states have return successors, (9), 8 states have call predecessors, (9), 5 states have call successors, (9) [2025-02-05 14:29:48,364 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 70 transitions. [2025-02-05 14:29:48,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-05 14:29:48,365 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:48,365 INFO L218 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:48,371 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-05 14:29:48,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:48,567 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:48,567 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:48,567 INFO L85 PathProgramCache]: Analyzing trace with hash -1426626179, now seen corresponding path program 1 times [2025-02-05 14:29:48,567 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:48,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1629788787] [2025-02-05 14:29:48,567 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:48,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:48,574 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:29:48,579 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:29:48,580 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:48,580 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:48,725 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:29:48,726 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-05 14:29:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1629788787] [2025-02-05 14:29:48,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1629788787] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-05 14:29:48,726 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1591790823] [2025-02-05 14:29:48,726 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:48,727 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-05 14:29:48,727 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-05 14:29:48,728 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-05 14:29:48,730 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-05 14:29:48,766 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-02-05 14:29:48,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-02-05 14:29:48,793 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:48,793 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-05 14:29:48,794 INFO L256 TraceCheckSpWp]: Trace formula consists of 244 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-02-05 14:29:48,795 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-05 14:29:48,904 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-05 14:29:48,904 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-05 14:29:48,904 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1591790823] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-05 14:29:48,904 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-05 14:29:48,904 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [13] total 19 [2025-02-05 14:29:48,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [438898715] [2025-02-05 14:29:48,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-05 14:29:48,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-02-05 14:29:48,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-05 14:29:48,905 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-02-05 14:29:48,905 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2025-02-05 14:29:48,905 INFO L87 Difference]: Start difference. First operand 62 states and 70 transitions. Second operand has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:29:49,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-05 14:29:49,076 INFO L93 Difference]: Finished difference Result 74 states and 82 transitions. [2025-02-05 14:29:49,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-05 14:29:49,076 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-02-05 14:29:49,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-05 14:29:49,077 INFO L225 Difference]: With dead ends: 74 [2025-02-05 14:29:49,077 INFO L226 Difference]: Without dead ends: 67 [2025-02-05 14:29:49,077 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=123, Invalid=689, Unknown=0, NotChecked=0, Total=812 [2025-02-05 14:29:49,078 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 59 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-05 14:29:49,078 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 105 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-05 14:29:49,078 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-02-05 14:29:49,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 53. [2025-02-05 14:29:49,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 39 states have (on average 1.1025641025641026) internal successors, (43), 38 states have internal predecessors, (43), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (8), 7 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-05 14:29:49,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 59 transitions. [2025-02-05 14:29:49,085 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 59 transitions. Word has length 43 [2025-02-05 14:29:49,085 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-05 14:29:49,085 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 59 transitions. [2025-02-05 14:29:49,085 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.0) internal successors, (26), 11 states have internal predecessors, (26), 5 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-05 14:29:49,085 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 59 transitions. [2025-02-05 14:29:49,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-02-05 14:29:49,086 INFO L210 NwaCegarLoop]: Found error trace [2025-02-05 14:29:49,086 INFO L218 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:49,092 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-05 14:29:49,286 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-02-05 14:29:49,287 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-02-05 14:29:49,287 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-05 14:29:49,287 INFO L85 PathProgramCache]: Analyzing trace with hash 495828742, now seen corresponding path program 1 times [2025-02-05 14:29:49,287 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-05 14:29:49,287 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518343703] [2025-02-05 14:29:49,287 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-05 14:29:49,287 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-05 14:29:49,294 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 14:29:49,305 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:29:49,305 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:49,305 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:29:49,305 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-02-05 14:29:49,307 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-02-05 14:29:49,320 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-02-05 14:29:49,321 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-05 14:29:49,321 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-02-05 14:29:49,342 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-02-05 14:29:49,343 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-02-05 14:29:49,343 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location __blast_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-02-05 14:29:49,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-02-05 14:29:49,347 INFO L422 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-05 14:29:49,381 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-02-05 14:29:49,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.02 02:29:49 BoogieIcfgContainer [2025-02-05 14:29:49,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-02-05 14:29:49,385 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-02-05 14:29:49,385 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-02-05 14:29:49,385 INFO L274 PluginConnector]: Witness Printer initialized [2025-02-05 14:29:49,386 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 05.02 02:29:41" (3/4) ... [2025-02-05 14:29:49,386 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-02-05 14:29:49,440 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 26. [2025-02-05 14:29:49,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-02-05 14:29:49,494 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/witness.yml [2025-02-05 14:29:49,494 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-02-05 14:29:49,495 INFO L158 Benchmark]: Toolchain (without parser) took 8650.36ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 126.1MB in the end (delta: 30.3MB). Peak memory consumption was 34.0MB. Max. memory is 16.1GB. [2025-02-05 14:29:49,495 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:49,496 INFO L158 Benchmark]: CACSL2BoogieTranslator took 299.82ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 139.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-02-05 14:29:49,496 INFO L158 Benchmark]: Boogie Procedure Inliner took 28.45ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 137.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:49,496 INFO L158 Benchmark]: Boogie Preprocessor took 27.28ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 136.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:49,497 INFO L158 Benchmark]: IcfgBuilder took 265.14ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 122.1MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:49,497 INFO L158 Benchmark]: TraceAbstraction took 7915.51ms. Allocated memory is still 201.3MB. Free memory was 121.6MB in the beginning and 134.5MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-02-05 14:29:49,497 INFO L158 Benchmark]: Witness Printer took 109.20ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 126.1MB in the end (delta: 8.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-02-05 14:29:49,498 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.18ms. Allocated memory is still 201.3MB. Free memory is still 116.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 299.82ms. Allocated memory is still 201.3MB. Free memory was 156.4MB in the beginning and 139.2MB in the end (delta: 17.2MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 28.45ms. Allocated memory is still 201.3MB. Free memory was 139.2MB in the beginning and 137.5MB in the end (delta: 1.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 27.28ms. Allocated memory is still 201.3MB. Free memory was 137.5MB in the beginning and 136.1MB in the end (delta: 1.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 265.14ms. Allocated memory is still 201.3MB. Free memory was 136.1MB in the beginning and 122.1MB in the end (delta: 13.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7915.51ms. Allocated memory is still 201.3MB. Free memory was 121.6MB in the beginning and 134.5MB in the end (delta: -12.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 109.20ms. Allocated memory is still 201.3MB. Free memory was 134.5MB in the beginning and 126.1MB 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: 6]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L519] void * guard_malloc_counter = 0; [L534] struct list_head *elem = ((void *)0); [L544] static struct list_head head; [L544] static struct list_head head; [L544] static struct list_head head; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L546] struct list_head *dev1, *dev2; VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L547] CALL, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:0}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:1}, elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L547] RET, EXPR my_malloc(sizeof(*dev1)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L547] dev1 = my_malloc(sizeof(*dev1)) [L548] CALL, EXPR my_malloc(sizeof(*dev2)) VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L529] CALL, EXPR __getMemory(size) [L522] (size > 0) ? (0) : __blast_assert () VAL [elem={0:0}, guard_malloc_counter={0:1}, head={4:0}] [L523] guard_malloc_counter++ [L524] COND FALSE !(!__VERIFIER_nondet_int()) [L526] return (void *) guard_malloc_counter; VAL [\result={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L529] RET, EXPR __getMemory(size) [L529] return __getMemory(size); [L548] RET, EXPR my_malloc(sizeof(*dev2)) VAL [dev1={0:1}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L548] dev2 = my_malloc(sizeof(*dev2)) [L549] COND TRUE dev1!=((void *)0) && dev2!=((void *)0) VAL [dev1={0:1}, dev2={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L550] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:0}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L550] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L551] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:2}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L537] COND TRUE __VERIFIER_nondet_int() [L538] elem = new VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L551] RET list_add(dev1, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] CALL list_del(dev2) [L541] COND FALSE !(entry==elem) VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L552] RET list_del(dev2) [L553] CALL list_add(dev2, &head) VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:2}] [L537] COND FALSE !(__VERIFIER_nondet_int()) [L553] RET list_add(dev2, &head) VAL [dev1={0:1}, dev2={0:2}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L554] CALL list_add(dev1, &head) VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L536] (new!=elem) ? (0) : __blast_assert () VAL [\old(head)={4:0}, \old(new)={0:1}, elem={0:1}, guard_malloc_counter={0:2}, head={4:0}, new={0:1}] [L536] CALL __blast_assert () VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] [L6] reach_error() VAL [elem={0:1}, guard_malloc_counter={0:2}, head={4:0}] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 7.8s, OverallIterations: 9, TraceHistogramMax: 4, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 361 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 361 mSDsluCounter, 1238 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1035 mSDsCounter, 202 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3445 IncrementalHoareTripleChecker+Invalid, 3647 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 202 mSolverCounterUnsat, 203 mSDtfsCounter, 3445 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 493 GetRequests, 272 SyntacticMatches, 29 SemanticMatches, 192 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1014 ImplicationChecksByTransitivity, 2.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=62occurred in iteration=7, InterpolantAutomatonStates: 99, 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, 8 MinimizatonAttempts, 45 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 491 NumberOfCodeBlocks, 491 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 558 ConstructedInterpolants, 0 QuantifiedInterpolants, 1934 SizeOfPredicates, 23 NumberOfNonLiveVariables, 1199 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 18 InterpolantComputations, 4 PerfectInterpolantSequences, 115/181 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-02-05 14:29:49,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, 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