./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 798a7b37 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 10:39:28,489 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 10:39:28,549 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 10:39:28,554 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 10:39:28,555 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 10:39:28,574 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 10:39:28,574 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 10:39:28,574 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 10:39:28,574 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 10:39:28,574 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 10:39:28,574 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 10:39:28,575 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 10:39:28,575 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 10:39:28,575 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 10:39:28,576 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:39:28,576 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 10:39:28,576 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! overflow) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 52ed361cdf08860b8c7c7d564ef95393de2d3a38663ac135cf0da9ded1f39b3f [2025-03-04 10:39:28,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 10:39:28,785 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 10:39:28,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 10:39:28,789 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 10:39:28,789 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 10:39:28,790 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2025-03-04 10:39:29,906 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b259adf/dfdabc722c1d4fc99d72c6c1906c2b8b/FLAGd7a99c3a6 [2025-03-04 10:39:30,183 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 10:39:30,184 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/ldv-sets/test_mutex_unbounded-2.i [2025-03-04 10:39:30,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b259adf/dfdabc722c1d4fc99d72c6c1906c2b8b/FLAGd7a99c3a6 [2025-03-04 10:39:30,470 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d1b259adf/dfdabc722c1d4fc99d72c6c1906c2b8b [2025-03-04 10:39:30,473 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 10:39:30,475 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 10:39:30,476 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 10:39:30,477 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 10:39:30,480 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 10:39:30,481 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,482 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@203e2983 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30, skipping insertion in model container [2025-03-04 10:39:30,483 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,510 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 10:39:30,692 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:39:30,699 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 10:39:30,749 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 10:39:30,773 INFO L204 MainTranslator]: Completed translation [2025-03-04 10:39:30,774 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30 WrapperNode [2025-03-04 10:39:30,774 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 10:39:30,775 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 10:39:30,775 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 10:39:30,775 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 10:39:30,779 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,791 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,813 INFO L138 Inliner]: procedures = 142, calls = 66, calls flagged for inlining = 14, calls inlined = 13, statements flattened = 177 [2025-03-04 10:39:30,813 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 10:39:30,814 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 10:39:30,814 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 10:39:30,815 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 10:39:30,820 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,820 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,827 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,858 INFO L175 MemorySlicer]: Split 28 memory accesses to 2 slices as follows [2, 26]. 93 percent of accesses are in the largest equivalence class. The 6 initializations are split as follows [2, 4]. The 7 writes are split as follows [0, 7]. [2025-03-04 10:39:30,859 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,859 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,868 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,872 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,873 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,877 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 10:39:30,883 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 10:39:30,883 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 10:39:30,883 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 10:39:30,884 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (1/1) ... [2025-03-04 10:39:30,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 10:39:30,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:30,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-04 10:39:30,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-04 10:39:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2025-03-04 10:39:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2025-03-04 10:39:30,933 INFO L130 BoogieDeclarations]: Found specification of procedure __ldv_list_add [2025-03-04 10:39:30,933 INFO L138 BoogieDeclarations]: Found implementation of procedure __ldv_list_add [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_add [2025-03-04 10:39:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_add [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_is_in_set [2025-03-04 10:39:30,934 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_is_in_set [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 10:39:30,934 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 10:39:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 10:39:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_list_del [2025-03-04 10:39:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_list_del [2025-03-04 10:39:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 10:39:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 10:39:30,935 INFO L130 BoogieDeclarations]: Found specification of procedure ldv_successful_malloc [2025-03-04 10:39:30,935 INFO L138 BoogieDeclarations]: Found implementation of procedure ldv_successful_malloc [2025-03-04 10:39:30,936 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 10:39:30,936 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 10:39:31,060 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 10:39:31,062 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 10:39:31,266 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L667: havoc ldv_set_empty_#t~ret31#1; [2025-03-04 10:39:31,267 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: havoc ldv_list_empty_#t~mem10#1.base, ldv_list_empty_#t~mem10#1.offset; [2025-03-04 10:39:31,303 INFO L? ?]: Removed 73 outVars from TransFormulas that were not future-live. [2025-03-04 10:39:31,303 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 10:39:31,311 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 10:39:31,311 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 10:39:31,311 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:39:31 BoogieIcfgContainer [2025-03-04 10:39:31,311 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 10:39:31,313 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 10:39:31,313 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 10:39:31,316 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 10:39:31,316 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 10:39:30" (1/3) ... [2025-03-04 10:39:31,316 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d42b926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:39:31, skipping insertion in model container [2025-03-04 10:39:31,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 10:39:30" (2/3) ... [2025-03-04 10:39:31,317 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d42b926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 10:39:31, skipping insertion in model container [2025-03-04 10:39:31,317 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:39:31" (3/3) ... [2025-03-04 10:39:31,318 INFO L128 eAbstractionObserver]: Analyzing ICFG test_mutex_unbounded-2.i [2025-03-04 10:39:31,327 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 10:39:31,328 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG test_mutex_unbounded-2.i that has 7 procedures, 79 locations, 1 initial locations, 5 loop locations, and 2 error locations. [2025-03-04 10:39:31,360 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 10:39:31,367 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2cab35d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 10:39:31,367 INFO L334 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2025-03-04 10:39:31,370 INFO L276 IsEmpty]: Start isEmpty. Operand has 79 states, 57 states have (on average 1.263157894736842) internal successors, (72), 59 states have internal predecessors, (72), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2025-03-04 10:39:31,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:39:31,375 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:31,375 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:31,376 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:39:31,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:31,380 INFO L85 PathProgramCache]: Analyzing trace with hash -1578314931, now seen corresponding path program 1 times [2025-03-04 10:39:31,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:31,386 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463162619] [2025-03-04 10:39:31,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:31,387 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:31,473 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:39:31,497 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:39:31,497 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:31,498 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:31,610 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:31,611 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:31,611 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463162619] [2025-03-04 10:39:31,611 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [463162619] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:31,612 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:31,612 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 10:39:31,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281441402] [2025-03-04 10:39:31,613 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:31,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2025-03-04 10:39:31,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:31,628 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2025-03-04 10:39:31,628 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:39:31,630 INFO L87 Difference]: Start difference. First operand has 79 states, 57 states have (on average 1.263157894736842) internal successors, (72), 59 states have internal predecessors, (72), 13 states have call successors, (13), 6 states have call predecessors, (13), 6 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:39:31,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:31,650 INFO L93 Difference]: Finished difference Result 150 states and 191 transitions. [2025-03-04 10:39:31,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2025-03-04 10:39:31,651 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 10:39:31,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:31,657 INFO L225 Difference]: With dead ends: 150 [2025-03-04 10:39:31,657 INFO L226 Difference]: Without dead ends: 25 [2025-03-04 10:39:31,661 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2025-03-04 10:39:31,664 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:31,665 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:31,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2025-03-04 10:39:31,683 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2025-03-04 10:39:31,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 17 states have (on average 1.1176470588235294) internal successors, (19), 18 states have internal predecessors, (19), 3 states have call successors, (3), 3 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-04 10:39:31,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 25 transitions. [2025-03-04 10:39:31,689 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 25 transitions. Word has length 22 [2025-03-04 10:39:31,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:31,689 INFO L471 AbstractCegarLoop]: Abstraction has 25 states and 25 transitions. [2025-03-04 10:39:31,689 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:39:31,689 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 25 transitions. [2025-03-04 10:39:31,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2025-03-04 10:39:31,690 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:31,690 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:31,690 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 10:39:31,690 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:39:31,691 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:31,691 INFO L85 PathProgramCache]: Analyzing trace with hash -2088849108, now seen corresponding path program 1 times [2025-03-04 10:39:31,691 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:31,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938336064] [2025-03-04 10:39:31,691 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:31,691 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:31,712 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 22 statements into 1 equivalence classes. [2025-03-04 10:39:31,748 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 22 of 22 statements. [2025-03-04 10:39:31,749 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:31,749 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:31,888 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 10:39:31,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:31,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938336064] [2025-03-04 10:39:31,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938336064] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:31,889 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 10:39:31,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 10:39:31,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [940489721] [2025-03-04 10:39:31,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:31,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 10:39:31,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:31,890 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 10:39:31,890 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:31,891 INFO L87 Difference]: Start difference. First operand 25 states and 25 transitions. Second operand has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:39:31,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:31,907 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2025-03-04 10:39:31,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 10:39:31,908 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2025-03-04 10:39:31,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:31,908 INFO L225 Difference]: With dead ends: 34 [2025-03-04 10:39:31,909 INFO L226 Difference]: Without dead ends: 32 [2025-03-04 10:39:31,909 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 10:39:31,910 INFO L435 NwaCegarLoop]: 21 mSDtfsCounter, 1 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:31,911 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 58 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:31,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2025-03-04 10:39:31,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2025-03-04 10:39:31,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 22 states have (on average 1.0909090909090908) internal successors, (24), 23 states have internal predecessors, (24), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:39:31,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 34 transitions. [2025-03-04 10:39:31,917 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 34 transitions. Word has length 22 [2025-03-04 10:39:31,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:31,918 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 34 transitions. [2025-03-04 10:39:31,919 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.333333333333333) internal successors, (16), 4 states have internal predecessors, (16), 2 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2025-03-04 10:39:31,919 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 34 transitions. [2025-03-04 10:39:31,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2025-03-04 10:39:31,920 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:31,921 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-03-04 10:39:31,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-04 10:39:31,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:39:31,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:31,922 INFO L85 PathProgramCache]: Analyzing trace with hash -1186035840, now seen corresponding path program 1 times [2025-03-04 10:39:31,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:31,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [241121176] [2025-03-04 10:39:31,922 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:31,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:31,946 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:39:31,982 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:39:31,982 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:31,982 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:32,127 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:39:32,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [241121176] [2025-03-04 10:39:32,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [241121176] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:32,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1446461222] [2025-03-04 10:39:32,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:32,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:32,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:32,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:39:32,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-04 10:39:32,246 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 42 statements into 1 equivalence classes. [2025-03-04 10:39:32,296 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 42 of 42 statements. [2025-03-04 10:39:32,297 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:32,297 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:32,299 INFO L256 TraceCheckSpWp]: Trace formula consists of 343 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:39:32,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:32,360 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:39:32,360 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 10:39:32,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1446461222] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 10:39:32,361 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 10:39:32,361 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2025-03-04 10:39:32,361 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510501436] [2025-03-04 10:39:32,361 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 10:39:32,361 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-04 10:39:32,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:32,362 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-04 10:39:32,363 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:39:32,363 INFO L87 Difference]: Start difference. First operand 32 states and 34 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:39:32,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:32,398 INFO L93 Difference]: Finished difference Result 32 states and 34 transitions. [2025-03-04 10:39:32,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 10:39:32,398 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 42 [2025-03-04 10:39:32,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:32,398 INFO L225 Difference]: With dead ends: 32 [2025-03-04 10:39:32,398 INFO L226 Difference]: Without dead ends: 31 [2025-03-04 10:39:32,399 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 10:39:32,399 INFO L435 NwaCegarLoop]: 24 mSDtfsCounter, 1 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:32,399 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 103 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:32,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2025-03-04 10:39:32,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2025-03-04 10:39:32,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 22 states have (on average 1.0454545454545454) internal successors, (23), 22 states have internal predecessors, (23), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2025-03-04 10:39:32,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 33 transitions. [2025-03-04 10:39:32,403 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 33 transitions. Word has length 42 [2025-03-04 10:39:32,404 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:32,404 INFO L471 AbstractCegarLoop]: Abstraction has 31 states and 33 transitions. [2025-03-04 10:39:32,404 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:39:32,404 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 33 transitions. [2025-03-04 10:39:32,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-04 10:39:32,405 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:32,405 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-03-04 10:39:32,411 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-04 10:39:32,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:32,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:39:32,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:32,606 INFO L85 PathProgramCache]: Analyzing trace with hash 1887594665, now seen corresponding path program 1 times [2025-03-04 10:39:32,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:32,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1586739724] [2025-03-04 10:39:32,606 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:32,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:32,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:39:32,633 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:39:32,634 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:32,634 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:32,732 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:39:32,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:32,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1586739724] [2025-03-04 10:39:32,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1586739724] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:32,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211393016] [2025-03-04 10:39:32,733 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 10:39:32,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:32,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:32,735 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:39:32,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-04 10:39:32,819 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-04 10:39:32,856 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-04 10:39:32,856 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 10:39:32,856 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:32,858 INFO L256 TraceCheckSpWp]: Trace formula consists of 344 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-04 10:39:32,862 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:32,901 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:39:32,901 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:32,988 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2025-03-04 10:39:32,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211393016] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:32,988 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:39:32,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 11 [2025-03-04 10:39:32,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037546121] [2025-03-04 10:39:32,988 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:32,988 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-04 10:39:32,988 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:32,989 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-04 10:39:32,989 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:32,989 INFO L87 Difference]: Start difference. First operand 31 states and 33 transitions. Second operand has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:39:33,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:33,057 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2025-03-04 10:39:33,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 10:39:33,057 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) Word has length 43 [2025-03-04 10:39:33,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:33,058 INFO L225 Difference]: With dead ends: 53 [2025-03-04 10:39:33,058 INFO L226 Difference]: Without dead ends: 52 [2025-03-04 10:39:33,059 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 79 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 10:39:33,059 INFO L435 NwaCegarLoop]: 20 mSDtfsCounter, 0 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:33,059 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 114 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 10:39:33,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2025-03-04 10:39:33,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2025-03-04 10:39:33,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 37 states have (on average 1.027027027027027) internal successors, (38), 37 states have internal predecessors, (38), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2025-03-04 10:39:33,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 60 transitions. [2025-03-04 10:39:33,069 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 60 transitions. Word has length 43 [2025-03-04 10:39:33,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:33,070 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 60 transitions. [2025-03-04 10:39:33,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.5454545454545454) internal successors, (39), 12 states have internal predecessors, (39), 6 states have call successors, (11), 1 states have call predecessors, (11), 1 states have return successors, (11), 6 states have call predecessors, (11), 6 states have call successors, (11) [2025-03-04 10:39:33,070 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 60 transitions. [2025-03-04 10:39:33,071 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2025-03-04 10:39:33,071 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 10:39:33,072 INFO L218 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1] [2025-03-04 10:39:33,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-04 10:39:33,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2025-03-04 10:39:33,276 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW] === [2025-03-04 10:39:33,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 10:39:33,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1728024275, now seen corresponding path program 2 times [2025-03-04 10:39:33,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 10:39:33,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172766359] [2025-03-04 10:39:33,277 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:39:33,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 10:39:33,311 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-04 10:39:33,317 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 103 statements. [2025-03-04 10:39:33,317 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:39:33,317 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:33,349 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 10:39:33,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 10:39:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172766359] [2025-03-04 10:39:33,349 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172766359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 10:39:33,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692169245] [2025-03-04 10:39:33,349 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 10:39:33,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:33,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 10:39:33,352 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 10:39:33,352 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-04 10:39:33,468 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 103 statements into 2 equivalence classes. [2025-03-04 10:39:33,490 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 23 of 103 statements. [2025-03-04 10:39:33,490 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 10:39:33,490 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 10:39:33,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 4 conjuncts are in the unsatisfiable core [2025-03-04 10:39:33,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 10:39:33,552 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 10:39:33,552 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 10:39:33,678 INFO L134 CoverageAnalysis]: Checked inductivity of 200 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 176 trivial. 0 not checked. [2025-03-04 10:39:33,678 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692169245] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 10:39:33,679 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 10:39:33,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 4 [2025-03-04 10:39:33,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [902021824] [2025-03-04 10:39:33,679 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 10:39:33,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 10:39:33,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 10:39:33,679 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 10:39:33,679 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 10:39:33,679 INFO L87 Difference]: Start difference. First operand 52 states and 60 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:39:33,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 10:39:33,696 INFO L93 Difference]: Finished difference Result 52 states and 60 transitions. [2025-03-04 10:39:33,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-04 10:39:33,697 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 103 [2025-03-04 10:39:33,697 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 10:39:33,697 INFO L225 Difference]: With dead ends: 52 [2025-03-04 10:39:33,697 INFO L226 Difference]: Without dead ends: 0 [2025-03-04 10:39:33,697 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 210 GetRequests, 203 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2025-03-04 10:39:33,698 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 0 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 10:39:33,698 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 65 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 10:39:33,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2025-03-04 10:39:33,698 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2025-03-04 10:39:33,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-04 10:39:33,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2025-03-04 10:39:33,698 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 103 [2025-03-04 10:39:33,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 10:39:33,698 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2025-03-04 10:39:33,699 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (5), 1 states have call predecessors, (5), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-04 10:39:33,699 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2025-03-04 10:39:33,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2025-03-04 10:39:33,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 2 remaining) [2025-03-04 10:39:33,701 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 2 remaining) [2025-03-04 10:39:33,708 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-03-04 10:39:33,906 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 10:39:33,908 INFO L422 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1] [2025-03-04 10:39:33,909 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2025-03-04 10:39:33,995 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 10:39:34,004 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 10:39:34 BoogieIcfgContainer [2025-03-04 10:39:34,005 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 10:39:34,005 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 10:39:34,005 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 10:39:34,005 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 10:39:34,007 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 10:39:31" (3/4) ... [2025-03-04 10:39:34,008 INFO L146 WitnessPrinter]: Generating witness for correct program [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure reach_error [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_list_add [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_is_in_set [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_list_del [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure ldv_successful_malloc [2025-03-04 10:39:34,011 INFO L385 IcfgBacktranslator]: Ignoring RootEdge to procedure __ldv_list_add [2025-03-04 10:39:34,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 38 nodes and edges [2025-03-04 10:39:34,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2025-03-04 10:39:34,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:39:34,015 INFO L919 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2025-03-04 10:39:34,075 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 10:39:34,076 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 10:39:34,076 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 10:39:34,076 INFO L158 Benchmark]: Toolchain (without parser) took 3601.89ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 103.9MB in the beginning and 270.1MB in the end (delta: -166.1MB). Peak memory consumption was 19.6MB. Max. memory is 16.1GB. [2025-03-04 10:39:34,077 INFO L158 Benchmark]: CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:39:34,078 INFO L158 Benchmark]: CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 83.6MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 10:39:34,078 INFO L158 Benchmark]: Boogie Procedure Inliner took 38.22ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:39:34,078 INFO L158 Benchmark]: Boogie Preprocessor took 68.58ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 76.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:39:34,078 INFO L158 Benchmark]: IcfgBuilder took 428.45ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 52.3MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2025-03-04 10:39:34,079 INFO L158 Benchmark]: TraceAbstraction took 2691.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 51.1MB in the beginning and 278.2MB in the end (delta: -227.2MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 10:39:34,079 INFO L158 Benchmark]: Witness Printer took 70.68ms. Allocated memory is still 327.2MB. Free memory was 278.2MB in the beginning and 270.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 10:39:34,080 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.04ms. Allocated memory is still 201.3MB. Free memory is still 124.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 298.30ms. Allocated memory is still 142.6MB. Free memory was 103.9MB in the beginning and 83.6MB in the end (delta: 20.4MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 38.22ms. Allocated memory is still 142.6MB. Free memory was 83.6MB in the beginning and 81.6MB in the end (delta: 1.9MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 68.58ms. Allocated memory is still 142.6MB. Free memory was 81.6MB in the beginning and 76.2MB in the end (delta: 5.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * IcfgBuilder took 428.45ms. Allocated memory is still 142.6MB. Free memory was 76.2MB in the beginning and 52.3MB in the end (delta: 23.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 2691.80ms. Allocated memory was 142.6MB in the beginning and 327.2MB in the end (delta: 184.5MB). Free memory was 51.1MB in the beginning and 278.2MB in the end (delta: -227.2MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 70.68ms. Allocated memory is still 327.2MB. Free memory was 278.2MB in the beginning and 270.1MB in the end (delta: 8.2MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 693]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 79 locations, 2 error locations. Started 1 CEGAR loops. OverallTime: 2.6s, OverallIterations: 5, TraceHistogramMax: 5, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 0.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2 mSDsluCounter, 428 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 256 mSDsCounter, 3 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 118 IncrementalHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 3 mSolverCounterUnsat, 172 mSDtfsCounter, 118 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 350 GetRequests, 325 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=79occurred in iteration=0, InterpolantAutomatonStates: 27, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.9s InterpolantComputationTime, 420 NumberOfCodeBlocks, 260 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 556 ConstructedInterpolants, 0 QuantifiedInterpolants, 914 SizeOfPredicates, 2 NumberOfNonLiveVariables, 885 ConjunctsInSsa, 14 ConjunctsInUnsatCore, 10 InterpolantComputations, 3 PerfectInterpolantSequences, 599/698 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 2 specifications checked. All of them hold - InvariantResult [Line: 693]: Location Invariant Derived location invariant: (((N <= 2147483647) && (1 <= i)) || ((i == 0) && (N <= 2147483647))) RESULT: Ultimate proved your program to be correct! [2025-03-04 10:39:34,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE