./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/pthread/stack-2.i --full-output --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 42d87675 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/GemCutterReach.xml -i ../sv-benchmarks/c/pthread/stack-2.i -s /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 GemCutter --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 --traceabstraction.use.conditional.por.in.concurrent.analysis false --traceabstraction.commutativity.condition.synthesis NONE --traceabstraction.partial.order.reduction.in.concurrent.analysis PERSISTENT_SETS --- Real Ultimate output --- This is Ultimate 0.3.0-dev-42d8767-m [2025-04-25 02:07:43,670 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-25 02:07:43,725 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/config/svcomp-Reach-32bit-GemCutter_Default.epf [2025-04-25 02:07:43,729 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-25 02:07:43,729 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-25 02:07:43,753 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-25 02:07:43,754 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-25 02:07:43,754 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-25 02:07:43,754 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-25 02:07:43,754 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-25 02:07:43,754 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-25 02:07:43,754 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-25 02:07:43,754 INFO L153 SettingsManager]: * Use SBE=true [2025-04-25 02:07:43,754 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-25 02:07:43,755 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:07:43,755 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:07:43,755 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:07:43,756 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Commutativity condition synthesis=NECESSARY_AND_SUFFICIENT [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * DFS Order used in POR=LOOP_LOCKSTEP [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PARTIAL_ORDER_FA [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * CEGAR restart behaviour=ONE_CEGAR_PER_THREAD_INSTANCE [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * Partial Order Reduction in concurrent analysis=PERSISTENT_SLEEP_NEW_STATES_FIXEDORDER [2025-04-25 02:07:43,756 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UGemCutter-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 -> GemCutter 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 -> 1c5d098180a5596f0a60d3177354c69a5ee6da68b8191dc75b6c33b291ef0421 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Use conditional POR in concurrent analysis -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Commutativity condition synthesis -> NONE Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Partial Order Reduction in concurrent analysis -> PERSISTENT_SETS [2025-04-25 02:07:44,056 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-25 02:07:44,064 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-25 02:07:44,066 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-25 02:07:44,068 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-25 02:07:44,069 INFO L274 PluginConnector]: CDTParser initialized [2025-04-25 02:07:44,069 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/../sv-benchmarks/c/pthread/stack-2.i [2025-04-25 02:07:45,313 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/984e501f2/70a3cab448fc434fa7d5d54110b9b251/FLAGcfc97e9cb [2025-04-25 02:07:45,559 INFO L389 CDTParser]: Found 1 translation units. [2025-04-25 02:07:45,562 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i [2025-04-25 02:07:45,579 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/984e501f2/70a3cab448fc434fa7d5d54110b9b251/FLAGcfc97e9cb [2025-04-25 02:07:46,362 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/data/984e501f2/70a3cab448fc434fa7d5d54110b9b251 [2025-04-25 02:07:46,365 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-25 02:07:46,366 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-25 02:07:46,367 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-25 02:07:46,367 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-25 02:07:46,370 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-25 02:07:46,372 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,373 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9a65a12 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46, skipping insertion in model container [2025-04-25 02:07:46,373 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,392 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-25 02:07:46,731 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2025-04-25 02:07:46,750 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:07:46,762 INFO L200 MainTranslator]: Completed pre-run [2025-04-25 02:07:46,809 WARN L116 LibraryModelHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread/stack-2.i[41520,41533] [2025-04-25 02:07:46,815 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-04-25 02:07:46,853 INFO L204 MainTranslator]: Completed translation [2025-04-25 02:07:46,854 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46 WrapperNode [2025-04-25 02:07:46,854 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-25 02:07:46,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-25 02:07:46,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-25 02:07:46,855 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-25 02:07:46,859 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,877 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,897 INFO L138 Inliner]: procedures = 277, calls = 36, calls flagged for inlining = 12, calls inlined = 12, statements flattened = 151 [2025-04-25 02:07:46,897 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-25 02:07:46,898 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-25 02:07:46,898 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-25 02:07:46,898 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-25 02:07:46,902 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,902 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,905 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,905 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,909 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,909 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,911 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,912 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,913 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,916 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-25 02:07:46,916 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-25 02:07:46,916 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-25 02:07:46,917 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-25 02:07:46,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (1/1) ... [2025-04-25 02:07:46,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-25 02:07:46,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:46,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-25 02:07:46,947 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-25 02:07:46,961 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2025-04-25 02:07:46,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2025-04-25 02:07:46,962 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2025-04-25 02:07:46,962 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-25 02:07:46,962 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-25 02:07:46,963 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2025-04-25 02:07:47,063 INFO L234 CfgBuilder]: Building ICFG [2025-04-25 02:07:47,064 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-25 02:07:47,237 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2025-04-25 02:07:47,237 INFO L283 CfgBuilder]: Performing block encoding [2025-04-25 02:07:47,408 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-25 02:07:47,409 INFO L312 CfgBuilder]: Removed 0 assume(true) statements. [2025-04-25 02:07:47,409 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:07:47 BoogieIcfgContainer [2025-04-25 02:07:47,409 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-25 02:07:47,410 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-25 02:07:47,410 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-25 02:07:47,413 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-25 02:07:47,414 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 25.04 02:07:46" (1/3) ... [2025-04-25 02:07:47,415 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c50c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:07:47, skipping insertion in model container [2025-04-25 02:07:47,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 25.04 02:07:46" (2/3) ... [2025-04-25 02:07:47,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@124c50c3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 25.04 02:07:47, skipping insertion in model container [2025-04-25 02:07:47,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:07:47" (3/3) ... [2025-04-25 02:07:47,418 INFO L128 eAbstractionObserver]: Analyzing ICFG stack-2.i [2025-04-25 02:07:47,427 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-25 02:07:47,429 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG stack-2.i that has 3 procedures, 31 locations, 33 edges, 1 initial locations, 2 loop locations, and 2 error locations. [2025-04-25 02:07:47,429 INFO L490 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2025-04-25 02:07:47,485 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2025-04-25 02:07:47,521 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 [2025-04-25 02:07:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:47,525 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (exit command is (exit), workingDir is null) [2025-04-25 02:07:47,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Waiting until timeout for monitored process [2025-04-25 02:07:47,594 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:07:47,601 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t1Thread1of1ForFork1 ======== [2025-04-25 02:07:47,609 INFO L340 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=PARTIAL_ORDER_FA, 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;@2ac5e812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:47,609 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:07:47,663 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:47,667 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:47,668 INFO L85 PathProgramCache]: Analyzing trace with hash 107013542, now seen corresponding path program 1 times [2025-04-25 02:07:47,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:47,674 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691846668] [2025-04-25 02:07:47,674 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:47,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:47,737 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-04-25 02:07:47,769 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-04-25 02:07:47,770 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:47,770 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:48,024 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:48,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:48,026 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691846668] [2025-04-25 02:07:48,027 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691846668] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:48,027 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:48,028 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:48,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818805342] [2025-04-25 02:07:48,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:48,033 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-25 02:07:48,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:48,048 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-25 02:07:48,049 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-04-25 02:07:48,050 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,051 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:48,052 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:48,052 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,174 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:48,174 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-25 02:07:48,174 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:48,176 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:48,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1554667841, now seen corresponding path program 1 times [2025-04-25 02:07:48,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:48,176 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [420811360] [2025-04-25 02:07:48,176 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:48,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:48,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 02:07:48,215 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 02:07:48,215 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:48,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:48,318 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:48,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:48,318 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [420811360] [2025-04-25 02:07:48,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [420811360] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:48,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:48,319 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:48,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15654412] [2025-04-25 02:07:48,319 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:48,319 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:07:48,319 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:48,320 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:07:48,320 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:07:48,320 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,320 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:48,320 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:48,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:48,320 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:48,382 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:48,382 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-25 02:07:48,382 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:48,383 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:48,383 INFO L85 PathProgramCache]: Analyzing trace with hash -1823243102, now seen corresponding path program 1 times [2025-04-25 02:07:48,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:48,383 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701383279] [2025-04-25 02:07:48,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:48,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:48,397 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 24 statements into 1 equivalence classes. [2025-04-25 02:07:48,406 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 24 of 24 statements. [2025-04-25 02:07:48,407 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:48,407 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:48,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:48,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:48,526 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701383279] [2025-04-25 02:07:48,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [701383279] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:48,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:48,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:48,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472427583] [2025-04-25 02:07:48,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:48,527 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:07:48,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:48,527 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:07:48,527 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:07:48,527 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,527 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:48,527 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:48,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:48,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:48,527 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:48,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:48,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:48,577 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:48,577 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-25 02:07:48,577 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:48,577 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:48,577 INFO L85 PathProgramCache]: Analyzing trace with hash 104542238, now seen corresponding path program 1 times [2025-04-25 02:07:48,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:48,578 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117681939] [2025-04-25 02:07:48,578 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:48,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:48,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 02:07:48,603 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 02:07:48,603 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:48,604 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:48,768 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:48,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:48,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117681939] [2025-04-25 02:07:48,769 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117681939] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:48,769 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [701104394] [2025-04-25 02:07:48,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:48,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:48,769 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:48,775 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:48,776 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-25 02:07:48,837 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 02:07:48,859 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 02:07:48,859 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:48,859 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:48,862 INFO L256 TraceCheckSpWp]: Trace formula consists of 180 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 02:07:48,866 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:48,918 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:49,096 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:49,097 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:07:49,161 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:49,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [701104394] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:07:49,162 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:07:49,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2025-04-25 02:07:49,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [558656892] [2025-04-25 02:07:49,162 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:07:49,162 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2025-04-25 02:07:49,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:49,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2025-04-25 02:07:49,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=59, Unknown=0, NotChecked=0, Total=90 [2025-04-25 02:07:49,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:49,165 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:49,165 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 6.3) internal successors, (63), 10 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:49,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:49,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,165 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:49,332 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:49,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,333 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:49,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-25 02:07:49,533 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:49,534 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:49,535 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:49,535 INFO L85 PathProgramCache]: Analyzing trace with hash 1298264990, now seen corresponding path program 1 times [2025-04-25 02:07:49,535 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:49,536 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556164437] [2025-04-25 02:07:49,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:49,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:49,556 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:07:49,563 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:07:49,564 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:49,564 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:49,663 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-25 02:07:49,664 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:49,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556164437] [2025-04-25 02:07:49,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556164437] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:49,664 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1060875590] [2025-04-25 02:07:49,664 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:49,664 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:49,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:49,666 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:49,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-25 02:07:49,751 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:07:49,783 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:07:49,783 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:49,783 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:49,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-04-25 02:07:49,786 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:49,812 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-25 02:07:49,812 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:07:49,841 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2025-04-25 02:07:49,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1060875590] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:07:49,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:07:49,842 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-04-25 02:07:49,842 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1842287625] [2025-04-25 02:07:49,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:07:49,842 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-25 02:07:49,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:49,842 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-25 02:07:49,842 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-04-25 02:07:49,842 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:49,842 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:49,843 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 9.714285714285714) internal successors, (68), 7 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:49,843 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:49,843 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,843 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,843 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:49,843 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:49,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:49,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:49,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:49,931 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:49,938 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-25 02:07:50,132 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:50,132 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:50,133 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:50,133 INFO L85 PathProgramCache]: Analyzing trace with hash -1762004488, now seen corresponding path program 2 times [2025-04-25 02:07:50,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:50,133 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1676965760] [2025-04-25 02:07:50,133 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:50,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:50,156 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-04-25 02:07:50,178 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-04-25 02:07:50,180 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:50,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:50,392 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 0 proven. 116 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-25 02:07:50,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:50,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1676965760] [2025-04-25 02:07:50,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1676965760] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:50,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1153311286] [2025-04-25 02:07:50,393 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:50,393 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:50,393 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:50,395 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:50,396 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-25 02:07:50,490 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-04-25 02:07:50,538 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-04-25 02:07:50,539 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:50,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:50,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 440 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 02:07:50,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:50,659 INFO L134 CoverageAnalysis]: Checked inductivity of 129 backedges. 116 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-04-25 02:07:50,659 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:07:50,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1153311286] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:50,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 02:07:50,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [7] total 13 [2025-04-25 02:07:50,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177761401] [2025-04-25 02:07:50,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:50,659 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:07:50,659 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:50,660 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:07:50,660 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2025-04-25 02:07:50,660 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:50,660 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:50,660 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.0) internal successors, (80), 8 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:50,660 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:50,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:50,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:50,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:50,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 02:07:50,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:50,865 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:50,871 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-04-25 02:07:51,065 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:51,065 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:51,066 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:51,066 INFO L85 PathProgramCache]: Analyzing trace with hash -28458813, now seen corresponding path program 2 times [2025-04-25 02:07:51,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:51,066 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1591745771] [2025-04-25 02:07:51,066 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:51,066 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:51,086 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-25 02:07:51,118 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-25 02:07:51,121 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:51,121 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:51,577 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 29 proven. 1 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-25 02:07:51,577 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:51,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1591745771] [2025-04-25 02:07:51,577 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1591745771] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:51,577 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [80340380] [2025-04-25 02:07:51,577 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:51,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:51,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:51,580 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:51,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-25 02:07:51,665 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 66 statements into 2 equivalence classes. [2025-04-25 02:07:51,703 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 66 of 66 statements. [2025-04-25 02:07:51,703 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:51,703 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:51,705 INFO L256 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 14 conjuncts are in the unsatisfiable core [2025-04-25 02:07:51,710 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:51,726 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:51,856 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:52,440 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2025-04-25 02:07:52,441 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:07:52,441 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [80340380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:52,441 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 02:07:52,441 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [8] total 14 [2025-04-25 02:07:52,441 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2008539437] [2025-04-25 02:07:52,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:52,442 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:07:52,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:52,443 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:07:52,443 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2025-04-25 02:07:52,443 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:52,443 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:52,443 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:52,443 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:52,721 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:07:52,729 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-04-25 02:07:52,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2025-04-25 02:07:52,922 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err0ASSERT_VIOLATIONERROR_FUNCTION === [t1Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:52,923 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:52,923 INFO L85 PathProgramCache]: Analyzing trace with hash 2101575418, now seen corresponding path program 3 times [2025-04-25 02:07:52,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:52,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [630288302] [2025-04-25 02:07:52,923 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:07:52,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:52,942 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 4 equivalence classes. [2025-04-25 02:07:53,026 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 73 of 73 statements. [2025-04-25 02:07:53,027 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-25 02:07:53,027 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:53,655 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 47 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2025-04-25 02:07:53,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:53,655 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [630288302] [2025-04-25 02:07:53,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [630288302] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:53,656 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830622302] [2025-04-25 02:07:53,656 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-25 02:07:53,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:53,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:53,657 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:53,659 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-25 02:07:53,746 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 73 statements into 4 equivalence classes. [2025-04-25 02:07:53,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) and asserted 73 of 73 statements. [2025-04-25 02:07:53,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2025-04-25 02:07:53,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:53,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 17 conjuncts are in the unsatisfiable core [2025-04-25 02:07:53,837 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:53,855 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:53,908 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:53,948 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:53,982 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-04-25 02:07:54,077 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 7 proven. 22 refuted. 0 times theorem prover too weak. 29 trivial. 0 not checked. [2025-04-25 02:07:54,079 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:07:54,238 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-25 02:07:54,238 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830622302] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:07:54,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:07:54,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 9, 7] total 24 [2025-04-25 02:07:54,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077414582] [2025-04-25 02:07:54,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:07:54,239 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-04-25 02:07:54,242 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:54,243 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-04-25 02:07:54,243 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=389, Unknown=0, NotChecked=0, Total=600 [2025-04-25 02:07:54,243 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:54,243 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:54,244 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 6.24) internal successors, (156), 24 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 11 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 9 states. [2025-04-25 02:07:54,244 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:54,906 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:54,907 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2025-04-25 02:07:54,910 INFO L790 garLoopResultBuilder]: Registering result SAFE for location t1Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 02:07:54,917 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-04-25 02:07:55,111 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:55,115 INFO L422 BasicCegarLoop]: Path program histogram: [3, 2, 1, 1, 1] [2025-04-25 02:07:55,116 INFO L320 ceAbstractionStarter]: Result for error location t1Thread1of1ForFork1 was SAFE (1/3) [2025-04-25 02:07:55,118 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:55,119 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:07:55,119 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == ULTIMATE.start ======== [2025-04-25 02:07:55,119 INFO L340 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=PARTIAL_ORDER_FA, 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;@2ac5e812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:55,119 INFO L341 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-04-25 02:07:55,121 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 2 remaining) [2025-04-25 02:07:55,121 INFO L790 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (0 of 2 remaining) [2025-04-25 02:07:55,121 INFO L422 BasicCegarLoop]: Path program histogram: [] [2025-04-25 02:07:55,122 INFO L320 ceAbstractionStarter]: Result for error location ULTIMATE.start was SAFE,SAFE (2/3) [2025-04-25 02:07:55,123 INFO L125 denceProviderFactory]: Independence Relation #1: [IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:55,123 INFO L177 artialOrderCegarLoop]: Running PartialOrderCegarLoop with 1 independence relations. [2025-04-25 02:07:55,123 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == t2Thread1of1ForFork0 ======== [2025-04-25 02:07:55,124 INFO L340 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=PARTIAL_ORDER_FA, 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;@2ac5e812, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-25 02:07:55,124 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-04-25 02:07:55,131 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:55,131 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:55,131 INFO L85 PathProgramCache]: Analyzing trace with hash 1301376737, now seen corresponding path program 1 times [2025-04-25 02:07:55,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:55,131 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093296437] [2025-04-25 02:07:55,131 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:55,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:55,139 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-04-25 02:07:55,142 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-04-25 02:07:55,142 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:55,142 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:55,164 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:55,165 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:55,165 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093296437] [2025-04-25 02:07:55,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1093296437] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:55,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:55,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:55,165 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277089828] [2025-04-25 02:07:55,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:55,165 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:07:55,165 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:55,165 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:07:55,165 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:07:55,165 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:55,165 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:55,166 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:55,166 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:55,211 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:55,211 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2025-04-25 02:07:55,211 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:55,211 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:55,211 INFO L85 PathProgramCache]: Analyzing trace with hash -2117818465, now seen corresponding path program 1 times [2025-04-25 02:07:55,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:55,211 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975213088] [2025-04-25 02:07:55,212 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:55,212 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:55,219 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 02:07:55,235 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 02:07:55,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:55,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:55,515 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:55,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:55,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975213088] [2025-04-25 02:07:55,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [975213088] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:55,515 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1705962463] [2025-04-25 02:07:55,515 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:55,515 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:55,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:55,517 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:55,518 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-25 02:07:55,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 25 statements into 1 equivalence classes. [2025-04-25 02:07:55,616 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 25 of 25 statements. [2025-04-25 02:07:55,616 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:55,616 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:55,618 INFO L256 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 10 conjuncts are in the unsatisfiable core [2025-04-25 02:07:55,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:55,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-04-25 02:07:55,693 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 32 [2025-04-25 02:07:55,730 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:55,730 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:07:55,894 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 02:07:55,894 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 14 [2025-04-25 02:07:55,910 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-25 02:07:55,910 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 54 [2025-04-25 02:07:55,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:55,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1705962463] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:07:55,975 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:07:55,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2025-04-25 02:07:55,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1405777151] [2025-04-25 02:07:55,976 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:07:55,976 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-25 02:07:55,976 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:55,976 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-25 02:07:55,976 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=80, Unknown=0, NotChecked=0, Total=110 [2025-04-25 02:07:55,976 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:55,976 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:55,977 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 6.363636363636363) internal successors, (70), 10 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:55,977 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:55,977 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,140 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,141 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:56,147 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2025-04-25 02:07:56,345 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-04-25 02:07:56,345 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:56,346 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:56,346 INFO L85 PathProgramCache]: Analyzing trace with hash 1651315817, now seen corresponding path program 1 times [2025-04-25 02:07:56,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:56,346 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563372394] [2025-04-25 02:07:56,346 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:56,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:56,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 101 statements into 1 equivalence classes. [2025-04-25 02:07:56,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 101 of 101 statements. [2025-04-25 02:07:56,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:56,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:56,484 INFO L134 CoverageAnalysis]: Checked inductivity of 167 backedges. 57 proven. 0 refuted. 0 times theorem prover too weak. 110 trivial. 0 not checked. [2025-04-25 02:07:56,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:56,484 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563372394] [2025-04-25 02:07:56,484 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563372394] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:56,485 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:56,485 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:56,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [948899343] [2025-04-25 02:07:56,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:56,485 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:07:56,485 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:56,485 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:07:56,485 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:07:56,485 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,485 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:56,485 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:56,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:56,485 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,517 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:56,518 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,518 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-04-25 02:07:56,518 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:56,518 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:56,518 INFO L85 PathProgramCache]: Analyzing trace with hash 1229881500, now seen corresponding path program 2 times [2025-04-25 02:07:56,518 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:56,518 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876891187] [2025-04-25 02:07:56,519 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:56,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:56,531 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 64 statements into 2 equivalence classes. [2025-04-25 02:07:56,541 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 64 of 64 statements. [2025-04-25 02:07:56,541 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:56,541 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:56,584 INFO L134 CoverageAnalysis]: Checked inductivity of 90 backedges. 51 proven. 0 refuted. 0 times theorem prover too weak. 39 trivial. 0 not checked. [2025-04-25 02:07:56,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:56,585 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876891187] [2025-04-25 02:07:56,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [876891187] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:56,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-25 02:07:56,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-25 02:07:56,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764767709] [2025-04-25 02:07:56,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:56,585 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-25 02:07:56,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:56,585 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-25 02:07:56,585 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-25 02:07:56,585 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,585 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:56,585 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 12.666666666666666) internal successors, (38), 3 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:56,585 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,585 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:56,585 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,585 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:56,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,651 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,651 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-04-25 02:07:56,651 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:56,652 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:56,652 INFO L85 PathProgramCache]: Analyzing trace with hash -812424583, now seen corresponding path program 1 times [2025-04-25 02:07:56,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:56,652 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594428525] [2025-04-25 02:07:56,652 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:56,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:56,661 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:07:56,666 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:07:56,666 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:56,666 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:56,710 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:56,711 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:56,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594428525] [2025-04-25 02:07:56,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594428525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:56,711 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909274320] [2025-04-25 02:07:56,711 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:56,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:56,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:56,716 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:56,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-25 02:07:56,806 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 47 statements into 1 equivalence classes. [2025-04-25 02:07:56,829 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 47 of 47 statements. [2025-04-25 02:07:56,829 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:56,829 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:56,830 INFO L256 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-04-25 02:07:56,831 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:56,861 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:56,861 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-25 02:07:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909274320] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-25 02:07:56,900 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-25 02:07:56,900 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2025-04-25 02:07:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132705482] [2025-04-25 02:07:56,901 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-25 02:07:56,901 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:07:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:56,901 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:07:56,901 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2025-04-25 02:07:56,901 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,901 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:56,901 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 11.125) internal successors, (89), 8 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:56,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:56,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,901 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,902 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:56,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:56,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:56,997 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:07:57,008 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-04-25 02:07:57,198 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,9 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:57,198 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:57,198 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:57,199 INFO L85 PathProgramCache]: Analyzing trace with hash -653606909, now seen corresponding path program 2 times [2025-04-25 02:07:57,199 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:57,199 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [107663966] [2025-04-25 02:07:57,199 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:57,199 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:57,219 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-04-25 02:07:57,244 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-04-25 02:07:57,247 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:57,247 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:57,395 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 150 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:57,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:57,395 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [107663966] [2025-04-25 02:07:57,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [107663966] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:57,396 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1051020483] [2025-04-25 02:07:57,396 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:57,396 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:57,396 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:57,398 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:57,399 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-25 02:07:57,510 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 89 statements into 2 equivalence classes. [2025-04-25 02:07:57,550 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 89 of 89 statements. [2025-04-25 02:07:57,550 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:57,550 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:57,552 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 02:07:57,553 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:57,613 INFO L134 CoverageAnalysis]: Checked inductivity of 175 backedges. 174 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-25 02:07:57,613 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:07:57,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1051020483] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:57,613 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 02:07:57,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2025-04-25 02:07:57,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [850806464] [2025-04-25 02:07:57,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:57,614 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:07:57,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:57,614 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:07:57,614 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-25 02:07:57,614 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:57,614 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:57,614 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.75) internal successors, (86), 8 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:07:57,615 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:57,755 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:57,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:57,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:07:57,756 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:57,763 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2025-04-25 02:07:57,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-25 02:07:57,956 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:57,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:57,957 INFO L85 PathProgramCache]: Analyzing trace with hash -1478087142, now seen corresponding path program 1 times [2025-04-25 02:07:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:57,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [381077451] [2025-04-25 02:07:57,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:57,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:57,975 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-25 02:07:57,984 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-25 02:07:57,984 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:57,984 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:58,105 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 72 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-25 02:07:58,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-25 02:07:58,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [381077451] [2025-04-25 02:07:58,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [381077451] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-25 02:07:58,106 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859930517] [2025-04-25 02:07:58,106 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-25 02:07:58,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-25 02:07:58,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 [2025-04-25 02:07:58,108 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-25 02:07:58,109 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-25 02:07:58,228 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 87 statements into 1 equivalence classes. [2025-04-25 02:07:58,266 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 87 of 87 statements. [2025-04-25 02:07:58,266 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:58,266 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-25 02:07:58,269 INFO L256 TraceCheckSpWp]: Trace formula consists of 426 conjuncts, 7 conjuncts are in the unsatisfiable core [2025-04-25 02:07:58,270 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-25 02:07:58,333 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 108 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2025-04-25 02:07:58,333 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-25 02:07:58,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859930517] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-25 02:07:58,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-25 02:07:58,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [9] total 10 [2025-04-25 02:07:58,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [364790255] [2025-04-25 02:07:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-25 02:07:58,334 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-04-25 02:07:58,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-25 02:07:58,334 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-04-25 02:07:58,334 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=51, Unknown=0, NotChecked=0, Total=90 [2025-04-25 02:07:58,334 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:58,334 INFO L485 AbstractCegarLoop]: Abstraction has currently 0 states, but on-demand construction may add more states [2025-04-25 02:07:58,334 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 10.25) internal successors, (82), 8 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-04-25 02:07:58,334 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,334 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:58,334 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,334 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,335 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:07:58,335 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:58,335 INFO L153 InterpolantAutomaton]: Switched to On-DemandConstruction mode: deterministic interpolant automaton has 2 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:58,474 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2025-04-25 02:07:58,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-04-25 02:07:58,679 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-25 02:07:58,679 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONERROR_FUNCTION === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-04-25 02:07:58,680 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-25 02:07:58,680 INFO L85 PathProgramCache]: Analyzing trace with hash -560860252, now seen corresponding path program 2 times [2025-04-25 02:07:58,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-25 02:07:58,680 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532290355] [2025-04-25 02:07:58,680 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-25 02:07:58,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-25 02:07:58,695 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 61 statements into 2 equivalence classes. [2025-04-25 02:07:58,747 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 61 of 61 statements. [2025-04-25 02:07:58,747 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-25 02:07:58,747 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:07:58,748 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-04-25 02:07:58,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 61 statements into 1 equivalence classes. [2025-04-25 02:07:58,834 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 61 of 61 statements. [2025-04-25 02:07:58,838 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-25 02:07:58,839 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-04-25 02:07:58,883 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-04-25 02:07:58,884 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-04-25 02:07:58,884 INFO L790 garLoopResultBuilder]: Registering result UNSAFE for location t2Err0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2025-04-25 02:07:58,884 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-25 02:07:58,885 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 2, 1, 1] [2025-04-25 02:07:58,886 INFO L320 ceAbstractionStarter]: Result for error location t2Thread1of1ForFork0 was UNSAFE (3/3) [2025-04-25 02:07:58,961 INFO L242 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2025-04-25 02:07:58,961 INFO L171 ceAbstractionStarter]: Computing trace abstraction results [2025-04-25 02:07:58,970 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:1000 (2)] Forceful destruction successful, exit code 0 [2025-04-25 02:07:58,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 25.04 02:07:58 BasicIcfg [2025-04-25 02:07:58,970 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-04-25 02:07:58,971 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-04-25 02:07:58,971 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-04-25 02:07:58,971 INFO L274 PluginConnector]: Witness Printer initialized [2025-04-25 02:07:58,971 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 25.04 02:07:47" (3/4) ... [2025-04-25 02:07:58,972 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-04-25 02:07:59,043 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 85. [2025-04-25 02:07:59,108 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.graphml [2025-04-25 02:07:59,109 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/witness.yml [2025-04-25 02:07:59,109 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-04-25 02:07:59,110 INFO L158 Benchmark]: Toolchain (without parser) took 12743.65ms. Allocated memory was 142.6MB in the beginning and 520.1MB in the end (delta: 377.5MB). Free memory was 110.9MB in the beginning and 435.0MB in the end (delta: -324.1MB). Peak memory consumption was 54.4MB. Max. memory is 16.1GB. [2025-04-25 02:07:59,110 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:07:59,110 INFO L158 Benchmark]: CACSL2BoogieTranslator took 487.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 78.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. [2025-04-25 02:07:59,110 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:07:59,110 INFO L158 Benchmark]: Boogie Preprocessor took 18.07ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. [2025-04-25 02:07:59,110 INFO L158 Benchmark]: RCFGBuilder took 492.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 74.9MB in the beginning and 385.8MB in the end (delta: -310.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. [2025-04-25 02:07:59,111 INFO L158 Benchmark]: TraceAbstraction took 11559.90ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 385.0MB in the beginning and 459.1MB in the end (delta: -74.1MB). Peak memory consumption was 290.5MB. Max. memory is 16.1GB. [2025-04-25 02:07:59,111 INFO L158 Benchmark]: Witness Printer took 138.13ms. Allocated memory is still 520.1MB. Free memory was 459.1MB in the beginning and 435.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-04-25 02:07:59,112 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.22ms. Allocated memory is still 201.3MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 487.23ms. Allocated memory is still 142.6MB. Free memory was 110.4MB in the beginning and 78.9MB in the end (delta: 31.5MB). Peak memory consumption was 33.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.75ms. Allocated memory is still 142.6MB. Free memory was 78.9MB in the beginning and 76.2MB in the end (delta: 2.7MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 18.07ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 74.9MB in the end (delta: 1.3MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 492.53ms. Allocated memory was 142.6MB in the beginning and 427.8MB in the end (delta: 285.2MB). Free memory was 74.9MB in the beginning and 385.8MB in the end (delta: -310.9MB). Peak memory consumption was 49.1MB. Max. memory is 16.1GB. * TraceAbstraction took 11559.90ms. Allocated memory was 427.8MB in the beginning and 520.1MB in the end (delta: 92.3MB). Free memory was 385.0MB in the beginning and 459.1MB in the end (delta: -74.1MB). Peak memory consumption was 290.5MB. Max. memory is 16.1GB. * Witness Printer took 138.13ms. Allocated memory is still 520.1MB. Free memory was 459.1MB in the beginning and 435.0MB in the end (delta: 24.1MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 635, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 635, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 475, independent: 466, independent conditional: 0, independent unconditional: 466, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 475, independent: 463, independent conditional: 0, independent unconditional: 463, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 635, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 475, unknown conditional: 0, unknown unconditional: 475] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 466, Positive conditional cache size: 0, Positive unconditional cache size: 466, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.1s, Number of persistent set computation: 64, Number of trivial persistent sets: 10, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 635, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 635, independent: 626, independent conditional: 0, independent unconditional: 626, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 475, independent: 466, independent conditional: 0, independent unconditional: 466, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 475, independent: 463, independent conditional: 0, independent unconditional: 463, dependent: 12, dependent conditional: 0, dependent unconditional: 12, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 12, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 55, independent: 5, independent conditional: 0, independent unconditional: 5, dependent: 51, dependent conditional: 0, dependent unconditional: 51, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 635, independent: 160, independent conditional: 0, independent unconditional: 160, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 475, unknown conditional: 0, unknown unconditional: 475] , Statistics on independence cache: Total cache size (in pairs): 475, Positive cache size: 466, Positive conditional cache size: 0, Positive unconditional cache size: 466, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 99, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 99, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 4, Number of trivial persistent sets: 2, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 99, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 99, independent: 97, independent conditional: 0, independent unconditional: 97, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 3, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 0, independent: 0, independent conditional: 0, independent unconditional: 0, dependent: 0, dependent conditional: 0, dependent unconditional: 0, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 99, independent: 94, independent conditional: 0, independent unconditional: 94, dependent: 2, dependent conditional: 0, dependent unconditional: 2, unknown: 3, unknown conditional: 0, unknown unconditional: 3] , Statistics on independence cache: Total cache size (in pairs): 478, Positive cache size: 469, Positive conditional cache size: 0, Positive unconditional cache size: 469, Negative cache size: 9, Negative conditional cache size: 0, Negative unconditional cache size: 9, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - StatisticsResult: Partial order reduction statistics Independence relation #1 benchmarks: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 664, independent: 654, independent conditional: 0, independent unconditional: 654, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 664, independent: 654, independent conditional: 0, independent unconditional: 654, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 664, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 527, Positive conditional cache size: 0, Positive unconditional cache size: 527, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0, Persistent sets #1 benchmarks: Persistent set computation time: 0.0s, Number of persistent set computation: 74, Number of trivial persistent sets: 2, Underlying independence relation: ThreadSeparatingIndependenceRelation.Independence Queries: [ total: 664, independent: 654, independent conditional: 0, independent unconditional: 654, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ThreadSeparatingIndependenceRelation.Statistics on underlying relation: CachedIndependenceRelation.Independence Queries: [ total: 664, independent: 654, independent conditional: 0, independent unconditional: 654, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: UnionIndependenceRelation.Independence Queries: [ total: 59, independent: 58, independent conditional: 0, independent unconditional: 58, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , UnionIndependenceRelation.Statistics on underlying relations: [ SyntacticIndependenceRelation.Independence Queries: [ total: 59, independent: 55, independent conditional: 0, independent unconditional: 55, dependent: 4, dependent conditional: 0, dependent unconditional: 4, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , ProtectedIndependenceRelation.Statistics on underlying relation: SemanticIndependenceRelation.Independence Queries: [ total: 4, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 1, dependent conditional: 0, dependent unconditional: 1, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , SemanticIndependenceRelation.Query Time [ms]: [ total: 11, independent: 3, independent conditional: 0, independent unconditional: 3, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Symbolic Condition Computations: 0, Symbolic Conditions with UNKNOWN Satisfiability: 0, Protected Queries: 0 ], Cache Queries: [ total: 664, independent: 596, independent conditional: 0, independent unconditional: 596, dependent: 9, dependent conditional: 0, dependent unconditional: 9, unknown: 59, unknown conditional: 0, unknown unconditional: 59] , Statistics on independence cache: Total cache size (in pairs): 537, Positive cache size: 527, Positive conditional cache size: 0, Positive unconditional cache size: 527, Negative cache size: 10, Negative conditional cache size: 0, Negative unconditional cache size: 10, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0, Independence queries for same thread: 0 - PositiveResult [Line: 941]: a call to reach_error is unreachable For all program executions holds that a call to reach_error is unreachable at this location - CounterExampleResult [Line: 941]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L935] 0 static int top=0; [L936] 0 static unsigned int arr[(5)]; [L937] 0 pthread_mutex_t m; [L938] 0 _Bool flag=(0); [L1021] 0 pthread_t id1, id2; [L1023] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, m={4:0}, top=0] [L1024] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, id1=-1, id2=0, m={4:0}, top=0] [L1006] 2 int i; [L1007] 2 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L990] 1 int i; [L991] 1 unsigned int tmp; [L992] 1 i=0 VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1010] COND FALSE 2 !(\read(flag)) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=1, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=1, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=0, i=0, m={4:0}, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=0, m={4:0}, tmp=1, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=1, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=1, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=1, m={4:0}, tmp=3, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=3, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=3, top=0] [L995] 1 tmp = __VERIFIER_nondet_uint() [L996] CALL 1 assume_abort_if_not(tmp < (5)) [L23] COND FALSE 1 !(!cond) [L996] RET 1 assume_abort_if_not(tmp < (5)) [L997] CALL, EXPR 1 push(arr,tmp) [L962] COND FALSE 1 !(top==(5)) [L969] CALL, EXPR 1 get_top() [L954] 1 return top; [L969] RET, EXPR 1 get_top() [L969] 1 stack[get_top()] = x [L970] CALL 1 inc_top() [L946] 1 top++ [L970] RET 1 inc_top() [L972] 1 return 0; [L997] RET, EXPR 1 push(arr,tmp) [L997] COND FALSE 1 !(push(arr,tmp)==(-1)) [L999] 1 flag=(1) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=2, m={4:0}, tmp=2, top=1] [L992] 1 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=2, top=1] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND FALSE 2 !(get_top()==0) [L983] CALL 2 dec_top() [L950] 2 top-- [L983] RET 2 dec_top() [L984] CALL, EXPR 2 get_top() [L954] 2 return top; [L984] RET, EXPR 2 get_top() [L984] EXPR 2 stack[get_top()] [L984] 2 return stack[get_top()]; [L1012] RET, EXPR 2 pop(arr) [L1012] COND FALSE 2 !(!(pop(arr)!=(-2))) [L1007] 2 i++ VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L1007] COND TRUE 2 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=4, m={4:0}, top=0] [L992] COND TRUE 1 i<(5) VAL [\at(arg, Pre)={0:0}, arg={0:0}, arr={3:0}, flag=1, i=3, m={4:0}, tmp=2, top=0] [L1010] COND TRUE 2 \read(flag) [L1012] CALL, EXPR 2 pop(arr) [L976] CALL, EXPR 2 get_top() [L954] 2 return top; [L976] RET, EXPR 2 get_top() [L976] COND TRUE 2 get_top()==0 [L979] 2 return (-2); [L1012] RET, EXPR 2 pop(arr) [L1012] COND TRUE 2 !(pop(arr)!=(-2)) [L1013] CALL 2 error() [L941] 2 reach_error() VAL [arr={3:0}, flag=1, m={4:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t1Thread1of1ForFork1 with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 7.5s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 3, EmptinessCheckTime: 1.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 61, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 3.7s InterpolantComputationTime, 659 NumberOfCodeBlocks, 659 NumberOfCodeBlocksAsserted, 23 NumberOfCheckSat, 788 ConstructedInterpolants, 9 QuantifiedInterpolants, 3286 SizeOfPredicates, 43 NumberOfNonLiveVariables, 1611 ConjunctsInSsa, 48 ConjunctsInUnsatCore, 16 InterpolantComputations, 5 PerfectInterpolantSequences, 369/597 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 - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: ULTIMATE.start with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 0.0s, OverallIterations: 0, TraceHistogramMax: 0, PathProgramHistogramMax: 0, EmptinessCheckTime: 0.0s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - StatisticsResult: Ultimate Automizer benchmark data for errors in thread instance: t2Thread1of1ForFork0 with 1 thread instances CFG has 5 procedures, 55 locations, 64 edges, 6 error locations. Started 1 CEGAR loops. OverallTime: 3.8s, OverallIterations: 8, TraceHistogramMax: 0, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.7s, AutomataDifference: 0.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: , PredicateUnifierStatistics: No data available, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=0occurred in iteration=0, InterpolantAutomatonStates: 42, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.3s InterpolantComputationTime, 745 NumberOfCodeBlocks, 745 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 743 ConstructedInterpolants, 0 QuantifiedInterpolants, 2393 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1289 ConjunctsInSsa, 28 ConjunctsInUnsatCore, 13 InterpolantComputations, 5 PerfectInterpolantSequences, 768/901 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-04-25 02:07:59,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UGemCutter-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE