./Ultimate.py --spec ../sv-benchmarks/c/properties/no-overflow.prp --file ../sv-benchmarks/c/seq-pthread/cs_lazy.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/seq-pthread/cs_lazy.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 b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f --- Real Ultimate output --- This is Ultimate 0.3.0-?-798a7b3-m [2025-03-04 11:35:22,891 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-04 11:35:22,943 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2025-03-04 11:35:22,948 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-04 11:35:22,950 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-04 11:35:22,968 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-04 11:35:22,969 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-04 11:35:22,969 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-04 11:35:22,969 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-04 11:35:22,969 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-04 11:35:22,969 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-04 11:35:22,969 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-04 11:35:22,969 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Use SBE=true [2025-03-04 11:35:22,970 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-04 11:35:22,970 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-04 11:35:22,971 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-04 11:35:22,971 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:22,972 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-04 11:35:22,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-04 11:35:22,972 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 -> b26873cfd586f35040b8fa56225beaa479db089ab89500d17d6395862bf9072f [2025-03-04 11:35:23,195 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-04 11:35:23,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-04 11:35:23,204 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-04 11:35:23,205 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-04 11:35:23,205 INFO L274 PluginConnector]: CDTParser initialized [2025-03-04 11:35:23,206 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-03-04 11:35:24,333 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f3107aa/7986ec7e0a9a4a36adfa56b9f501be9d/FLAGf3eeecd9b [2025-03-04 11:35:24,644 INFO L384 CDTParser]: Found 1 translation units. [2025-03-04 11:35:24,647 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2025-03-04 11:35:24,664 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f3107aa/7986ec7e0a9a4a36adfa56b9f501be9d/FLAGf3eeecd9b [2025-03-04 11:35:24,892 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/64f3107aa/7986ec7e0a9a4a36adfa56b9f501be9d [2025-03-04 11:35:24,894 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-04 11:35:24,895 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-04 11:35:24,896 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:24,896 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-04 11:35:24,899 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-04 11:35:24,899 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:24" (1/1) ... [2025-03-04 11:35:24,900 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2629c86b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:24, skipping insertion in model container [2025-03-04 11:35:24,900 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 04.03 11:35:24" (1/1) ... [2025-03-04 11:35:24,927 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-04 11:35:25,214 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:25,225 INFO L200 MainTranslator]: Completed pre-run [2025-03-04 11:35:25,296 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-04 11:35:25,320 INFO L204 MainTranslator]: Completed translation [2025-03-04 11:35:25,320 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25 WrapperNode [2025-03-04 11:35:25,320 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-04 11:35:25,321 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:25,321 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-04 11:35:25,321 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-04 11:35:25,326 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,341 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,363 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 533 [2025-03-04 11:35:25,363 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-04 11:35:25,364 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-04 11:35:25,364 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-04 11:35:25,364 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-04 11:35:25,371 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,371 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,383 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,410 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 10, 10, 10, 25, 16, 9, 3, 8, 9, 0, 3, 5, 9]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 4, 4, 4, 8, 8, 2, 0, 2, 0, 0, 0, 0, 0]. The 32 writes are split as follows [0, 2, 2, 2, 10, 4, 3, 1, 3, 1, 0, 1, 2, 1]. [2025-03-04 11:35:25,413 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,414 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,433 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,435 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,438 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,440 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,444 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-04 11:35:25,445 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-04 11:35:25,445 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-04 11:35:25,445 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-04 11:35:25,446 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (1/1) ... [2025-03-04 11:35:25,449 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-04 11:35:25,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:25,467 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 11:35:25,469 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 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2025-03-04 11:35:25,484 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-04 11:35:25,485 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2025-03-04 11:35:25,486 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2025-03-04 11:35:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2025-03-04 11:35:25,487 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-04 11:35:25,487 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-04 11:35:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-04 11:35:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2025-03-04 11:35:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2025-03-04 11:35:25,489 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2025-03-04 11:35:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-04 11:35:25,490 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2025-03-04 11:35:25,490 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2025-03-04 11:35:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2025-03-04 11:35:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2025-03-04 11:35:25,491 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-04 11:35:25,491 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-04 11:35:25,669 INFO L256 CfgBuilder]: Building ICFG [2025-03-04 11:35:25,670 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-04 11:35:25,992 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-03-04 11:35:25,992 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-04 11:35:25,992 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L714-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-04 11:35:25,992 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-03-04 11:35:25,992 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-04 11:35:25,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L710-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-04 11:35:25,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: assume 0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296);thread3_#res#1.base, thread3_#res#1.offset := 0, 0; [2025-03-04 11:35:25,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-1: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2025-03-04 11:35:25,993 INFO L1325 $ProcedureCfgBuilder]: dead code at ProgramPoint L712-2: SUMMARY for call __CS_cs(); srcloc: null [2025-03-04 11:35:26,294 INFO L? ?]: Removed 98 outVars from TransFormulas that were not future-live. [2025-03-04 11:35:26,294 INFO L307 CfgBuilder]: Performing block encoding [2025-03-04 11:35:26,301 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-04 11:35:26,301 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-04 11:35:26,302 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:26 BoogieIcfgContainer [2025-03-04 11:35:26,302 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-04 11:35:26,303 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-04 11:35:26,303 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-04 11:35:26,306 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-04 11:35:26,306 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 04.03 11:35:24" (1/3) ... [2025-03-04 11:35:26,306 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31822ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:26, skipping insertion in model container [2025-03-04 11:35:26,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 04.03 11:35:25" (2/3) ... [2025-03-04 11:35:26,307 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31822ee1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 04.03 11:35:26, skipping insertion in model container [2025-03-04 11:35:26,307 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:26" (3/3) ... [2025-03-04 11:35:26,307 INFO L128 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2025-03-04 11:35:26,316 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-04 11:35:26,317 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG cs_lazy.i that has 7 procedures, 189 locations, 1 initial locations, 2 loop locations, and 16 error locations. [2025-03-04 11:35:26,354 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-04 11:35:26,361 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;@112e92c0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-04 11:35:26,362 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2025-03-04 11:35:26,364 INFO L276 IsEmpty]: Start isEmpty. Operand has 189 states, 129 states have (on average 1.558139534883721) internal successors, (201), 145 states have internal predecessors, (201), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) [2025-03-04 11:35:26,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2025-03-04 11:35:26,367 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:26,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2025-03-04 11:35:26,368 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:26,371 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:26,371 INFO L85 PathProgramCache]: Analyzing trace with hash 315842986, now seen corresponding path program 1 times [2025-03-04 11:35:26,376 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:26,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-04 11:35:26,376 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:26,438 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 5 statements into 1 equivalence classes. [2025-03-04 11:35:26,477 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 5 of 5 statements. [2025-03-04 11:35:26,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:26,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:26,588 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 11:35:26,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:26,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819765268] [2025-03-04 11:35:26,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819765268] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:26,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:26,590 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-04 11:35:26,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837507367] [2025-03-04 11:35:26,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:26,593 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:26,594 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:26,609 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:26,610 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:26,612 INFO L87 Difference]: Start difference. First operand has 189 states, 129 states have (on average 1.558139534883721) internal successors, (201), 145 states have internal predecessors, (201), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (37), 37 states have call predecessors, (37), 37 states have call successors, (37) Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:35:26,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:26,688 INFO L93 Difference]: Finished difference Result 370 states and 581 transitions. [2025-03-04 11:35:26,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:26,692 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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) Word has length 5 [2025-03-04 11:35:26,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:26,700 INFO L225 Difference]: With dead ends: 370 [2025-03-04 11:35:26,700 INFO L226 Difference]: Without dead ends: 153 [2025-03-04 11:35:26,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:26,725 INFO L435 NwaCegarLoop]: 249 mSDtfsCounter, 2 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:26,726 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 492 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:26,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-03-04 11:35:26,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2025-03-04 11:35:26,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 102 states have (on average 1.4705882352941178) internal successors, (150), 110 states have internal predecessors, (150), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:26,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 223 transitions. [2025-03-04 11:35:26,774 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 223 transitions. Word has length 5 [2025-03-04 11:35:26,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:26,775 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 223 transitions. [2025-03-04 11:35:26,775 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:35:26,775 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 223 transitions. [2025-03-04 11:35:26,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:35:26,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:26,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:26,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-04 11:35:26,776 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:26,777 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:26,777 INFO L85 PathProgramCache]: Analyzing trace with hash -989920932, now seen corresponding path program 1 times [2025-03-04 11:35:26,777 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:26,778 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2106009136] [2025-03-04 11:35:26,778 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:26,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:26,804 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:26,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:26,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:26,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:26,918 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:26,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2106009136] [2025-03-04 11:35:26,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2106009136] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:26,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [750519040] [2025-03-04 11:35:26,919 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:26,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:26,919 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:26,921 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 11:35:26,922 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 11:35:27,035 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:27,083 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:27,083 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:27,083 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:27,086 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:35:27,088 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:27,106 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:35:27,107 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:27,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [750519040] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:27,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:27,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 11:35:27,108 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794960848] [2025-03-04 11:35:27,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:27,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:27,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:27,110 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:27,110 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:27,110 INFO L87 Difference]: Start difference. First operand 153 states and 223 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:35:27,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:27,257 INFO L93 Difference]: Finished difference Result 153 states and 223 transitions. [2025-03-04 11:35:27,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:27,260 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 11:35:27,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:27,261 INFO L225 Difference]: With dead ends: 153 [2025-03-04 11:35:27,262 INFO L226 Difference]: Without dead ends: 152 [2025-03-04 11:35:27,262 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:27,263 INFO L435 NwaCegarLoop]: 212 mSDtfsCounter, 3 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:27,263 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 419 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:27,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2025-03-04 11:35:27,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2025-03-04 11:35:27,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 102 states have (on average 1.4607843137254901) internal successors, (149), 109 states have internal predecessors, (149), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:27,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 222 transitions. [2025-03-04 11:35:27,276 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 222 transitions. Word has length 8 [2025-03-04 11:35:27,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:27,276 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 222 transitions. [2025-03-04 11:35:27,276 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 11:35:27,276 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 222 transitions. [2025-03-04 11:35:27,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2025-03-04 11:35:27,276 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:27,276 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:27,283 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 11:35:27,478 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:27,478 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:27,479 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:27,479 INFO L85 PathProgramCache]: Analyzing trace with hash -989920772, now seen corresponding path program 1 times [2025-03-04 11:35:27,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:27,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000693066] [2025-03-04 11:35:27,479 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:27,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:27,492 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:27,506 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:27,506 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:27,506 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:27,578 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:27,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000693066] [2025-03-04 11:35:27,579 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1000693066] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:27,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1251113356] [2025-03-04 11:35:27,579 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:27,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:27,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:27,581 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 11:35:27,582 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 11:35:27,694 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 8 statements into 1 equivalence classes. [2025-03-04 11:35:27,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 8 of 8 statements. [2025-03-04 11:35:27,726 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:27,726 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:27,728 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:27,729 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:27,747 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:27,747 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:27,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1251113356] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:27,748 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:27,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2025-03-04 11:35:27,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1107653641] [2025-03-04 11:35:27,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:27,748 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:27,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:27,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:27,748 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:27,749 INFO L87 Difference]: Start difference. First operand 152 states and 222 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 11:35:27,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:27,783 INFO L93 Difference]: Finished difference Result 152 states and 222 transitions. [2025-03-04 11:35:27,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:27,786 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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) Word has length 8 [2025-03-04 11:35:27,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:27,787 INFO L225 Difference]: With dead ends: 152 [2025-03-04 11:35:27,787 INFO L226 Difference]: Without dead ends: 151 [2025-03-04 11:35:27,787 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:27,787 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:27,788 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 424 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:27,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states. [2025-03-04 11:35:27,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 151. [2025-03-04 11:35:27,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 102 states have (on average 1.4509803921568627) internal successors, (148), 108 states have internal predecessors, (148), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:27,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2025-03-04 11:35:27,800 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 8 [2025-03-04 11:35:27,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:27,800 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2025-03-04 11:35:27,800 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 4 states have internal predecessors, (8), 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 11:35:27,800 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2025-03-04 11:35:27,801 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:35:27,801 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:27,801 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:27,807 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-04 11:35:28,005 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-04 11:35:28,005 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:28,006 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:28,006 INFO L85 PathProgramCache]: Analyzing trace with hash -622777561, now seen corresponding path program 1 times [2025-03-04 11:35:28,006 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:28,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [384423551] [2025-03-04 11:35:28,006 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:28,006 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:28,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:35:28,028 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:35:28,028 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:28,028 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:28,081 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-04 11:35:28,081 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [384423551] [2025-03-04 11:35:28,081 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [384423551] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:28,081 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1947082623] [2025-03-04 11:35:28,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:28,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:28,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:28,084 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 11:35:28,086 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 11:35:28,185 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:35:28,213 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:35:28,213 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:28,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:28,214 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:35:28,215 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:28,227 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:35:28,227 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:28,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1947082623] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:28,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 11:35:28,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573676073] [2025-03-04 11:35:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:28,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:28,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:28,228 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:28,228 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:28,228 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11:35:28,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:28,306 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2025-03-04 11:35:28,306 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:28,307 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-03-04 11:35:28,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:28,308 INFO L225 Difference]: With dead ends: 300 [2025-03-04 11:35:28,308 INFO L226 Difference]: Without dead ends: 161 [2025-03-04 11:35:28,309 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:28,309 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 1 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 423 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.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:28,310 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 423 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:28,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2025-03-04 11:35:28,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 160. [2025-03-04 11:35:28,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 111 states have (on average 1.4324324324324325) internal successors, (159), 117 states have internal predecessors, (159), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:28,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 232 transitions. [2025-03-04 11:35:28,333 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 232 transitions. Word has length 9 [2025-03-04 11:35:28,335 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:28,335 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 232 transitions. [2025-03-04 11:35:28,335 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11:35:28,335 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 232 transitions. [2025-03-04 11:35:28,335 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-04 11:35:28,335 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:28,335 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2025-03-04 11:35:28,342 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 11:35:28,536 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:28,536 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:28,536 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:28,536 INFO L85 PathProgramCache]: Analyzing trace with hash -622772596, now seen corresponding path program 1 times [2025-03-04 11:35:28,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:28,536 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28724237] [2025-03-04 11:35:28,536 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:28,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:28,547 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-04 11:35:28,555 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-04 11:35:28,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:28,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:28,589 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-04 11:35:28,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:28,589 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28724237] [2025-03-04 11:35:28,589 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28724237] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:28,589 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:28,589 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-04 11:35:28,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1748707637] [2025-03-04 11:35:28,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:28,590 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:28,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:28,590 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:28,590 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:28,591 INFO L87 Difference]: Start difference. First operand 160 states and 232 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11:35:28,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:28,610 INFO L93 Difference]: Finished difference Result 160 states and 232 transitions. [2025-03-04 11:35:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:28,612 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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) Word has length 9 [2025-03-04 11:35:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:28,613 INFO L225 Difference]: With dead ends: 160 [2025-03-04 11:35:28,613 INFO L226 Difference]: Without dead ends: 159 [2025-03-04 11:35:28,613 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-04 11:35:28,614 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 425 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:28,614 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 425 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:28,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2025-03-04 11:35:28,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 155. [2025-03-04 11:35:28,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 107 states have (on average 1.4299065420560748) internal successors, (153), 112 states have internal predecessors, (153), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:28,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 226 transitions. [2025-03-04 11:35:28,629 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 226 transitions. Word has length 9 [2025-03-04 11:35:28,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:28,630 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 226 transitions. [2025-03-04 11:35:28,630 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 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 11:35:28,630 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 226 transitions. [2025-03-04 11:35:28,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-03-04 11:35:28,633 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:28,633 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2025-03-04 11:35:28,633 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-04 11:35:28,634 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:28,634 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:28,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1781907105, now seen corresponding path program 1 times [2025-03-04 11:35:28,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:28,634 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85653486] [2025-03-04 11:35:28,634 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:28,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:28,649 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:35:28,656 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:35:28,656 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:28,656 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:28,698 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:35:28,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85653486] [2025-03-04 11:35:28,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85653486] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:28,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [587525751] [2025-03-04 11:35:28,699 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:28,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:28,699 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:28,701 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:28,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-04 11:35:28,801 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-03-04 11:35:28,833 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-03-04 11:35:28,833 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:28,833 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:28,834 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2025-03-04 11:35:28,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:28,846 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-03-04 11:35:28,846 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:28,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [587525751] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:28,847 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:28,847 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2025-03-04 11:35:28,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656138850] [2025-03-04 11:35:28,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:28,847 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-04 11:35:28,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:28,847 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-04 11:35:28,847 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:28,848 INFO L87 Difference]: Start difference. First operand 155 states and 226 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:35:28,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:28,908 INFO L93 Difference]: Finished difference Result 155 states and 226 transitions. [2025-03-04 11:35:28,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-04 11:35:28,914 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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) Word has length 16 [2025-03-04 11:35:28,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:28,915 INFO L225 Difference]: With dead ends: 155 [2025-03-04 11:35:28,915 INFO L226 Difference]: Without dead ends: 154 [2025-03-04 11:35:28,916 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:28,916 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 0 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 418 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:28,916 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 418 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-04 11:35:28,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2025-03-04 11:35:28,921 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 148. [2025-03-04 11:35:28,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 101 states have (on average 1.4356435643564356) internal successors, (145), 105 states have internal predecessors, (145), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:28,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 218 transitions. [2025-03-04 11:35:28,925 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 218 transitions. Word has length 16 [2025-03-04 11:35:28,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:28,926 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 218 transitions. [2025-03-04 11:35:28,926 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 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 11:35:28,926 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 218 transitions. [2025-03-04 11:35:28,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-04 11:35:28,927 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:28,927 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:28,933 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:29,127 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:29,128 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:29,128 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:29,128 INFO L85 PathProgramCache]: Analyzing trace with hash 359962087, now seen corresponding path program 1 times [2025-03-04 11:35:29,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:29,128 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [751897099] [2025-03-04 11:35:29,128 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:29,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:29,161 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:35:29,170 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:35:29,170 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:29,170 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:29,276 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:29,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [751897099] [2025-03-04 11:35:29,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [751897099] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:29,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1267674713] [2025-03-04 11:35:29,277 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:29,277 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:29,277 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:29,279 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:29,280 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-04 11:35:29,420 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-04 11:35:29,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-04 11:35:29,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:29,479 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:29,481 INFO L256 TraceCheckSpWp]: Trace formula consists of 634 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:29,483 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:29,501 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:29,501 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:29,535 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-04 11:35:29,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1267674713] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:29,535 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:29,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2025-03-04 11:35:29,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567604476] [2025-03-04 11:35:29,536 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:29,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-03-04 11:35:29,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:29,537 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-03-04 11:35:29,537 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:35:29,538 INFO L87 Difference]: Start difference. First operand 148 states and 218 transitions. Second operand has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:35:29,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:29,567 INFO L93 Difference]: Finished difference Result 302 states and 445 transitions. [2025-03-04 11:35:29,567 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-04 11:35:29,567 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 45 [2025-03-04 11:35:29,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:29,568 INFO L225 Difference]: With dead ends: 302 [2025-03-04 11:35:29,568 INFO L226 Difference]: Without dead ends: 157 [2025-03-04 11:35:29,569 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2025-03-04 11:35:29,570 INFO L435 NwaCegarLoop]: 213 mSDtfsCounter, 4 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:29,570 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 423 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-04 11:35:29,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2025-03-04 11:35:29,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2025-03-04 11:35:29,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 110 states have (on average 1.4) internal successors, (154), 114 states have internal predecessors, (154), 37 states have call successors, (37), 6 states have call predecessors, (37), 6 states have return successors, (36), 36 states have call predecessors, (36), 36 states have call successors, (36) [2025-03-04 11:35:29,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 227 transitions. [2025-03-04 11:35:29,576 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 227 transitions. Word has length 45 [2025-03-04 11:35:29,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:29,577 INFO L471 AbstractCegarLoop]: Abstraction has 157 states and 227 transitions. [2025-03-04 11:35:29,577 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 7.142857142857143) internal successors, (50), 7 states have internal predecessors, (50), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:35:29,577 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 227 transitions. [2025-03-04 11:35:29,578 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-03-04 11:35:29,578 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:29,578 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:29,585 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:29,778 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:29,779 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:29,779 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:29,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1927849767, now seen corresponding path program 2 times [2025-03-04 11:35:29,779 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:29,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127548760] [2025-03-04 11:35:29,779 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:35:29,779 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:29,812 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 54 statements into 2 equivalence classes. [2025-03-04 11:35:29,828 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 22 of 54 statements. [2025-03-04 11:35:29,828 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:35:29,828 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:30,019 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2025-03-04 11:35:30,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:30,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127548760] [2025-03-04 11:35:30,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127548760] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:30,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:30,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:30,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [609273378] [2025-03-04 11:35:30,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:30,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:30,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:30,021 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:30,021 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:30,021 INFO L87 Difference]: Start difference. First operand 157 states and 227 transitions. Second operand has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:30,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:30,240 INFO L93 Difference]: Finished difference Result 422 states and 625 transitions. [2025-03-04 11:35:30,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:30,240 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 54 [2025-03-04 11:35:30,240 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:30,243 INFO L225 Difference]: With dead ends: 422 [2025-03-04 11:35:30,243 INFO L226 Difference]: Without dead ends: 290 [2025-03-04 11:35:30,244 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:30,245 INFO L435 NwaCegarLoop]: 276 mSDtfsCounter, 198 mSDsluCounter, 470 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 746 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:30,245 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 746 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:30,245 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 290 states. [2025-03-04 11:35:30,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 290 to 286. [2025-03-04 11:35:30,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 286 states, 198 states have (on average 1.4191919191919191) internal successors, (281), 202 states have internal predecessors, (281), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (75), 71 states have call predecessors, (75), 70 states have call successors, (75) [2025-03-04 11:35:30,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 428 transitions. [2025-03-04 11:35:30,262 INFO L78 Accepts]: Start accepts. Automaton has 286 states and 428 transitions. Word has length 54 [2025-03-04 11:35:30,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:30,262 INFO L471 AbstractCegarLoop]: Abstraction has 286 states and 428 transitions. [2025-03-04 11:35:30,262 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.75) internal successors, (31), 4 states have internal predecessors, (31), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:30,262 INFO L276 IsEmpty]: Start isEmpty. Operand 286 states and 428 transitions. [2025-03-04 11:35:30,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-03-04 11:35:30,263 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:30,263 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:30,264 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-04 11:35:30,264 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:30,264 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:30,264 INFO L85 PathProgramCache]: Analyzing trace with hash 782752568, now seen corresponding path program 1 times [2025-03-04 11:35:30,264 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:30,264 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11022797] [2025-03-04 11:35:30,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:30,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:30,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:35:30,332 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:35:30,332 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:30,332 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:30,444 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:35:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11022797] [2025-03-04 11:35:30,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11022797] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:30,445 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829162308] [2025-03-04 11:35:30,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:30,447 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:30,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-04 11:35:30,637 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-03-04 11:35:30,700 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-03-04 11:35:30,700 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:30,700 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:30,703 INFO L256 TraceCheckSpWp]: Trace formula consists of 718 conjuncts, 3 conjuncts are in the unsatisfiable core [2025-03-04 11:35:30,705 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:30,739 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:35:30,739 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:30,777 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2025-03-04 11:35:30,777 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829162308] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:30,777 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:30,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-03-04 11:35:30,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16932614] [2025-03-04 11:35:30,777 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:30,778 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:30,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:30,778 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:30,778 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:30,778 INFO L87 Difference]: Start difference. First operand 286 states and 428 transitions. Second operand has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:35:30,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:30,954 INFO L93 Difference]: Finished difference Result 569 states and 853 transitions. [2025-03-04 11:35:30,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:30,954 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 52 [2025-03-04 11:35:30,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:30,960 INFO L225 Difference]: With dead ends: 569 [2025-03-04 11:35:30,960 INFO L226 Difference]: Without dead ends: 302 [2025-03-04 11:35:30,962 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 101 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:30,962 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 6 mSDsluCounter, 209 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 420 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.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:30,964 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 420 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:30,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 302 states. [2025-03-04 11:35:30,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 302 to 302. [2025-03-04 11:35:30,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 302 states, 214 states have (on average 1.3925233644859814) internal successors, (298), 218 states have internal predecessors, (298), 72 states have call successors, (72), 12 states have call predecessors, (72), 12 states have return successors, (75), 71 states have call predecessors, (75), 70 states have call successors, (75) [2025-03-04 11:35:30,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 302 states to 302 states and 445 transitions. [2025-03-04 11:35:30,981 INFO L78 Accepts]: Start accepts. Automaton has 302 states and 445 transitions. Word has length 52 [2025-03-04 11:35:30,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:30,981 INFO L471 AbstractCegarLoop]: Abstraction has 302 states and 445 transitions. [2025-03-04 11:35:30,981 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.4) internal successors, (47), 5 states have internal predecessors, (47), 1 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2025-03-04 11:35:30,981 INFO L276 IsEmpty]: Start isEmpty. Operand 302 states and 445 transitions. [2025-03-04 11:35:30,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2025-03-04 11:35:30,982 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:30,982 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:30,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:31,183 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:31,184 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:31,185 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:31,185 INFO L85 PathProgramCache]: Analyzing trace with hash 605115120, now seen corresponding path program 2 times [2025-03-04 11:35:31,185 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:31,185 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507317078] [2025-03-04 11:35:31,185 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-04 11:35:31,185 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:31,222 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 68 statements into 2 equivalence classes. [2025-03-04 11:35:31,229 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) and asserted 20 of 68 statements. [2025-03-04 11:35:31,229 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2025-03-04 11:35:31,229 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:31,383 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 11:35:31,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:31,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507317078] [2025-03-04 11:35:31,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507317078] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:31,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:31,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-04 11:35:31,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2119726223] [2025-03-04 11:35:31,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:31,384 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-04 11:35:31,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:31,385 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-04 11:35:31,385 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:31,385 INFO L87 Difference]: Start difference. First operand 302 states and 445 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:31,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:31,776 INFO L93 Difference]: Finished difference Result 569 states and 842 transitions. [2025-03-04 11:35:31,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:31,776 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 68 [2025-03-04 11:35:31,776 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:31,778 INFO L225 Difference]: With dead ends: 569 [2025-03-04 11:35:31,778 INFO L226 Difference]: Without dead ends: 314 [2025-03-04 11:35:31,780 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 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 11:35:31,781 INFO L435 NwaCegarLoop]: 244 mSDtfsCounter, 223 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 767 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:31,781 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [237 Valid, 767 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-03-04 11:35:31,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 314 states. [2025-03-04 11:35:31,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 314 to 310. [2025-03-04 11:35:31,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 310 states, 220 states have (on average 1.3818181818181818) internal successors, (304), 225 states have internal predecessors, (304), 72 states have call successors, (72), 13 states have call predecessors, (72), 14 states have return successors, (78), 71 states have call predecessors, (78), 70 states have call successors, (78) [2025-03-04 11:35:31,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 310 states to 310 states and 454 transitions. [2025-03-04 11:35:31,800 INFO L78 Accepts]: Start accepts. Automaton has 310 states and 454 transitions. Word has length 68 [2025-03-04 11:35:31,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:31,801 INFO L471 AbstractCegarLoop]: Abstraction has 310 states and 454 transitions. [2025-03-04 11:35:31,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 states have internal predecessors, (29), 2 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:31,802 INFO L276 IsEmpty]: Start isEmpty. Operand 310 states and 454 transitions. [2025-03-04 11:35:31,802 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-03-04 11:35:31,802 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:31,802 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:31,802 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2025-03-04 11:35:31,803 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:31,803 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:31,803 INFO L85 PathProgramCache]: Analyzing trace with hash 179262866, now seen corresponding path program 1 times [2025-03-04 11:35:31,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:31,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1826724965] [2025-03-04 11:35:31,803 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:31,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:31,842 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-03-04 11:35:31,872 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-03-04 11:35:31,872 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:31,872 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,136 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 11:35:32,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:32,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1826724965] [2025-03-04 11:35:32,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1826724965] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:32,136 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:32,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:32,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603806616] [2025-03-04 11:35:32,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:32,137 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:32,137 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:32,137 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:32,137 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:32,138 INFO L87 Difference]: Start difference. First operand 310 states and 454 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:32,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:32,351 INFO L93 Difference]: Finished difference Result 566 states and 830 transitions. [2025-03-04 11:35:32,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:32,352 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 72 [2025-03-04 11:35:32,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:32,355 INFO L225 Difference]: With dead ends: 566 [2025-03-04 11:35:32,355 INFO L226 Difference]: Without dead ends: 271 [2025-03-04 11:35:32,357 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:32,358 INFO L435 NwaCegarLoop]: 260 mSDtfsCounter, 190 mSDsluCounter, 455 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:32,358 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [190 Valid, 715 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-03-04 11:35:32,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2025-03-04 11:35:32,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 267. [2025-03-04 11:35:32,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 267 states, 193 states have (on average 1.3316062176165804) internal successors, (257), 197 states have internal predecessors, (257), 58 states have call successors, (58), 12 states have call predecessors, (58), 12 states have return successors, (62), 57 states have call predecessors, (62), 56 states have call successors, (62) [2025-03-04 11:35:32,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 267 states to 267 states and 377 transitions. [2025-03-04 11:35:32,375 INFO L78 Accepts]: Start accepts. Automaton has 267 states and 377 transitions. Word has length 72 [2025-03-04 11:35:32,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:32,375 INFO L471 AbstractCegarLoop]: Abstraction has 267 states and 377 transitions. [2025-03-04 11:35:32,375 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:32,375 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 377 transitions. [2025-03-04 11:35:32,376 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-03-04 11:35:32,376 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:32,376 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:35:32,376 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-04 11:35:32,376 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:32,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:32,377 INFO L85 PathProgramCache]: Analyzing trace with hash 526300147, now seen corresponding path program 1 times [2025-03-04 11:35:32,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:32,377 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1343056429] [2025-03-04 11:35:32,377 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:32,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:32,413 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 74 statements into 1 equivalence classes. [2025-03-04 11:35:32,439 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 74 of 74 statements. [2025-03-04 11:35:32,439 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:32,439 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:32,651 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 114 trivial. 0 not checked. [2025-03-04 11:35:32,651 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:32,651 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1343056429] [2025-03-04 11:35:32,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1343056429] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:32,651 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:32,651 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-04 11:35:32,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [119335298] [2025-03-04 11:35:32,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:32,652 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-04 11:35:32,652 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:32,652 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-04 11:35:32,652 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-04 11:35:32,652 INFO L87 Difference]: Start difference. First operand 267 states and 377 transitions. Second operand has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:34,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 11:35:34,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:34,378 INFO L93 Difference]: Finished difference Result 373 states and 523 transitions. [2025-03-04 11:35:34,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-04 11:35:34,379 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 74 [2025-03-04 11:35:34,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:34,380 INFO L225 Difference]: With dead ends: 373 [2025-03-04 11:35:34,380 INFO L226 Difference]: Without dead ends: 204 [2025-03-04 11:35:34,381 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-04 11:35:34,381 INFO L435 NwaCegarLoop]: 261 mSDtfsCounter, 85 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 717 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:34,381 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 717 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 1.7s Time] [2025-03-04 11:35:34,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2025-03-04 11:35:34,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 204. [2025-03-04 11:35:34,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 204 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 152 states have internal predecessors, (192), 44 states have call successors, (44), 9 states have call predecessors, (44), 9 states have return successors, (47), 42 states have call predecessors, (47), 43 states have call successors, (47) [2025-03-04 11:35:34,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 204 states to 204 states and 283 transitions. [2025-03-04 11:35:34,401 INFO L78 Accepts]: Start accepts. Automaton has 204 states and 283 transitions. Word has length 74 [2025-03-04 11:35:34,401 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:34,401 INFO L471 AbstractCegarLoop]: Abstraction has 204 states and 283 transitions. [2025-03-04 11:35:34,401 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.75) internal successors, (35), 4 states have internal predecessors, (35), 1 states have call successors, (4), 2 states have call predecessors, (4), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2025-03-04 11:35:34,401 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 283 transitions. [2025-03-04 11:35:34,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2025-03-04 11:35:34,404 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:34,405 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:34,405 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-04 11:35:34,405 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:34,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:34,405 INFO L85 PathProgramCache]: Analyzing trace with hash 507732081, now seen corresponding path program 1 times [2025-03-04 11:35:34,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:34,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104216017] [2025-03-04 11:35:34,405 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:34,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:34,470 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 116 statements into 1 equivalence classes. [2025-03-04 11:35:34,566 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 116 of 116 statements. [2025-03-04 11:35:34,569 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:34,569 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:35,017 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 34 proven. 0 refuted. 0 times theorem prover too weak. 154 trivial. 0 not checked. [2025-03-04 11:35:35,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:35,018 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104216017] [2025-03-04 11:35:35,018 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104216017] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:35,018 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:35,018 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:35:35,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1925424027] [2025-03-04 11:35:35,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:35,018 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:35,018 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:35,018 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:35,018 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:35,018 INFO L87 Difference]: Start difference. First operand 204 states and 283 transitions. Second operand has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:35:35,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:35,521 INFO L93 Difference]: Finished difference Result 421 states and 607 transitions. [2025-03-04 11:35:35,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-04 11:35:35,522 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 116 [2025-03-04 11:35:35,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:35,524 INFO L225 Difference]: With dead ends: 421 [2025-03-04 11:35:35,524 INFO L226 Difference]: Without dead ends: 282 [2025-03-04 11:35:35,525 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2025-03-04 11:35:35,527 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 286 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 573 mSolverCounterSat, 103 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 304 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 676 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 103 IncrementalHoareTripleChecker+Valid, 573 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:35,527 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [304 Valid, 603 Invalid, 676 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [103 Valid, 573 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-04 11:35:35,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 282 states. [2025-03-04 11:35:35,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 282 to 250. [2025-03-04 11:35:35,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 250 states, 182 states have (on average 1.2472527472527473) internal successors, (227), 182 states have internal predecessors, (227), 50 states have call successors, (50), 10 states have call predecessors, (50), 14 states have return successors, (64), 57 states have call predecessors, (64), 49 states have call successors, (64) [2025-03-04 11:35:35,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 250 states to 250 states and 341 transitions. [2025-03-04 11:35:35,546 INFO L78 Accepts]: Start accepts. Automaton has 250 states and 341 transitions. Word has length 116 [2025-03-04 11:35:35,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:35,546 INFO L471 AbstractCegarLoop]: Abstraction has 250 states and 341 transitions. [2025-03-04 11:35:35,546 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.625) internal successors, (53), 7 states have internal predecessors, (53), 3 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:35:35,546 INFO L276 IsEmpty]: Start isEmpty. Operand 250 states and 341 transitions. [2025-03-04 11:35:35,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2025-03-04 11:35:35,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:35,547 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:35,547 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2025-03-04 11:35:35,547 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:35,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:35,551 INFO L85 PathProgramCache]: Analyzing trace with hash -1933827243, now seen corresponding path program 1 times [2025-03-04 11:35:35,551 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:35,551 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [129393533] [2025-03-04 11:35:35,551 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:35,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:35,614 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 120 statements into 1 equivalence classes. [2025-03-04 11:35:35,657 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 120 of 120 statements. [2025-03-04 11:35:35,658 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:35,658 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:36,432 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 11:35:36,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:36,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [129393533] [2025-03-04 11:35:36,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [129393533] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:36,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:36,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2025-03-04 11:35:36,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1761841597] [2025-03-04 11:35:36,433 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:36,433 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:36,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:36,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:36,433 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2025-03-04 11:35:36,434 INFO L87 Difference]: Start difference. First operand 250 states and 341 transitions. Second operand has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:35:41,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 11:35:42,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:42,586 INFO L93 Difference]: Finished difference Result 745 states and 1072 transitions. [2025-03-04 11:35:42,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:35:42,586 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 120 [2025-03-04 11:35:42,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:42,590 INFO L225 Difference]: With dead ends: 745 [2025-03-04 11:35:42,590 INFO L226 Difference]: Without dead ends: 540 [2025-03-04 11:35:42,591 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2025-03-04 11:35:42,592 INFO L435 NwaCegarLoop]: 206 mSDtfsCounter, 411 mSDsluCounter, 688 mSDsCounter, 0 mSdLazyCounter, 737 mSolverCounterSat, 198 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 447 SdHoareTripleChecker+Valid, 894 SdHoareTripleChecker+Invalid, 936 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 198 IncrementalHoareTripleChecker+Valid, 737 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:42,592 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [447 Valid, 894 Invalid, 936 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [198 Valid, 737 Invalid, 1 Unknown, 0 Unchecked, 6.0s Time] [2025-03-04 11:35:42,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2025-03-04 11:35:42,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 524. [2025-03-04 11:35:42,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 524 states, 364 states have (on average 1.2747252747252746) internal successors, (464), 352 states have internal predecessors, (464), 127 states have call successors, (127), 17 states have call predecessors, (127), 29 states have return successors, (175), 154 states have call predecessors, (175), 125 states have call successors, (175) [2025-03-04 11:35:42,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 524 states to 524 states and 766 transitions. [2025-03-04 11:35:42,626 INFO L78 Accepts]: Start accepts. Automaton has 524 states and 766 transitions. Word has length 120 [2025-03-04 11:35:42,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:42,626 INFO L471 AbstractCegarLoop]: Abstraction has 524 states and 766 transitions. [2025-03-04 11:35:42,627 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.555555555555555) internal successors, (50), 9 states have internal predecessors, (50), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:35:42,627 INFO L276 IsEmpty]: Start isEmpty. Operand 524 states and 766 transitions. [2025-03-04 11:35:42,628 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2025-03-04 11:35:42,628 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:42,628 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:42,628 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2025-03-04 11:35:42,628 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:42,629 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:42,629 INFO L85 PathProgramCache]: Analyzing trace with hash 299464054, now seen corresponding path program 1 times [2025-03-04 11:35:42,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:42,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152245955] [2025-03-04 11:35:42,629 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:42,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:42,675 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 122 statements into 1 equivalence classes. [2025-03-04 11:35:42,722 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 122 of 122 statements. [2025-03-04 11:35:42,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:42,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:43,395 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 11:35:43,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:43,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152245955] [2025-03-04 11:35:43,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152245955] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:43,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-04 11:35:43,395 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-03-04 11:35:43,395 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663165643] [2025-03-04 11:35:43,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:43,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2025-03-04 11:35:43,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:43,396 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2025-03-04 11:35:43,396 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2025-03-04 11:35:43,396 INFO L87 Difference]: Start difference. First operand 524 states and 766 transitions. Second operand has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:35:44,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:44,485 INFO L93 Difference]: Finished difference Result 795 states and 1144 transitions. [2025-03-04 11:35:44,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-03-04 11:35:44,486 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 122 [2025-03-04 11:35:44,486 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:44,489 INFO L225 Difference]: With dead ends: 795 [2025-03-04 11:35:44,489 INFO L226 Difference]: Without dead ends: 436 [2025-03-04 11:35:44,491 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2025-03-04 11:35:44,492 INFO L435 NwaCegarLoop]: 207 mSDtfsCounter, 595 mSDsluCounter, 578 mSDsCounter, 0 mSdLazyCounter, 539 mSolverCounterSat, 313 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 631 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 852 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 313 IncrementalHoareTripleChecker+Valid, 539 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:44,492 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [631 Valid, 785 Invalid, 852 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [313 Valid, 539 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-04 11:35:44,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2025-03-04 11:35:44,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 432. [2025-03-04 11:35:44,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 432 states, 303 states have (on average 1.2343234323432344) internal successors, (374), 296 states have internal predecessors, (374), 100 states have call successors, (100), 16 states have call predecessors, (100), 25 states have return successors, (140), 119 states have call predecessors, (140), 99 states have call successors, (140) [2025-03-04 11:35:44,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 432 states to 432 states and 614 transitions. [2025-03-04 11:35:44,520 INFO L78 Accepts]: Start accepts. Automaton has 432 states and 614 transitions. Word has length 122 [2025-03-04 11:35:44,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:44,521 INFO L471 AbstractCegarLoop]: Abstraction has 432 states and 614 transitions. [2025-03-04 11:35:44,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.5) internal successors, (52), 8 states have internal predecessors, (52), 4 states have call successors, (9), 4 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2025-03-04 11:35:44,521 INFO L276 IsEmpty]: Start isEmpty. Operand 432 states and 614 transitions. [2025-03-04 11:35:44,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:35:44,522 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:44,523 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:44,523 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2025-03-04 11:35:44,523 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:44,523 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:44,523 INFO L85 PathProgramCache]: Analyzing trace with hash 318325908, now seen corresponding path program 1 times [2025-03-04 11:35:44,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:44,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966174967] [2025-03-04 11:35:44,524 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:44,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:44,570 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:44,684 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:44,684 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:44,684 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,580 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 18 proven. 22 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2025-03-04 11:35:45,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966174967] [2025-03-04 11:35:45,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [966174967] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:45,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [741252580] [2025-03-04 11:35:45,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:45,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:45,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:45,583 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:45,584 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-04 11:35:45,848 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:45,969 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:45,969 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:45,969 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:45,975 INFO L256 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 19 conjuncts are in the unsatisfiable core [2025-03-04 11:35:45,983 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:46,212 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:35:46,212 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-03-04 11:35:46,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [741252580] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-04 11:35:46,212 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-03-04 11:35:46,212 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 15 [2025-03-04 11:35:46,212 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228392265] [2025-03-04 11:35:46,212 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-04 11:35:46,212 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-04 11:35:46,212 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:46,213 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-04 11:35:46,213 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2025-03-04 11:35:46,213 INFO L87 Difference]: Start difference. First operand 432 states and 614 transitions. Second operand has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:35:47,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:47,096 INFO L93 Difference]: Finished difference Result 1002 states and 1476 transitions. [2025-03-04 11:35:47,097 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-04 11:35:47,097 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) Word has length 118 [2025-03-04 11:35:47,097 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:47,102 INFO L225 Difference]: With dead ends: 1002 [2025-03-04 11:35:47,102 INFO L226 Difference]: Without dead ends: 694 [2025-03-04 11:35:47,104 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=330, Unknown=0, NotChecked=0, Total=462 [2025-03-04 11:35:47,105 INFO L435 NwaCegarLoop]: 214 mSDtfsCounter, 483 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 823 mSolverCounterSat, 333 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 489 SdHoareTripleChecker+Valid, 693 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 333 IncrementalHoareTripleChecker+Valid, 823 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:47,105 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [489 Valid, 693 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [333 Valid, 823 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-04 11:35:47,106 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 694 states. [2025-03-04 11:35:47,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 694 to 552. [2025-03-04 11:35:47,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 389 states have (on average 1.2416452442159382) internal successors, (483), 378 states have internal predecessors, (483), 123 states have call successors, (123), 20 states have call predecessors, (123), 36 states have return successors, (204), 153 states have call predecessors, (204), 122 states have call successors, (204) [2025-03-04 11:35:47,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 810 transitions. [2025-03-04 11:35:47,155 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 810 transitions. Word has length 118 [2025-03-04 11:35:47,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:47,155 INFO L471 AbstractCegarLoop]: Abstraction has 552 states and 810 transitions. [2025-03-04 11:35:47,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.888888888888889) internal successors, (62), 7 states have internal predecessors, (62), 3 states have call successors, (9), 4 states have call predecessors, (9), 5 states have return successors, (8), 5 states have call predecessors, (8), 3 states have call successors, (8) [2025-03-04 11:35:47,155 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 810 transitions. [2025-03-04 11:35:47,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:35:47,156 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:47,156 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:47,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-03-04 11:35:47,361 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:47,361 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:47,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:47,361 INFO L85 PathProgramCache]: Analyzing trace with hash 648091669, now seen corresponding path program 1 times [2025-03-04 11:35:47,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:47,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409544495] [2025-03-04 11:35:47,361 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:47,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:47,407 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:47,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:47,729 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:47,729 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,313 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 42 proven. 66 refuted. 0 times theorem prover too weak. 80 trivial. 0 not checked. [2025-03-04 11:35:49,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409544495] [2025-03-04 11:35:49,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409544495] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:49,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1472449398] [2025-03-04 11:35:49,314 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:49,314 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:49,314 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:49,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:49,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-03-04 11:35:49,593 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:49,728 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:49,728 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:49,728 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:49,733 INFO L256 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 25 conjuncts are in the unsatisfiable core [2025-03-04 11:35:49,738 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:49,973 INFO L378 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-03-04 11:35:50,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-04 11:35:50,032 INFO L378 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 21 treesize of output 13 [2025-03-04 11:35:50,065 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:35:50,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2025-03-04 11:35:50,387 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-04 11:35:50,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 26 treesize of output 28 [2025-03-04 11:35:50,452 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 52 proven. 64 refuted. 0 times theorem prover too weak. 72 trivial. 0 not checked. [2025-03-04 11:35:50,452 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:50,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1472449398] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:50,741 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-04 11:35:50,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 10] total 27 [2025-03-04 11:35:50,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893553637] [2025-03-04 11:35:50,741 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:50,741 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-03-04 11:35:50,741 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:50,742 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-03-04 11:35:50,742 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=741, Unknown=0, NotChecked=0, Total=870 [2025-03-04 11:35:50,742 INFO L87 Difference]: Start difference. First operand 552 states and 810 transitions. Second operand has 28 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 5 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 11:35:56,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:35:56,468 INFO L93 Difference]: Finished difference Result 910 states and 1333 transitions. [2025-03-04 11:35:56,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2025-03-04 11:35:56,469 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 5 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) Word has length 118 [2025-03-04 11:35:56,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:35:56,474 INFO L225 Difference]: With dead ends: 910 [2025-03-04 11:35:56,474 INFO L226 Difference]: Without dead ends: 909 [2025-03-04 11:35:56,476 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 116 SyntacticMatches, 1 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=470, Invalid=2080, Unknown=0, NotChecked=0, Total=2550 [2025-03-04 11:35:56,477 INFO L435 NwaCegarLoop]: 131 mSDtfsCounter, 1441 mSDsluCounter, 1217 mSDsCounter, 0 mSdLazyCounter, 1723 mSolverCounterSat, 732 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1443 SdHoareTripleChecker+Valid, 1348 SdHoareTripleChecker+Invalid, 2455 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 732 IncrementalHoareTripleChecker+Valid, 1723 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.1s IncrementalHoareTripleChecker+Time [2025-03-04 11:35:56,477 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1443 Valid, 1348 Invalid, 2455 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [732 Valid, 1723 Invalid, 0 Unknown, 0 Unchecked, 5.1s Time] [2025-03-04 11:35:56,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 909 states. [2025-03-04 11:35:56,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 909 to 758. [2025-03-04 11:35:56,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 758 states, 536 states have (on average 1.2462686567164178) internal successors, (668), 522 states have internal predecessors, (668), 164 states have call successors, (164), 29 states have call predecessors, (164), 54 states have return successors, (269), 206 states have call predecessors, (269), 162 states have call successors, (269) [2025-03-04 11:35:56,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 758 states to 758 states and 1101 transitions. [2025-03-04 11:35:56,543 INFO L78 Accepts]: Start accepts. Automaton has 758 states and 1101 transitions. Word has length 118 [2025-03-04 11:35:56,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:35:56,544 INFO L471 AbstractCegarLoop]: Abstraction has 758 states and 1101 transitions. [2025-03-04 11:35:56,545 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 27 states have (on average 4.888888888888889) internal successors, (132), 27 states have internal predecessors, (132), 5 states have call successors, (18), 7 states have call predecessors, (18), 8 states have return successors, (16), 7 states have call predecessors, (16), 5 states have call successors, (16) [2025-03-04 11:35:56,545 INFO L276 IsEmpty]: Start isEmpty. Operand 758 states and 1101 transitions. [2025-03-04 11:35:56,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2025-03-04 11:35:56,547 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:35:56,547 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:35:56,556 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2025-03-04 11:35:56,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2025-03-04 11:35:56,748 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:35:56,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:35:56,748 INFO L85 PathProgramCache]: Analyzing trace with hash -1831264991, now seen corresponding path program 1 times [2025-03-04 11:35:56,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:35:56,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239506124] [2025-03-04 11:35:56,748 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:56,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:35:56,793 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:56,816 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:56,816 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:56,816 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,492 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 11:35:57,493 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-04 11:35:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239506124] [2025-03-04 11:35:57,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239506124] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-04 11:35:57,493 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406423112] [2025-03-04 11:35:57,493 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:35:57,493 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-04 11:35:57,493 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-04 11:35:57,496 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-04 11:35:57,497 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-03-04 11:35:57,832 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 118 statements into 1 equivalence classes. [2025-03-04 11:35:57,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 118 of 118 statements. [2025-03-04 11:35:57,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:35:57,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-04 11:35:57,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 1266 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-03-04 11:35:57,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-04 11:35:58,116 INFO L378 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 27 treesize of output 1 [2025-03-04 11:35:58,350 INFO L378 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 19 treesize of output 7 [2025-03-04 11:35:58,382 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 122 trivial. 0 not checked. [2025-03-04 11:35:58,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-04 11:35:58,598 INFO L378 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 22 treesize of output 20 [2025-03-04 11:35:58,604 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 28 [2025-03-04 11:35:58,795 INFO L378 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 22 treesize of output 20 [2025-03-04 11:35:58,799 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 28 [2025-03-04 11:35:58,887 INFO L378 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 22 treesize of output 20 [2025-03-04 11:35:58,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 32 treesize of output 28 [2025-03-04 11:35:59,073 INFO L134 CoverageAnalysis]: Checked inductivity of 188 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 186 trivial. 0 not checked. [2025-03-04 11:35:59,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406423112] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-04 11:35:59,073 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-04 11:35:59,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 33 [2025-03-04 11:35:59,074 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825542645] [2025-03-04 11:35:59,074 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-04 11:35:59,074 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2025-03-04 11:35:59,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-04 11:35:59,075 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2025-03-04 11:35:59,075 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=117, Invalid=939, Unknown=0, NotChecked=0, Total=1056 [2025-03-04 11:35:59,075 INFO L87 Difference]: Start difference. First operand 758 states and 1101 transitions. Second operand has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:36:04,006 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.88s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2025-03-04 11:36:09,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-04 11:36:09,326 INFO L93 Difference]: Finished difference Result 2178 states and 3091 transitions. [2025-03-04 11:36:09,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 50 states. [2025-03-04 11:36:09,326 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) Word has length 118 [2025-03-04 11:36:09,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-04 11:36:09,333 INFO L225 Difference]: With dead ends: 2178 [2025-03-04 11:36:09,333 INFO L226 Difference]: Without dead ends: 1450 [2025-03-04 11:36:09,337 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 221 SyntacticMatches, 3 SemanticMatches, 77 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1435 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=998, Invalid=5164, Unknown=0, NotChecked=0, Total=6162 [2025-03-04 11:36:09,337 INFO L435 NwaCegarLoop]: 319 mSDtfsCounter, 1733 mSDsluCounter, 3587 mSDsCounter, 0 mSdLazyCounter, 5776 mSolverCounterSat, 990 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1741 SdHoareTripleChecker+Valid, 3906 SdHoareTripleChecker+Invalid, 6766 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 990 IncrementalHoareTripleChecker+Valid, 5776 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 8.5s IncrementalHoareTripleChecker+Time [2025-03-04 11:36:09,338 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [1741 Valid, 3906 Invalid, 6766 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [990 Valid, 5776 Invalid, 0 Unknown, 0 Unchecked, 8.5s Time] [2025-03-04 11:36:09,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1450 states. [2025-03-04 11:36:09,496 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1450 to 1369. [2025-03-04 11:36:09,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1369 states, 984 states have (on average 1.2408536585365855) internal successors, (1221), 968 states have internal predecessors, (1221), 267 states have call successors, (267), 65 states have call predecessors, (267), 114 states have return successors, (441), 335 states have call predecessors, (441), 261 states have call successors, (441) [2025-03-04 11:36:09,506 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1369 states to 1369 states and 1929 transitions. [2025-03-04 11:36:09,508 INFO L78 Accepts]: Start accepts. Automaton has 1369 states and 1929 transitions. Word has length 118 [2025-03-04 11:36:09,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-04 11:36:09,508 INFO L471 AbstractCegarLoop]: Abstraction has 1369 states and 1929 transitions. [2025-03-04 11:36:09,508 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 29 states have (on average 4.551724137931035) internal successors, (132), 32 states have internal predecessors, (132), 12 states have call successors, (23), 10 states have call predecessors, (23), 10 states have return successors, (21), 10 states have call predecessors, (21), 10 states have call successors, (21) [2025-03-04 11:36:09,509 INFO L276 IsEmpty]: Start isEmpty. Operand 1369 states and 1929 transitions. [2025-03-04 11:36:09,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2025-03-04 11:36:09,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-04 11:36:09,510 INFO L218 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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 11:36:09,520 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-03-04 11:36:09,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-03-04 11:36:09,711 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2025-03-04 11:36:09,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-04 11:36:09,712 INFO L85 PathProgramCache]: Analyzing trace with hash -1383994593, now seen corresponding path program 1 times [2025-03-04 11:36:09,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-04 11:36:09,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607047822] [2025-03-04 11:36:09,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-04 11:36:09,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-04 11:36:09,753 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:36:09,993 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:36:09,993 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:09,993 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:36:09,993 INFO L348 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2025-03-04 11:36:10,026 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 119 statements into 1 equivalence classes. [2025-03-04 11:36:10,285 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 119 of 119 statements. [2025-03-04 11:36:10,289 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-04 11:36:10,290 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is sat [2025-03-04 11:36:10,389 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2025-03-04 11:36:10,392 INFO L340 BasicCegarLoop]: Counterexample is feasible [2025-03-04 11:36:10,393 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2025-03-04 11:36:10,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2025-03-04 11:36:10,395 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2025-03-04 11:36:10,396 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2025-03-04 11:36:10,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2025-03-04 11:36:10,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2025-03-04 11:36:10,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2025-03-04 11:36:10,397 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2025-03-04 11:36:10,397 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2025-03-04 11:36:10,399 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-04 11:36:10,493 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2025-03-04 11:36:10,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 04.03 11:36:10 BoogieIcfgContainer [2025-03-04 11:36:10,495 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2025-03-04 11:36:10,495 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2025-03-04 11:36:10,496 INFO L270 PluginConnector]: Initializing Witness Printer... [2025-03-04 11:36:10,496 INFO L274 PluginConnector]: Witness Printer initialized [2025-03-04 11:36:10,496 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 04.03 11:35:26" (3/4) ... [2025-03-04 11:36:10,497 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2025-03-04 11:36:10,572 INFO L127 tionWitnessGenerator]: Generated YAML witness of length 48. [2025-03-04 11:36:10,624 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2025-03-04 11:36:10,625 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2025-03-04 11:36:10,625 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2025-03-04 11:36:10,625 INFO L158 Benchmark]: Toolchain (without parser) took 45730.66ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 104.0MB in the beginning and 89.6MB in the end (delta: 14.4MB). Peak memory consumption was 99.7MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: CACSL2BoogieTranslator took 424.83ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 79.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: Boogie Procedure Inliner took 42.62ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 74.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: Boogie Preprocessor took 80.60ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 68.5MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: IcfgBuilder took 857.10ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 74.8MB in the end (delta: -6.3MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: TraceAbstraction took 44191.89ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 74.1MB in the beginning and 112.3MB in the end (delta: -38.1MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,626 INFO L158 Benchmark]: Witness Printer took 129.36ms. Allocated memory is still 226.5MB. Free memory was 112.3MB in the beginning and 92.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2025-03-04 11:36:10,627 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.19ms. Allocated memory is still 201.3MB. Free memory is still 126.8MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 424.83ms. Allocated memory is still 142.6MB. Free memory was 104.0MB in the beginning and 79.3MB in the end (delta: 24.7MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 42.62ms. Allocated memory is still 142.6MB. Free memory was 79.3MB in the beginning and 74.9MB in the end (delta: 4.4MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.60ms. Allocated memory is still 142.6MB. Free memory was 74.9MB in the beginning and 68.5MB in the end (delta: 6.4MB). There was no memory consumed. Max. memory is 16.1GB. * IcfgBuilder took 857.10ms. Allocated memory is still 142.6MB. Free memory was 68.5MB in the beginning and 74.8MB in the end (delta: -6.3MB). Peak memory consumption was 51.1MB. Max. memory is 16.1GB. * TraceAbstraction took 44191.89ms. Allocated memory was 142.6MB in the beginning and 226.5MB in the end (delta: 83.9MB). Free memory was 74.1MB in the beginning and 112.3MB in the end (delta: -38.1MB). Peak memory consumption was 124.1MB. Max. memory is 16.1GB. * Witness Printer took 129.36ms. Allocated memory is still 226.5MB. Free memory was 112.3MB in the beginning and 92.1MB in the end (delta: 20.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 686]: integer overflow possible integer overflow possible We found a FailurePath: [L540] unsigned char __CS_round = 0; [L541] unsigned char __CS_ret = 0; [L542] const unsigned char __CS_ret_PREEMPTED = 0x01; [L543] const unsigned char __CS_ret_ERROR = 0x02; [L544] const unsigned char __CS_ret_FINISHED = 0x04; [L545] unsigned char __CS_error = 0; [L546] unsigned char __CS_thread_index; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L547] unsigned char __CS_thread_allocated[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L548] unsigned char __CS_thread_born_round[3 +1]; [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L549] void *(*__CS_thread[3 +1])(void *); [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L550] unsigned char __CS_thread_status[2][3 +1]; [L551] const unsigned char __THREAD_UNUSED = 0x00; [L552] const unsigned char __THREAD_RUNNING = 0x01; [L553] const unsigned char __THREAD_FINISHED = 0x02; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L554] unsigned char *__CS_thread_lockedon[2][3 +1]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L674] unsigned char mutex[2]; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L675] int data[2] = {0}; [L680] union __CS__u __CS_u; VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L743] unsigned char __CS_cp___CS_thread_status[2][3 +1]; [L744] unsigned char *__CS_cp___CS_thread_lockedon[2][3 +1]; [L745] unsigned char __CS_cp_mutex[2]; [L746] int __CS_cp_data[2]; [L747] int i = 0; VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, mutex={8:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=0, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=1, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=2, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=3, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=0, j=4, mutex={8:0}] [L748] COND FALSE !(j < 3 +1) [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, mutex={8:0}] [L747] COND TRUE i < 2 [L748] int j = 0; VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=0, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=1, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=2, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=3, mutex={8:0}] [L748] COND TRUE j < 3 +1 [L749] __CS_cp___CS_thread_status[i][j] = __VERIFIER_nondet_uchar() [L750] __CS_cp___CS_thread_lockedon[i][j] = (void *)__VERIFIER_nondet_ulong() [L748] ++j VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=1, j=4, mutex={8:0}] [L748] COND FALSE !(j < 3 +1) [L752] __CS_cp_mutex[i] = __VERIFIER_nondet_uchar() [L753] __CS_cp_data[i] = __VERIFIER_nondet_int() [L747] ++i VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, i=2, mutex={8:0}] [L747] COND FALSE !(i < 2) [L755] EXPR __CS_cp___CS_thread_status[1][0] [L755] __CS_thread_status[1][0] = __CS_cp___CS_thread_status[1][0] [L756] EXPR __CS_cp___CS_thread_status[1][1] [L756] __CS_thread_status[1][1] = __CS_cp___CS_thread_status[1][1] [L757] EXPR __CS_cp___CS_thread_status[1][2] [L757] __CS_thread_status[1][2] = __CS_cp___CS_thread_status[1][2] [L758] EXPR __CS_cp___CS_thread_status[1][3] [L758] __CS_thread_status[1][3] = __CS_cp___CS_thread_status[1][3] [L759] EXPR __CS_cp___CS_thread_lockedon[1][0] [L759] __CS_thread_lockedon[1][0] = __CS_cp___CS_thread_lockedon[1][0] [L760] EXPR __CS_cp___CS_thread_lockedon[1][1] [L760] __CS_thread_lockedon[1][1] = __CS_cp___CS_thread_lockedon[1][1] [L761] EXPR __CS_cp___CS_thread_lockedon[1][2] [L761] __CS_thread_lockedon[1][2] = __CS_cp___CS_thread_lockedon[1][2] [L762] EXPR __CS_cp___CS_thread_lockedon[1][3] [L762] __CS_thread_lockedon[1][3] = __CS_cp___CS_thread_lockedon[1][3] [L763] EXPR __CS_cp_mutex[1] [L763] mutex[1] = __CS_cp_mutex[1] [L764] EXPR __CS_cp_data[1] [L764] data[1] = __CS_cp_data[1] [L765] __CS_round = 0 [L766] __CS_thread_index = 0 [L767] __CS_thread_born_round[0] = __CS_round [L768] __CS_thread_status[0][0] = __THREAD_RUNNING [L769] __CS_thread[0] = main_thread [L770] __CS_thread_allocated[0] = 1 [L771] EXPR __CS_thread_allocated[0] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L771] COND TRUE __CS_thread_allocated[0] == 1 [L772] EXPR __CS_thread_born_round[0] [L772] __CS_round = __CS_thread_born_round[0] [L773] __CS_ret = 0 [L774] EXPR __CS_thread[0] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L774] CALL __CS_thread[0](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L722] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L722] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L722] COND FALSE !(__CS_ret != 0) [L723] CALL __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L567] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L723] RET __CS_pthread_mutex_init(&mutex[__CS_round], 0) [L724] unsigned char t1; [L725] unsigned char t2; [L726] unsigned char t3; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={11:0}, t2={19:0}, t3={18:0}] [L727] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L727] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={11:0}, t2={19:0}, t3={18:0}] [L727] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={11:0}, t2={19:0}, t3={18:0}] [L728] CALL __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \old(arg)={0:0}, \old(attr)={0:0}, \old(id1)={11:0}, \old(t1)={-1:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=0, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L662] COND FALSE !(__CS_thread_index == 3) [L666] __CS_thread_index++ [L667] __CS_thread_allocated[__CS_thread_index] = 1 [L668] __CS_thread_born_round[__CS_thread_index] = __CS_round [L669] __CS_thread[__CS_thread_index] = t1 [L670] __CS_thread_status[__CS_round][__CS_thread_index] = __THREAD_RUNNING [L671] *id1 = __CS_thread_index [L672] return __CS_thread_index; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \old(arg)={0:0}, \old(attr)={0:0}, \old(id1)={11:0}, \old(t1)={-1:0}, \result=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L728] RET __CS_pthread_create(&t1, 0, thread1, 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={11:0}, t2={19:0}, t3={18:0}] [L729] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=1, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L729] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}, t1={11:0}, t2={19:0}, t3={18:0}] [L729] COND TRUE __CS_ret != 0 [L729] return 0; [L729] return 0; [L729] return 0; [L729] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=0, \result={0:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L774] RET __CS_thread[0](0) VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={14:0}, __CS_cp_mutex={13:0}, __CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L775] COND FALSE !(__CS_ret!=__CS_ret_PREEMPTED) VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L777] EXPR __CS_thread_allocated[1] VAL [__CS_error=0, __CS_ret=1, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L777] COND TRUE __CS_thread_allocated[1] == 1 [L778] EXPR __CS_thread_born_round[1] [L778] __CS_round = __CS_thread_born_round[1] [L779] __CS_ret = 0 [L780] EXPR __CS_thread[1] VAL [__CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=0, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L683] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, lock={8:0}, mutex={8:0}] [L580] COND TRUE *lock == 0 [L580] EXPR __CS_thread_index+1 [L580] *lock = (__CS_thread_index+1) [L582] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, \old(lock)={8:0}, \result=0, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L685] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=0, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, k=1, mutex={8:0}] [L562] __CS_round += k [L563] __CS_ret = (__VERIFIER_nondet_int() && __CS_round == 2 -1)?__CS_ret_PREEMPTED:__CS_ret [L685] RET __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] [L685] COND FALSE !(__CS_ret != 0) [L686] EXPR data[__CS_round] [L686] data[__CS_round]++ VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=0, \old(__CS_thread_index)=1, __CS_error=0, __CS_ret=0, __CS_ret_ERROR=2, __CS_ret_FINISHED=4, __CS_ret_PREEMPTED=1, __CS_round=1, __CS_thread={5:0}, __CS_thread_allocated={3:0}, __CS_thread_born_round={4:0}, __CS_thread_index=1, __CS_thread_lockedon={7:0}, __CS_thread_status={6:0}, __THREAD_FINISHED=2, __THREAD_RUNNING=1, __THREAD_UNUSED=0, data={9:0}, mutex={8:0}] - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 580]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 696]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 686]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 562]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 561]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 586]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 747]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - UnprovableResult [Line: 748]: Unable to prove that integer overflow can never occur Unable to prove that integer overflow can never occur Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 189 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 44.1s, OverallIterations: 19, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 28.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 1 mSolverCounterUnknown, 5782 SdHoareTripleChecker+Valid, 24.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 5662 mSDsluCounter, 14618 SdHoareTripleChecker+Invalid, 23.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 10535 mSDsCounter, 2703 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 10501 IncrementalHoareTripleChecker+Invalid, 13205 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 2703 mSolverCounterUnsat, 4083 mSDtfsCounter, 10501 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 932 GetRequests, 714 SyntacticMatches, 6 SemanticMatches, 212 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2282 ImplicationChecksByTransitivity, 3.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1369occurred in iteration=18, InterpolantAutomatonStates: 164, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 18 MinimizatonAttempts, 449 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.4s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 9.1s InterpolantComputationTime, 1743 NumberOfCodeBlocks, 1663 NumberOfCodeBlocksAsserted, 28 NumberOfCheckSat, 1809 ConstructedInterpolants, 0 QuantifiedInterpolants, 9473 SizeOfPredicates, 31 NumberOfNonLiveVariables, 6402 ConjunctsInSsa, 89 ConjunctsInUnsatCore, 30 InterpolantComputations, 14 PerfectInterpolantSequences, 2240/2409 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2025-03-04 11:36:10,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)