./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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.5.800.v20200727-1323.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.2.5-tmp.dk.eval-assert-order-craig-803cd42-m [2024-11-22 23:11:26,218 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 23:11:26,258 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-22 23:11:26,261 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 23:11:26,262 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 23:11:26,276 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 23:11:26,277 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 23:11:26,277 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 23:11:26,278 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 23:11:26,278 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 23:11:26,278 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 23:11:26,279 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 23:11:26,279 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 23:11:26,280 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 23:11:26,280 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 23:11:26,280 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 23:11:26,280 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-22 23:11:26,281 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 23:11:26,281 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 23:11:26,281 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 23:11:26,282 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 23:11:26,282 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-22 23:11:26,283 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 23:11:26,283 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-22 23:11:26,283 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 23:11:26,283 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-22 23:11:26,284 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 23:11:26,284 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 23:11:26,284 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-22 23:11:26,285 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 23:11:26,285 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 23:11:26,285 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 23:11:26,285 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 23:11:26,286 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 23:11:26,286 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:11:26,286 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 23:11:26,286 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 23:11:26,287 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-22 23:11:26,287 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 23:11:26,287 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 23:11:26,288 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 23:11:26,288 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 23:11:26,288 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 23:11:26,288 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 23:11:26,289 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release 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 [2024-11-22 23:11:26,460 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 23:11:26,482 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 23:11:26,484 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 23:11:26,485 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 23:11:26,485 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 23:11:26,486 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-11-22 23:11:27,811 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 23:11:28,046 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 23:11:28,047 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-11-22 23:11:28,062 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8067057e4/05b70ab47d604c0aaf3ed7d87d4ca81b/FLAG155293e7b [2024-11-22 23:11:28,074 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8067057e4/05b70ab47d604c0aaf3ed7d87d4ca81b [2024-11-22 23:11:28,077 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 23:11:28,078 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 23:11:28,080 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 23:11:28,081 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 23:11:28,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 23:11:28,085 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,086 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@126ab4a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28, skipping insertion in model container [2024-11-22 23:11:28,087 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,132 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 23:11:28,507 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:11:28,516 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 23:11:28,615 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 23:11:28,650 INFO L204 MainTranslator]: Completed translation [2024-11-22 23:11:28,650 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28 WrapperNode [2024-11-22 23:11:28,651 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 23:11:28,651 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 23:11:28,652 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 23:11:28,652 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 23:11:28,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,678 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,710 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 539 [2024-11-22 23:11:28,714 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 23:11:28,715 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 23:11:28,715 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 23:11:28,715 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 23:11:28,723 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,724 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,729 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,751 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 8, 9, 10, 10, 10, 25, 16, 9, 0, 5, 3, 3, 9]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 2, 0, 4, 4, 4, 8, 8, 2, 0, 0, 0, 0, 0]. The 32 writes are split as follows [0, 3, 1, 2, 2, 2, 10, 4, 3, 0, 2, 1, 1, 1]. [2024-11-22 23:11:28,752 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,752 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,772 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,776 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,780 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,783 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,788 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 23:11:28,789 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 23:11:28,789 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 23:11:28,789 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 23:11:28,790 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (1/1) ... [2024-11-22 23:11:28,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 23:11:28,806 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:28,826 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) [2024-11-22 23:11:28,831 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 [2024-11-22 23:11:28,864 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-22 23:11:28,865 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-22 23:11:28,866 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 23:11:28,867 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-22 23:11:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-22 23:11:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-22 23:11:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-22 23:11:28,868 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-22 23:11:28,869 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-22 23:11:28,870 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-22 23:11:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-22 23:11:28,871 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-22 23:11:28,871 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-22 23:11:28,872 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-22 23:11:28,872 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-22 23:11:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-22 23:11:28,874 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-22 23:11:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-22 23:11:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-22 23:11:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-22 23:11:28,874 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-22 23:11:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-22 23:11:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-22 23:11:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-22 23:11:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-22 23:11:28,875 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-22 23:11:28,876 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 23:11:28,876 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 23:11:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-22 23:11:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-22 23:11:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-22 23:11:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-22 23:11:28,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-22 23:11:28,878 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-22 23:11:28,879 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-22 23:11:28,879 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 23:11:28,879 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 23:11:29,108 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 23:11:29,110 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 23:11:29,392 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##32: 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; [2024-11-22 23:11:29,392 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##31: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-22 23:11:29,392 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##30: 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; [2024-11-22 23:11:29,392 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint $Ultimate##33: assume !(0 != (if ~__CS_ret~0 % 256 % 4294967296 <= 2147483647 then ~__CS_ret~0 % 256 % 4294967296 else ~__CS_ret~0 % 256 % 4294967296 - 4294967296)); [2024-11-22 23:11:29,392 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2024-11-22 23:11:29,393 INFO L735 $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; [2024-11-22 23:11:29,393 INFO L735 $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)); [2024-11-22 23:11:29,685 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-22 23:11:29,686 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 23:11:29,697 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 23:11:29,697 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-22 23:11:29,698 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:29 BoogieIcfgContainer [2024-11-22 23:11:29,698 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 23:11:29,700 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 23:11:29,700 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 23:11:29,702 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 23:11:29,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 11:11:28" (1/3) ... [2024-11-22 23:11:29,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa2f0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:11:29, skipping insertion in model container [2024-11-22 23:11:29,703 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:11:28" (2/3) ... [2024-11-22 23:11:29,703 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@aa2f0d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 11:11:29, skipping insertion in model container [2024-11-22 23:11:29,704 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:29" (3/3) ... [2024-11-22 23:11:29,704 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2024-11-22 23:11:29,717 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 23:11:29,718 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-22 23:11:29,765 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 23:11:29,772 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;@317d99e8, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 23:11:29,772 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-22 23:11:29,776 INFO L276 IsEmpty]: Start isEmpty. Operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 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) [2024-11-22 23:11:29,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-22 23:11:29,781 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:29,783 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-22 23:11:29,783 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:29,788 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash 295904321, now seen corresponding path program 1 times [2024-11-22 23:11:29,795 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:29,795 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [127884511] [2024-11-22 23:11:29,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:29,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:29,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:30,035 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:11:30,035 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:30,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [127884511] [2024-11-22 23:11:30,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [127884511] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:30,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:30,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 23:11:30,038 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630067267] [2024-11-22 23:11:30,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:30,081 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:30,082 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:30,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:30,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:11:30,110 INFO L87 Difference]: Start difference. First operand has 192 states, 132 states have (on average 1.5606060606060606) internal successors, (206), 148 states have internal predecessors, (206), 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, 2 states have (on average 2.5) 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) [2024-11-22 23:11:30,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:30,245 INFO L93 Difference]: Finished difference Result 376 states and 592 transitions. [2024-11-22 23:11:30,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:30,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) 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 [2024-11-22 23:11:30,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:30,259 INFO L225 Difference]: With dead ends: 376 [2024-11-22 23:11:30,259 INFO L226 Difference]: Without dead ends: 156 [2024-11-22 23:11:30,265 INFO L431 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 [2024-11-22 23:11:30,271 INFO L432 NwaCegarLoop]: 252 mSDtfsCounter, 1 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 497 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:30,272 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 497 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:11:30,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-22 23:11:30,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-22 23:11:30,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 105 states have (on average 1.457142857142857) internal successors, (153), 113 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) [2024-11-22 23:11:30,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2024-11-22 23:11:30,328 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 5 [2024-11-22 23:11:30,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:30,328 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2024-11-22 23:11:30,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) 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) [2024-11-22 23:11:30,329 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2024-11-22 23:11:30,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-22 23:11:30,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:30,329 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:30,329 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 23:11:30,330 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:30,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:30,333 INFO L85 PathProgramCache]: Analyzing trace with hash 2013066031, now seen corresponding path program 1 times [2024-11-22 23:11:30,333 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:30,333 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813885818] [2024-11-22 23:11:30,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:30,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:30,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:30,459 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:11:30,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813885818] [2024-11-22 23:11:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813885818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155566029] [2024-11-22 23:11:30,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:30,460 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:30,460 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:30,466 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) [2024-11-22 23:11:30,467 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-22 23:11:30,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:30,618 INFO L255 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:11:30,622 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:30,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:11:30,644 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:30,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155566029] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:30,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:30,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-22 23:11:30,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1314210191] [2024-11-22 23:11:30,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:30,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:30,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:30,645 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:30,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:30,646 INFO L87 Difference]: Start difference. First operand 156 states and 226 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) [2024-11-22 23:11:30,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:30,683 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-11-22 23:11:30,683 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:30,683 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 [2024-11-22 23:11:30,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:30,685 INFO L225 Difference]: With dead ends: 156 [2024-11-22 23:11:30,685 INFO L226 Difference]: Without dead ends: 155 [2024-11-22 23:11:30,686 INFO L431 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 [2024-11-22 23:11:30,686 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 1 mSDsluCounter, 428 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:30,687 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 645 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:11:30,687 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-22 23:11:30,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-22 23:11:30,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 105 states have (on average 1.4476190476190476) internal successors, (152), 112 states have internal predecessors, (152), 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) [2024-11-22 23:11:30,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-22 23:11:30,698 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 8 [2024-11-22 23:11:30,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:30,698 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-22 23:11:30,698 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) [2024-11-22 23:11:30,698 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-22 23:11:30,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 23:11:30,699 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:30,699 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:30,708 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-22 23:11:30,899 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 [2024-11-22 23:11:30,901 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:30,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:30,903 INFO L85 PathProgramCache]: Analyzing trace with hash -2019463875, now seen corresponding path program 1 times [2024-11-22 23:11:30,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:30,903 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042898609] [2024-11-22 23:11:30,903 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:30,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:30,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:30,988 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:11:30,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042898609] [2024-11-22 23:11:30,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042898609] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:30,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [440651556] [2024-11-22 23:11:30,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:30,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:30,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:30,991 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) [2024-11-22 23:11:30,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-22 23:11:31,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:31,170 INFO L255 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 23:11:31,171 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:31,191 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 23:11:31,192 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:31,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [440651556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:31,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:31,192 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-22 23:11:31,192 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049160016] [2024-11-22 23:11:31,192 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:31,192 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:31,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:31,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:31,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:31,193 INFO L87 Difference]: Start difference. First operand 155 states and 225 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) [2024-11-22 23:11:31,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:31,324 INFO L93 Difference]: Finished difference Result 155 states and 225 transitions. [2024-11-22 23:11:31,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:31,325 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 [2024-11-22 23:11:31,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:31,326 INFO L225 Difference]: With dead ends: 155 [2024-11-22 23:11:31,326 INFO L226 Difference]: Without dead ends: 154 [2024-11-22 23:11:31,327 INFO L431 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 [2024-11-22 23:11:31,327 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 2 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:31,328 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 422 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:11:31,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-22 23:11:31,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-22 23:11:31,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 154 states, 105 states have (on average 1.438095238095238) internal successors, (151), 111 states have internal predecessors, (151), 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) [2024-11-22 23:11:31,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-22 23:11:31,340 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 9 [2024-11-22 23:11:31,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:31,340 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-22 23:11:31,340 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) [2024-11-22 23:11:31,340 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-22 23:11:31,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-22 23:11:31,340 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:31,340 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-22 23:11:31,351 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-22 23:11:31,544 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 [2024-11-22 23:11:31,545 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:31,545 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:31,546 INFO L85 PathProgramCache]: Analyzing trace with hash -2019462146, now seen corresponding path program 1 times [2024-11-22 23:11:31,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:31,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654511182] [2024-11-22 23:11:31,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:31,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:31,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:31,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 23:11:31,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:31,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654511182] [2024-11-22 23:11:31,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654511182] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:31,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:31,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 23:11:31,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485515234] [2024-11-22 23:11:31,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:31,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:31,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:31,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:31,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 23:11:31,600 INFO L87 Difference]: Start difference. First operand 154 states and 224 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) [2024-11-22 23:11:31,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:31,616 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2024-11-22 23:11:31,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:31,617 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 [2024-11-22 23:11:31,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:31,618 INFO L225 Difference]: With dead ends: 154 [2024-11-22 23:11:31,618 INFO L226 Difference]: Without dead ends: 153 [2024-11-22 23:11:31,619 INFO L431 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 [2024-11-22 23:11:31,619 INFO L432 NwaCegarLoop]: 217 mSDtfsCounter, 0 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 430 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.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:31,620 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 430 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:11:31,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-22 23:11:31,627 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-22 23:11:31,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 103 states have (on average 1.4368932038834952) 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) [2024-11-22 23:11:31,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-22 23:11:31,629 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 9 [2024-11-22 23:11:31,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:31,629 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-22 23:11:31,629 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) [2024-11-22 23:11:31,629 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-22 23:11:31,630 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-22 23:11:31,630 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:31,630 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:31,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-22 23:11:31,630 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:31,630 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:31,631 INFO L85 PathProgramCache]: Analyzing trace with hash 1821129657, now seen corresponding path program 1 times [2024-11-22 23:11:31,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:31,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840486588] [2024-11-22 23:11:31,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:31,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:31,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:31,717 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-22 23:11:31,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840486588] [2024-11-22 23:11:31,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [840486588] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:31,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90741459] [2024-11-22 23:11:31,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:31,718 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:31,718 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:31,722 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) [2024-11-22 23:11:31,728 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-22 23:11:31,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:31,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 23:11:31,934 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:31,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-22 23:11:31,948 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:31,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90741459] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:31,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:31,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-22 23:11:31,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1665724671] [2024-11-22 23:11:31,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:31,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:31,950 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:31,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:31,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:31,950 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-22 23:11:32,130 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:32,132 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2024-11-22 23:11:32,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:32,132 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-22 23:11:32,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:32,134 INFO L225 Difference]: With dead ends: 300 [2024-11-22 23:11:32,135 INFO L226 Difference]: Without dead ends: 159 [2024-11-22 23:11:32,136 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:32,137 INFO L432 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:32,138 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:11:32,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-22 23:11:32,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-22 23:11:32,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 111 states have (on average 1.4144144144144144) internal successors, (157), 116 states have internal predecessors, (157), 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) [2024-11-22 23:11:32,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2024-11-22 23:11:32,153 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 10 [2024-11-22 23:11:32,153 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:32,153 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2024-11-22 23:11:32,153 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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) [2024-11-22 23:11:32,153 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2024-11-22 23:11:32,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-22 23:11:32,154 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:32,154 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-22 23:11:32,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-22 23:11:32,354 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:32,355 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:32,356 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:32,356 INFO L85 PathProgramCache]: Analyzing trace with hash -204772944, now seen corresponding path program 1 times [2024-11-22 23:11:32,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:32,356 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997264313] [2024-11-22 23:11:32,356 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:32,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:32,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:32,434 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-22 23:11:32,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:32,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997264313] [2024-11-22 23:11:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1997264313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:32,438 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1863318730] [2024-11-22 23:11:32,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:32,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:32,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:32,440 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) [2024-11-22 23:11:32,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-22 23:11:32,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:32,595 INFO L255 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-22 23:11:32,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:32,616 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-22 23:11:32,618 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:11:32,618 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1863318730] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:32,618 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:11:32,618 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-22 23:11:32,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2131423151] [2024-11-22 23:11:32,619 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:32,619 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 23:11:32,619 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:32,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 23:11:32,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:32,620 INFO L87 Difference]: Start difference. First operand 159 states and 230 transitions. Second operand has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-22 23:11:32,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:32,714 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2024-11-22 23:11:32,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 23:11:32,722 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2024-11-22 23:11:32,722 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:32,723 INFO L225 Difference]: With dead ends: 159 [2024-11-22 23:11:32,723 INFO L226 Difference]: Without dead ends: 158 [2024-11-22 23:11:32,723 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:32,724 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 0 mSDsluCounter, 208 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 422 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:32,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 422 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:11:32,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-22 23:11:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2024-11-22 23:11:32,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 151 states, 104 states have (on average 1.4230769230769231) 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) [2024-11-22 23:11:32,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-22 23:11:32,740 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 18 [2024-11-22 23:11:32,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:32,740 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-22 23:11:32,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 9.0) internal successors, (18), 3 states have internal predecessors, (18), 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) [2024-11-22 23:11:32,740 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-22 23:11:32,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-22 23:11:32,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:32,743 INFO L215 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, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:32,755 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-22 23:11:32,947 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 [2024-11-22 23:11:32,948 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:32,948 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:32,948 INFO L85 PathProgramCache]: Analyzing trace with hash -1170227925, now seen corresponding path program 1 times [2024-11-22 23:11:32,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:32,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1396021634] [2024-11-22 23:11:32,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:32,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:32,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:33,102 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 23:11:33,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1396021634] [2024-11-22 23:11:33,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1396021634] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:33,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1826305205] [2024-11-22 23:11:33,103 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:33,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:33,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:33,105 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) [2024-11-22 23:11:33,106 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-22 23:11:33,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:33,332 INFO L255 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:11:33,334 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:33,357 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 23:11:33,357 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:11:33,408 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-22 23:11:33,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1826305205] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 23:11:33,409 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 23:11:33,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-22 23:11:33,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718033842] [2024-11-22 23:11:33,409 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 23:11:33,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-22 23:11:33,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:33,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-22 23:11:33,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:33,411 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) [2024-11-22 23:11:33,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:33,457 INFO L93 Difference]: Finished difference Result 308 states and 451 transitions. [2024-11-22 23:11:33,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 23:11:33,458 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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 51 [2024-11-22 23:11:33,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:33,459 INFO L225 Difference]: With dead ends: 308 [2024-11-22 23:11:33,459 INFO L226 Difference]: Without dead ends: 160 [2024-11-22 23:11:33,460 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:33,460 INFO L432 NwaCegarLoop]: 216 mSDtfsCounter, 4 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 640 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:33,461 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 640 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-22 23:11:33,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-11-22 23:11:33,470 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2024-11-22 23:11:33,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 113 states have (on average 1.3893805309734513) internal successors, (157), 117 states have internal predecessors, (157), 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) [2024-11-22 23:11:33,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 230 transitions. [2024-11-22 23:11:33,472 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 230 transitions. Word has length 51 [2024-11-22 23:11:33,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:33,472 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 230 transitions. [2024-11-22 23:11:33,473 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 7 states have internal predecessors, (56), 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) [2024-11-22 23:11:33,473 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 230 transitions. [2024-11-22 23:11:33,475 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2024-11-22 23:11:33,476 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:33,476 INFO L215 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, 1, 1] [2024-11-22 23:11:33,485 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-22 23:11:33,676 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 [2024-11-22 23:11:33,677 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:33,677 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:33,677 INFO L85 PathProgramCache]: Analyzing trace with hash 499054755, now seen corresponding path program 1 times [2024-11-22 23:11:33,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:33,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165533719] [2024-11-22 23:11:33,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:33,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:33,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:33,987 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 23:11:33,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:33,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165533719] [2024-11-22 23:11:33,989 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165533719] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:33,989 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112621259] [2024-11-22 23:11:33,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:33,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:33,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:33,995 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) [2024-11-22 23:11:33,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-22 23:11:34,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:34,233 INFO L255 TraceCheckSpWp]: Trace formula consists of 722 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 23:11:34,235 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:34,269 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 23:11:34,269 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:11:34,324 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 30 trivial. 0 not checked. [2024-11-22 23:11:34,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112621259] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 23:11:34,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 23:11:34,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-22 23:11:34,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365093594] [2024-11-22 23:11:34,325 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 23:11:34,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:34,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:34,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:34,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:34,326 INFO L87 Difference]: Start difference. First operand 160 states and 230 transitions. Second operand has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-22 23:11:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:34,485 INFO L93 Difference]: Finished difference Result 317 states and 457 transitions. [2024-11-22 23:11:34,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:34,493 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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 56 [2024-11-22 23:11:34,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:34,494 INFO L225 Difference]: With dead ends: 317 [2024-11-22 23:11:34,494 INFO L226 Difference]: Without dead ends: 177 [2024-11-22 23:11:34,495 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 109 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:34,496 INFO L432 NwaCegarLoop]: 214 mSDtfsCounter, 7 mSDsluCounter, 419 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 633 SdHoareTripleChecker+Invalid, 16 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:34,496 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 633 Invalid, 16 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:11:34,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 177 states. [2024-11-22 23:11:34,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 177 to 177. [2024-11-22 23:11:34,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 130 states have (on average 1.3461538461538463) internal successors, (175), 134 states have internal predecessors, (175), 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) [2024-11-22 23:11:34,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 248 transitions. [2024-11-22 23:11:34,505 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 248 transitions. Word has length 56 [2024-11-22 23:11:34,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:34,505 INFO L471 AbstractCegarLoop]: Abstraction has 177 states and 248 transitions. [2024-11-22 23:11:34,505 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 10.4) internal successors, (52), 5 states have internal predecessors, (52), 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) [2024-11-22 23:11:34,505 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 248 transitions. [2024-11-22 23:11:34,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2024-11-22 23:11:34,506 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:34,506 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1] [2024-11-22 23:11:34,514 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-22 23:11:34,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:34,707 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:34,707 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:34,707 INFO L85 PathProgramCache]: Analyzing trace with hash 580296994, now seen corresponding path program 2 times [2024-11-22 23:11:34,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:34,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445158901] [2024-11-22 23:11:34,708 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 23:11:34,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:34,781 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 23:11:34,781 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 23:11:34,969 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:34,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:34,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445158901] [2024-11-22 23:11:34,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445158901] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:34,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:34,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:11:34,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1477124528] [2024-11-22 23:11:34,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:34,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:34,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:34,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:34,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:34,971 INFO L87 Difference]: Start difference. First operand 177 states and 248 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-22 23:11:35,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:35,288 INFO L93 Difference]: Finished difference Result 439 states and 640 transitions. [2024-11-22 23:11:35,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:11:35,288 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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 77 [2024-11-22 23:11:35,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:35,293 INFO L225 Difference]: With dead ends: 439 [2024-11-22 23:11:35,293 INFO L226 Difference]: Without dead ends: 328 [2024-11-22 23:11:35,294 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:35,294 INFO L432 NwaCegarLoop]: 276 mSDtfsCounter, 231 mSDsluCounter, 733 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1009 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:35,295 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1009 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 23:11:35,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2024-11-22 23:11:35,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 322. [2024-11-22 23:11:35,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 322 states, 230 states have (on average 1.3782608695652174) internal successors, (317), 233 states have internal predecessors, (317), 76 states have call successors, (76), 13 states have call predecessors, (76), 12 states have return successors, (80), 75 states have call predecessors, (80), 74 states have call successors, (80) [2024-11-22 23:11:35,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2024-11-22 23:11:35,322 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 77 [2024-11-22 23:11:35,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:35,323 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2024-11-22 23:11:35,323 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 5 states have internal predecessors, (37), 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) [2024-11-22 23:11:35,323 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2024-11-22 23:11:35,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2024-11-22 23:11:35,324 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:35,324 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2024-11-22 23:11:35,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 23:11:35,324 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:35,325 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:35,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1148818412, now seen corresponding path program 2 times [2024-11-22 23:11:35,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:35,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1318874795] [2024-11-22 23:11:35,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 23:11:35,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:35,378 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 23:11:35,379 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 23:11:35,482 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:35,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:35,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1318874795] [2024-11-22 23:11:35,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1318874795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:35,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:35,483 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:11:35,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729833529] [2024-11-22 23:11:35,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:35,483 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:35,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:35,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:35,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:11:35,484 INFO L87 Difference]: Start difference. First operand 322 states and 473 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) [2024-11-22 23:11:35,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:35,679 INFO L93 Difference]: Finished difference Result 596 states and 880 transitions. [2024-11-22 23:11:35,679 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:35,679 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 73 [2024-11-22 23:11:35,679 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:35,681 INFO L225 Difference]: With dead ends: 596 [2024-11-22 23:11:35,681 INFO L226 Difference]: Without dead ends: 323 [2024-11-22 23:11:35,682 INFO L431 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 [2024-11-22 23:11:35,682 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 199 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 733 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 [2024-11-22 23:11:35,683 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 733 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-22 23:11:35,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 323 states. [2024-11-22 23:11:35,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 323 to 319. [2024-11-22 23:11:35,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 319 states, 228 states have (on average 1.3728070175438596) internal successors, (313), 231 states have internal predecessors, (313), 75 states have call successors, (75), 13 states have call predecessors, (75), 12 states have return successors, (78), 74 states have call predecessors, (78), 73 states have call successors, (78) [2024-11-22 23:11:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 319 states to 319 states and 466 transitions. [2024-11-22 23:11:35,723 INFO L78 Accepts]: Start accepts. Automaton has 319 states and 466 transitions. Word has length 73 [2024-11-22 23:11:35,723 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:35,723 INFO L471 AbstractCegarLoop]: Abstraction has 319 states and 466 transitions. [2024-11-22 23:11:35,724 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) [2024-11-22 23:11:35,724 INFO L276 IsEmpty]: Start isEmpty. Operand 319 states and 466 transitions. [2024-11-22 23:11:35,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2024-11-22 23:11:35,724 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:35,724 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2024-11-22 23:11:35,724 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 23:11:35,725 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:35,725 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:35,725 INFO L85 PathProgramCache]: Analyzing trace with hash -1403489993, now seen corresponding path program 1 times [2024-11-22 23:11:35,725 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:35,725 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777085967] [2024-11-22 23:11:35,725 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:35,726 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:35,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:36,023 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:36,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:36,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777085967] [2024-11-22 23:11:36,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777085967] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:36,023 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:36,023 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:11:36,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518606053] [2024-11-22 23:11:36,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:36,024 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:36,024 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:36,024 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:36,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:36,024 INFO L87 Difference]: Start difference. First operand 319 states and 466 transitions. Second operand has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-11-22 23:11:36,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:36,456 INFO L93 Difference]: Finished difference Result 590 states and 862 transitions. [2024-11-22 23:11:36,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 23:11:36,457 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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 75 [2024-11-22 23:11:36,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:36,460 INFO L225 Difference]: With dead ends: 590 [2024-11-22 23:11:36,460 INFO L226 Difference]: Without dead ends: 347 [2024-11-22 23:11:36,461 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:36,461 INFO L432 NwaCegarLoop]: 279 mSDtfsCounter, 224 mSDsluCounter, 739 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1018 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:36,462 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [224 Valid, 1018 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 23:11:36,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 347 states. [2024-11-22 23:11:36,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 347 to 341. [2024-11-22 23:11:36,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 341 states, 243 states have (on average 1.374485596707819) internal successors, (334), 246 states have internal predecessors, (334), 81 states have call successors, (81), 14 states have call predecessors, (81), 13 states have return successors, (83), 80 states have call predecessors, (83), 79 states have call successors, (83) [2024-11-22 23:11:36,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 341 states to 341 states and 498 transitions. [2024-11-22 23:11:36,483 INFO L78 Accepts]: Start accepts. Automaton has 341 states and 498 transitions. Word has length 75 [2024-11-22 23:11:36,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:36,483 INFO L471 AbstractCegarLoop]: Abstraction has 341 states and 498 transitions. [2024-11-22 23:11:36,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.75) internal successors, (35), 5 states have internal predecessors, (35), 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) [2024-11-22 23:11:36,484 INFO L276 IsEmpty]: Start isEmpty. Operand 341 states and 498 transitions. [2024-11-22 23:11:36,484 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 23:11:36,484 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:36,484 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2024-11-22 23:11:36,484 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 23:11:36,485 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:36,485 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:36,485 INFO L85 PathProgramCache]: Analyzing trace with hash -236048063, now seen corresponding path program 1 times [2024-11-22 23:11:36,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:36,485 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168555112] [2024-11-22 23:11:36,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:36,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:36,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:36,894 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:36,894 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:36,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168555112] [2024-11-22 23:11:36,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168555112] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:36,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:36,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:11:36,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030673179] [2024-11-22 23:11:36,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:36,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:36,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:36,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:36,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:36,896 INFO L87 Difference]: Start difference. First operand 341 states and 498 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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) [2024-11-22 23:11:37,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:37,046 INFO L93 Difference]: Finished difference Result 422 states and 590 transitions. [2024-11-22 23:11:37,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 23:11:37,046 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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 71 [2024-11-22 23:11:37,047 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:37,049 INFO L225 Difference]: With dead ends: 422 [2024-11-22 23:11:37,049 INFO L226 Difference]: Without dead ends: 316 [2024-11-22 23:11:37,050 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 23:11:37,050 INFO L432 NwaCegarLoop]: 267 mSDtfsCounter, 186 mSDsluCounter, 667 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 934 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:37,050 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [200 Valid, 934 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:11:37,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 316 states. [2024-11-22 23:11:37,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 316 to 312. [2024-11-22 23:11:37,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 312 states, 226 states have (on average 1.3407079646017699) internal successors, (303), 230 states have internal predecessors, (303), 68 states have call successors, (68), 14 states have call predecessors, (68), 14 states have return successors, (72), 67 states have call predecessors, (72), 66 states have call successors, (72) [2024-11-22 23:11:37,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 312 states to 312 states and 443 transitions. [2024-11-22 23:11:37,069 INFO L78 Accepts]: Start accepts. Automaton has 312 states and 443 transitions. Word has length 71 [2024-11-22 23:11:37,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:37,070 INFO L471 AbstractCegarLoop]: Abstraction has 312 states and 443 transitions. [2024-11-22 23:11:37,070 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 states have internal predecessors, (31), 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) [2024-11-22 23:11:37,070 INFO L276 IsEmpty]: Start isEmpty. Operand 312 states and 443 transitions. [2024-11-22 23:11:37,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-22 23:11:37,070 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:37,071 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2024-11-22 23:11:37,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 23:11:37,071 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:37,071 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:37,072 INFO L85 PathProgramCache]: Analyzing trace with hash -848367843, now seen corresponding path program 1 times [2024-11-22 23:11:37,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:37,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248212293] [2024-11-22 23:11:37,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:37,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:37,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:37,525 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 107 trivial. 0 not checked. [2024-11-22 23:11:37,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:37,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248212293] [2024-11-22 23:11:37,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [248212293] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:37,526 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:37,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-22 23:11:37,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [96442934] [2024-11-22 23:11:37,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:37,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-22 23:11:37,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:37,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-22 23:11:37,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-22 23:11:37,527 INFO L87 Difference]: Start difference. First operand 312 states and 443 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:11:37,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:37,940 INFO L93 Difference]: Finished difference Result 699 states and 995 transitions. [2024-11-22 23:11:37,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 23:11:37,940 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 71 [2024-11-22 23:11:37,941 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:37,943 INFO L225 Difference]: With dead ends: 699 [2024-11-22 23:11:37,943 INFO L226 Difference]: Without dead ends: 459 [2024-11-22 23:11:37,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2024-11-22 23:11:37,945 INFO L432 NwaCegarLoop]: 240 mSDtfsCounter, 357 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 380 mSolverCounterSat, 162 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 542 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 162 IncrementalHoareTripleChecker+Valid, 380 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:37,945 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [376 Valid, 514 Invalid, 542 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [162 Valid, 380 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-22 23:11:37,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 459 states. [2024-11-22 23:11:37,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 459 to 398. [2024-11-22 23:11:37,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 398 states, 291 states have (on average 1.2646048109965635) internal successors, (368), 287 states have internal predecessors, (368), 79 states have call successors, (79), 16 states have call predecessors, (79), 24 states have return successors, (101), 94 states have call predecessors, (101), 77 states have call successors, (101) [2024-11-22 23:11:37,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 398 states to 398 states and 548 transitions. [2024-11-22 23:11:37,994 INFO L78 Accepts]: Start accepts. Automaton has 398 states and 548 transitions. Word has length 71 [2024-11-22 23:11:37,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:37,995 INFO L471 AbstractCegarLoop]: Abstraction has 398 states and 548 transitions. [2024-11-22 23:11:37,995 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 2 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-22 23:11:37,995 INFO L276 IsEmpty]: Start isEmpty. Operand 398 states and 548 transitions. [2024-11-22 23:11:37,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-22 23:11:37,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:37,996 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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] [2024-11-22 23:11:37,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 23:11:37,996 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:37,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:37,997 INFO L85 PathProgramCache]: Analyzing trace with hash 1415800899, now seen corresponding path program 1 times [2024-11-22 23:11:37,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:37,997 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015759228] [2024-11-22 23:11:37,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:37,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:38,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:38,351 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:38,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:38,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015759228] [2024-11-22 23:11:38,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015759228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:38,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:38,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 23:11:38,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [693880473] [2024-11-22 23:11:38,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:38,352 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 23:11:38,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:38,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 23:11:38,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 23:11:38,353 INFO L87 Difference]: Start difference. First operand 398 states and 548 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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) [2024-11-22 23:11:38,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:38,983 INFO L93 Difference]: Finished difference Result 496 states and 660 transitions. [2024-11-22 23:11:38,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 23:11:38,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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 74 [2024-11-22 23:11:38,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:38,986 INFO L225 Difference]: With dead ends: 496 [2024-11-22 23:11:38,986 INFO L226 Difference]: Without dead ends: 379 [2024-11-22 23:11:38,986 INFO L431 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 [2024-11-22 23:11:38,987 INFO L432 NwaCegarLoop]: 254 mSDtfsCounter, 163 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 821 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:38,987 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [177 Valid, 821 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-22 23:11:38,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 379 states. [2024-11-22 23:11:39,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 379 to 377. [2024-11-22 23:11:39,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 377 states, 277 states have (on average 1.2527075812274369) internal successors, (347), 274 states have internal predecessors, (347), 72 states have call successors, (72), 16 states have call predecessors, (72), 24 states have return successors, (93), 86 states have call predecessors, (93), 70 states have call successors, (93) [2024-11-22 23:11:39,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 512 transitions. [2024-11-22 23:11:39,012 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 512 transitions. Word has length 74 [2024-11-22 23:11:39,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:39,012 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 512 transitions. [2024-11-22 23:11:39,012 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 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) [2024-11-22 23:11:39,012 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 512 transitions. [2024-11-22 23:11:39,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-22 23:11:39,012 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:39,013 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1] [2024-11-22 23:11:39,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 23:11:39,013 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:39,013 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:39,013 INFO L85 PathProgramCache]: Analyzing trace with hash -1496540019, now seen corresponding path program 1 times [2024-11-22 23:11:39,013 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:39,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404643503] [2024-11-22 23:11:39,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:39,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:39,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:39,263 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404643503] [2024-11-22 23:11:39,263 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404643503] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:39,263 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:39,263 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:11:39,263 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1697947626] [2024-11-22 23:11:39,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:39,264 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:39,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:39,264 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:39,264 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:11:39,265 INFO L87 Difference]: Start difference. First operand 377 states and 512 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2024-11-22 23:11:39,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:39,397 INFO L93 Difference]: Finished difference Result 421 states and 553 transitions. [2024-11-22 23:11:39,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:39,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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 78 [2024-11-22 23:11:39,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:39,400 INFO L225 Difference]: With dead ends: 421 [2024-11-22 23:11:39,400 INFO L226 Difference]: Without dead ends: 337 [2024-11-22 23:11:39,401 INFO L431 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 [2024-11-22 23:11:39,402 INFO L432 NwaCegarLoop]: 269 mSDtfsCounter, 111 mSDsluCounter, 465 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 734 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.1s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:39,402 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 734 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-22 23:11:39,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2024-11-22 23:11:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 335. [2024-11-22 23:11:39,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 335 states, 247 states have (on average 1.242914979757085) internal successors, (307), 244 states have internal predecessors, (307), 64 states have call successors, (64), 14 states have call predecessors, (64), 20 states have return successors, (83), 76 states have call predecessors, (83), 62 states have call successors, (83) [2024-11-22 23:11:39,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2024-11-22 23:11:39,427 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 78 [2024-11-22 23:11:39,428 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:39,428 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2024-11-22 23:11:39,428 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 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) [2024-11-22 23:11:39,428 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2024-11-22 23:11:39,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-22 23:11:39,428 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:39,429 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 2, 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, 1, 1, 1, 1] [2024-11-22 23:11:39,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 23:11:39,429 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:39,429 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:39,429 INFO L85 PathProgramCache]: Analyzing trace with hash -1248403262, now seen corresponding path program 1 times [2024-11-22 23:11:39,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:39,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950014682] [2024-11-22 23:11:39,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:39,430 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:39,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:39,684 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 115 trivial. 0 not checked. [2024-11-22 23:11:39,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:39,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950014682] [2024-11-22 23:11:39,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950014682] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:11:39,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 23:11:39,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 23:11:39,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2009590128] [2024-11-22 23:11:39,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:11:39,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 23:11:39,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:39,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 23:11:39,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 23:11:39,686 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2024-11-22 23:11:39,979 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:39,979 INFO L93 Difference]: Finished difference Result 345 states and 461 transitions. [2024-11-22 23:11:39,980 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 23:11:39,980 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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 80 [2024-11-22 23:11:39,980 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:39,981 INFO L225 Difference]: With dead ends: 345 [2024-11-22 23:11:39,981 INFO L226 Difference]: Without dead ends: 254 [2024-11-22 23:11:39,982 INFO L431 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 [2024-11-22 23:11:39,982 INFO L432 NwaCegarLoop]: 270 mSDtfsCounter, 85 mSDsluCounter, 466 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 736 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:39,982 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 736 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-22 23:11:39,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2024-11-22 23:11:39,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 254. [2024-11-22 23:11:39,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 186 states have (on average 1.2419354838709677) internal successors, (231), 186 states have internal predecessors, (231), 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) [2024-11-22 23:11:39,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 345 transitions. [2024-11-22 23:11:39,997 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 345 transitions. Word has length 80 [2024-11-22 23:11:39,997 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:39,997 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 345 transitions. [2024-11-22 23:11:39,998 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 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) [2024-11-22 23:11:39,998 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 345 transitions. [2024-11-22 23:11:40,000 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-22 23:11:40,000 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:40,000 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:40,000 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-22 23:11:40,000 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:40,000 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:40,001 INFO L85 PathProgramCache]: Analyzing trace with hash 1166047273, now seen corresponding path program 1 times [2024-11-22 23:11:40,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:40,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873495838] [2024-11-22 23:11:40,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:40,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:40,948 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-22 23:11:40,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:40,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873495838] [2024-11-22 23:11:40,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [873495838] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:40,948 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1220357542] [2024-11-22 23:11:40,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:40,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:40,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:40,951 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) [2024-11-22 23:11:40,951 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-22 23:11:41,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:41,394 INFO L255 TraceCheckSpWp]: Trace formula consists of 1283 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 23:11:41,400 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:41,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 20 [2024-11-22 23:11:41,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:41,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-22 23:11:41,633 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 [2024-11-22 23:11:41,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:41,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-22 23:11:41,709 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:41,709 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-22 23:11:41,738 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-22 23:11:41,739 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:11:41,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1220357542] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:41,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 23:11:41,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2024-11-22 23:11:41,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924096379] [2024-11-22 23:11:41,918 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 23:11:41,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-22 23:11:41,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:41,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-22 23:11:41,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-11-22 23:11:41,919 INFO L87 Difference]: Start difference. First operand 254 states and 345 transitions. Second operand has 18 states, 15 states have (on average 7.066666666666666) internal successors, (106), 18 states have internal predecessors, (106), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-22 23:11:46,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:11:46,163 INFO L93 Difference]: Finished difference Result 1069 states and 1551 transitions. [2024-11-22 23:11:46,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2024-11-22 23:11:46,163 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 15 states have (on average 7.066666666666666) internal successors, (106), 18 states have internal predecessors, (106), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 126 [2024-11-22 23:11:46,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:11:46,168 INFO L225 Difference]: With dead ends: 1069 [2024-11-22 23:11:46,168 INFO L226 Difference]: Without dead ends: 835 [2024-11-22 23:11:46,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 165 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 522 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=401, Invalid=2049, Unknown=0, NotChecked=0, Total=2450 [2024-11-22 23:11:46,170 INFO L432 NwaCegarLoop]: 255 mSDtfsCounter, 1801 mSDsluCounter, 2238 mSDsCounter, 0 mSdLazyCounter, 2201 mSolverCounterSat, 1147 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1811 SdHoareTripleChecker+Valid, 2493 SdHoareTripleChecker+Invalid, 3348 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1147 IncrementalHoareTripleChecker+Valid, 2201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.5s IncrementalHoareTripleChecker+Time [2024-11-22 23:11:46,170 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1811 Valid, 2493 Invalid, 3348 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1147 Valid, 2201 Invalid, 0 Unknown, 0 Unchecked, 3.5s Time] [2024-11-22 23:11:46,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 835 states. [2024-11-22 23:11:46,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 835 to 779. [2024-11-22 23:11:46,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 543 states have (on average 1.278084714548803) internal successors, (694), 522 states have internal predecessors, (694), 188 states have call successors, (188), 28 states have call predecessors, (188), 44 states have return successors, (271), 228 states have call predecessors, (271), 185 states have call successors, (271) [2024-11-22 23:11:46,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1153 transitions. [2024-11-22 23:11:46,224 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1153 transitions. Word has length 126 [2024-11-22 23:11:46,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:11:46,224 INFO L471 AbstractCegarLoop]: Abstraction has 779 states and 1153 transitions. [2024-11-22 23:11:46,224 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 15 states have (on average 7.066666666666666) internal successors, (106), 18 states have internal predecessors, (106), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-22 23:11:46,224 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1153 transitions. [2024-11-22 23:11:46,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 125 [2024-11-22 23:11:46,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:11:46,226 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:11:46,241 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-22 23:11:46,429 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:46,430 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:11:46,430 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:11:46,430 INFO L85 PathProgramCache]: Analyzing trace with hash 1645001396, now seen corresponding path program 1 times [2024-11-22 23:11:46,430 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:11:46,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329334580] [2024-11-22 23:11:46,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:46,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:11:46,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:47,432 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-22 23:11:47,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:11:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1329334580] [2024-11-22 23:11:47,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1329334580] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:47,432 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1196142682] [2024-11-22 23:11:47,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:11:47,432 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:11:47,433 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:11:47,437 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) [2024-11-22 23:11:47,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-22 23:11:47,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:11:47,842 INFO L255 TraceCheckSpWp]: Trace formula consists of 1280 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-22 23:11:47,847 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:11:47,915 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 20 [2024-11-22 23:11:47,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:47,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-22 23:11:48,044 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 [2024-11-22 23:11:48,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:48,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 23 [2024-11-22 23:11:48,113 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:11:48,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 7 [2024-11-22 23:11:48,148 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 48 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2024-11-22 23:11:48,148 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:11:48,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1196142682] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:11:48,321 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 23:11:48,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2024-11-22 23:11:48,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404808434] [2024-11-22 23:11:48,321 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 23:11:48,321 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-22 23:11:48,322 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:11:48,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-22 23:11:48,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=447, Unknown=0, NotChecked=0, Total=506 [2024-11-22 23:11:48,323 INFO L87 Difference]: Start difference. First operand 779 states and 1153 transitions. Second operand has 19 states, 16 states have (on average 6.375) internal successors, (102), 19 states have internal predecessors, (102), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-22 23:11:53,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 23:12:01,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:12:01,168 INFO L93 Difference]: Finished difference Result 2049 states and 2912 transitions. [2024-11-22 23:12:01,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-22 23:12:01,168 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 16 states have (on average 6.375) internal successors, (102), 19 states have internal predecessors, (102), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) Word has length 124 [2024-11-22 23:12:01,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:12:01,176 INFO L225 Difference]: With dead ends: 2049 [2024-11-22 23:12:01,176 INFO L226 Difference]: Without dead ends: 1298 [2024-11-22 23:12:01,180 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 227 GetRequests, 163 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1048 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=611, Invalid=3679, Unknown=0, NotChecked=0, Total=4290 [2024-11-22 23:12:01,180 INFO L432 NwaCegarLoop]: 256 mSDtfsCounter, 2028 mSDsluCounter, 2705 mSDsCounter, 0 mSdLazyCounter, 2933 mSolverCounterSat, 1249 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2038 SdHoareTripleChecker+Valid, 2961 SdHoareTripleChecker+Invalid, 4183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1249 IncrementalHoareTripleChecker+Valid, 2933 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.0s IncrementalHoareTripleChecker+Time [2024-11-22 23:12:01,180 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2038 Valid, 2961 Invalid, 4183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1249 Valid, 2933 Invalid, 1 Unknown, 0 Unchecked, 11.0s Time] [2024-11-22 23:12:01,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1298 states. [2024-11-22 23:12:01,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1298 to 1212. [2024-11-22 23:12:01,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1212 states, 856 states have (on average 1.2651869158878504) internal successors, (1083), 832 states have internal predecessors, (1083), 276 states have call successors, (276), 52 states have call predecessors, (276), 76 states have return successors, (386), 327 states have call predecessors, (386), 270 states have call successors, (386) [2024-11-22 23:12:01,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1212 states to 1212 states and 1745 transitions. [2024-11-22 23:12:01,266 INFO L78 Accepts]: Start accepts. Automaton has 1212 states and 1745 transitions. Word has length 124 [2024-11-22 23:12:01,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:12:01,266 INFO L471 AbstractCegarLoop]: Abstraction has 1212 states and 1745 transitions. [2024-11-22 23:12:01,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 16 states have (on average 6.375) internal successors, (102), 19 states have internal predecessors, (102), 9 states have call successors, (18), 6 states have call predecessors, (18), 5 states have return successors, (16), 7 states have call predecessors, (16), 7 states have call successors, (16) [2024-11-22 23:12:01,266 INFO L276 IsEmpty]: Start isEmpty. Operand 1212 states and 1745 transitions. [2024-11-22 23:12:01,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-22 23:12:01,268 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:12:01,268 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:12:01,278 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-22 23:12:01,468 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,SelfDestructingSolverStorable17 [2024-11-22 23:12:01,469 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:12:01,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:12:01,470 INFO L85 PathProgramCache]: Analyzing trace with hash 316397215, now seen corresponding path program 1 times [2024-11-22 23:12:01,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:12:01,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012971127] [2024-11-22 23:12:01,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:01,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:12:01,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:02,354 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-22 23:12:02,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:12:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012971127] [2024-11-22 23:12:02,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012971127] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:12:02,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804767211] [2024-11-22 23:12:02,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:02,355 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:12:02,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:12:02,357 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) [2024-11-22 23:12:02,358 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-22 23:12:02,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:02,782 INFO L255 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-22 23:12:02,788 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:12:02,863 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 [2024-11-22 23:12:02,992 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 [2024-11-22 23:12:03,033 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 64 proven. 2 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-22 23:12:03,033 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:12:03,193 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 [2024-11-22 23:12:03,205 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 [2024-11-22 23:12:03,331 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 [2024-11-22 23:12:03,334 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 [2024-11-22 23:12:03,453 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 [2024-11-22 23:12:03,456 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 [2024-11-22 23:12:03,612 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-22 23:12:03,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804767211] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 23:12:03,613 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 23:12:03,613 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12, 12] total 28 [2024-11-22 23:12:03,613 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937261902] [2024-11-22 23:12:03,613 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 23:12:03,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-11-22 23:12:03,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:12:03,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-11-22 23:12:03,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=672, Unknown=0, NotChecked=0, Total=756 [2024-11-22 23:12:03,615 INFO L87 Difference]: Start difference. First operand 1212 states and 1745 transitions. Second operand has 28 states, 24 states have (on average 5.0) internal successors, (120), 27 states have internal predecessors, (120), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-22 23:12:05,268 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 23:12:10,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:12:10,919 INFO L93 Difference]: Finished difference Result 2216 states and 3091 transitions. [2024-11-22 23:12:10,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-22 23:12:10,920 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 27 states have internal predecessors, (120), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) Word has length 122 [2024-11-22 23:12:10,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:12:10,927 INFO L225 Difference]: With dead ends: 2216 [2024-11-22 23:12:10,927 INFO L226 Difference]: Without dead ends: 1190 [2024-11-22 23:12:10,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 305 GetRequests, 233 SyntacticMatches, 3 SemanticMatches, 69 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1120 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=798, Invalid=4172, Unknown=0, NotChecked=0, Total=4970 [2024-11-22 23:12:10,933 INFO L432 NwaCegarLoop]: 355 mSDtfsCounter, 1960 mSDsluCounter, 3475 mSDsCounter, 0 mSdLazyCounter, 4581 mSolverCounterSat, 1013 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1970 SdHoareTripleChecker+Valid, 3830 SdHoareTripleChecker+Invalid, 5594 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1013 IncrementalHoareTripleChecker+Valid, 4581 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.8s IncrementalHoareTripleChecker+Time [2024-11-22 23:12:10,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1970 Valid, 3830 Invalid, 5594 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1013 Valid, 4581 Invalid, 0 Unknown, 0 Unchecked, 5.8s Time] [2024-11-22 23:12:10,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1190 states. [2024-11-22 23:12:11,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1190 to 1103. [2024-11-22 23:12:11,013 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1103 states, 797 states have (on average 1.2509410288582183) internal successors, (997), 780 states have internal predecessors, (997), 223 states have call successors, (223), 54 states have call predecessors, (223), 79 states have return successors, (307), 268 states have call predecessors, (307), 218 states have call successors, (307) [2024-11-22 23:12:11,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1103 states to 1103 states and 1527 transitions. [2024-11-22 23:12:11,018 INFO L78 Accepts]: Start accepts. Automaton has 1103 states and 1527 transitions. Word has length 122 [2024-11-22 23:12:11,018 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:12:11,018 INFO L471 AbstractCegarLoop]: Abstraction has 1103 states and 1527 transitions. [2024-11-22 23:12:11,018 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 24 states have (on average 5.0) internal successors, (120), 27 states have internal predecessors, (120), 12 states have call successors, (23), 9 states have call predecessors, (23), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-22 23:12:11,018 INFO L276 IsEmpty]: Start isEmpty. Operand 1103 states and 1527 transitions. [2024-11-22 23:12:11,019 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-22 23:12:11,020 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:12:11,020 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:12:11,029 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-22 23:12:11,223 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:12:11,224 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:12:11,224 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:12:11,224 INFO L85 PathProgramCache]: Analyzing trace with hash 954564419, now seen corresponding path program 1 times [2024-11-22 23:12:11,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:12:11,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278912617] [2024-11-22 23:12:11,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:11,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:12:11,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:12,549 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 42 refuted. 0 times theorem prover too weak. 131 trivial. 0 not checked. [2024-11-22 23:12:12,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:12:12,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278912617] [2024-11-22 23:12:12,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [278912617] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:12:12,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1851412241] [2024-11-22 23:12:12,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:12,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:12:12,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:12:12,553 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 23:12:12,554 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-22 23:12:13,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:13,017 INFO L255 TraceCheckSpWp]: Trace formula consists of 1276 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-22 23:12:13,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:12:13,337 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 66 proven. 0 refuted. 0 times theorem prover too weak. 123 trivial. 0 not checked. [2024-11-22 23:12:13,337 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 23:12:13,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1851412241] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 23:12:13,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 23:12:13,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [13] total 23 [2024-11-22 23:12:13,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749450016] [2024-11-22 23:12:13,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 23:12:13,338 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-22 23:12:13,338 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:12:13,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-22 23:12:13,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2024-11-22 23:12:13,339 INFO L87 Difference]: Start difference. First operand 1103 states and 1527 transitions. Second operand has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-22 23:12:15,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:12:15,178 INFO L93 Difference]: Finished difference Result 2604 states and 3641 transitions. [2024-11-22 23:12:15,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2024-11-22 23:12:15,179 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 122 [2024-11-22 23:12:15,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:12:15,188 INFO L225 Difference]: With dead ends: 2604 [2024-11-22 23:12:15,188 INFO L226 Difference]: Without dead ends: 1630 [2024-11-22 23:12:15,192 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=397, Invalid=1009, Unknown=0, NotChecked=0, Total=1406 [2024-11-22 23:12:15,194 INFO L432 NwaCegarLoop]: 195 mSDtfsCounter, 685 mSDsluCounter, 690 mSDsCounter, 0 mSdLazyCounter, 1938 mSolverCounterSat, 504 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 688 SdHoareTripleChecker+Valid, 885 SdHoareTripleChecker+Invalid, 2442 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 504 IncrementalHoareTripleChecker+Valid, 1938 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2024-11-22 23:12:15,194 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [688 Valid, 885 Invalid, 2442 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [504 Valid, 1938 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2024-11-22 23:12:15,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1630 states. [2024-11-22 23:12:15,301 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1630 to 1374. [2024-11-22 23:12:15,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1374 states, 1003 states have (on average 1.2313060817547359) internal successors, (1235), 963 states have internal predecessors, (1235), 257 states have call successors, (257), 63 states have call predecessors, (257), 110 states have return successors, (397), 347 states have call predecessors, (397), 252 states have call successors, (397) [2024-11-22 23:12:15,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1374 states to 1374 states and 1889 transitions. [2024-11-22 23:12:15,308 INFO L78 Accepts]: Start accepts. Automaton has 1374 states and 1889 transitions. Word has length 122 [2024-11-22 23:12:15,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:12:15,309 INFO L471 AbstractCegarLoop]: Abstraction has 1374 states and 1889 transitions. [2024-11-22 23:12:15,310 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 14 states have (on average 4.642857142857143) internal successors, (65), 11 states have internal predecessors, (65), 5 states have call successors, (9), 5 states have call predecessors, (9), 5 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-11-22 23:12:15,310 INFO L276 IsEmpty]: Start isEmpty. Operand 1374 states and 1889 transitions. [2024-11-22 23:12:15,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-22 23:12:15,311 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:12:15,311 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:12:15,324 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-22 23:12:15,515 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:12:15,517 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:12:15,517 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:12:15,517 INFO L85 PathProgramCache]: Analyzing trace with hash -74794879, now seen corresponding path program 1 times [2024-11-22 23:12:15,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:12:15,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800738381] [2024-11-22 23:12:15,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:15,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:12:15,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:17,554 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 16 proven. 65 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-22 23:12:17,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 23:12:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800738381] [2024-11-22 23:12:17,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [800738381] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:12:17,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2001810526] [2024-11-22 23:12:17,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 23:12:17,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 23:12:17,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-22 23:12:17,559 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-22 23:12:18,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 23:12:18,192 INFO L255 TraceCheckSpWp]: Trace formula consists of 1265 conjuncts, 74 conjuncts are in the unsatisfiable core [2024-11-22 23:12:18,197 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 23:12:18,676 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 [2024-11-22 23:12:18,752 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 22 [2024-11-22 23:12:18,755 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 [2024-11-22 23:12:18,847 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:12:18,847 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 [2024-11-22 23:12:19,148 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 13 treesize of output 9 [2024-11-22 23:12:19,831 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 31 treesize of output 15 [2024-11-22 23:12:20,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-22 23:12:20,383 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 [2024-11-22 23:12:20,429 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 20 proven. 115 refuted. 0 times theorem prover too weak. 54 trivial. 0 not checked. [2024-11-22 23:12:20,429 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 23:12:20,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2001810526] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 23:12:20,642 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 23:12:20,642 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 26] total 39 [2024-11-22 23:12:20,642 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813853064] [2024-11-22 23:12:20,642 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 23:12:20,643 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-11-22 23:12:20,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 23:12:20,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-11-22 23:12:20,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1565, Unknown=0, NotChecked=0, Total=1722 [2024-11-22 23:12:20,644 INFO L87 Difference]: Start difference. First operand 1374 states and 1889 transitions. Second operand has 40 states, 38 states have (on average 3.736842105263158) internal successors, (142), 38 states have internal predecessors, (142), 8 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-22 23:12:24,075 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 23:12:33,154 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 [] [2024-11-22 23:12:37,172 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-22 23:12:44,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-22 23:12:44,774 INFO L93 Difference]: Finished difference Result 2683 states and 3577 transitions. [2024-11-22 23:12:44,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 48 states. [2024-11-22 23:12:44,775 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 3.736842105263158) internal successors, (142), 38 states have internal predecessors, (142), 8 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Word has length 122 [2024-11-22 23:12:44,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-22 23:12:44,791 INFO L225 Difference]: With dead ends: 2683 [2024-11-22 23:12:44,791 INFO L226 Difference]: Without dead ends: 2404 [2024-11-22 23:12:44,796 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 192 GetRequests, 107 SyntacticMatches, 1 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2034 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=1119, Invalid=6191, Unknown=0, NotChecked=0, Total=7310 [2024-11-22 23:12:44,796 INFO L432 NwaCegarLoop]: 186 mSDtfsCounter, 2495 mSDsluCounter, 3358 mSDsCounter, 0 mSdLazyCounter, 5625 mSolverCounterSat, 1386 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2495 SdHoareTripleChecker+Valid, 3544 SdHoareTripleChecker+Invalid, 7012 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1386 IncrementalHoareTripleChecker+Valid, 5625 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 21.5s IncrementalHoareTripleChecker+Time [2024-11-22 23:12:44,797 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2495 Valid, 3544 Invalid, 7012 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1386 Valid, 5625 Invalid, 1 Unknown, 0 Unchecked, 21.5s Time] [2024-11-22 23:12:44,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2404 states. [2024-11-22 23:12:44,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2404 to 1929. [2024-11-22 23:12:44,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1929 states, 1415 states have (on average 1.2070671378091873) internal successors, (1708), 1375 states have internal predecessors, (1708), 338 states have call successors, (338), 103 states have call predecessors, (338), 172 states have return successors, (528), 450 states have call predecessors, (528), 330 states have call successors, (528) [2024-11-22 23:12:45,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1929 states to 1929 states and 2574 transitions. [2024-11-22 23:12:45,003 INFO L78 Accepts]: Start accepts. Automaton has 1929 states and 2574 transitions. Word has length 122 [2024-11-22 23:12:45,003 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-22 23:12:45,003 INFO L471 AbstractCegarLoop]: Abstraction has 1929 states and 2574 transitions. [2024-11-22 23:12:45,003 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 3.736842105263158) internal successors, (142), 38 states have internal predecessors, (142), 8 states have call successors, (18), 10 states have call predecessors, (18), 11 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2024-11-22 23:12:45,003 INFO L276 IsEmpty]: Start isEmpty. Operand 1929 states and 2574 transitions. [2024-11-22 23:12:45,004 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2024-11-22 23:12:45,004 INFO L207 NwaCegarLoop]: Found error trace [2024-11-22 23:12:45,005 INFO L215 NwaCegarLoop]: trace histogram [8, 8, 8, 5, 5, 5, 5, 5, 5, 5, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:12:45,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-22 23:12:45,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-22 23:12:45,209 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [__CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (and 14 more)] === [2024-11-22 23:12:45,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 23:12:45,210 INFO L85 PathProgramCache]: Analyzing trace with hash 1976326311, now seen corresponding path program 1 times [2024-11-22 23:12:45,210 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 23:12:45,210 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1564717546] [2024-11-22 23:12:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 23:12:45,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 23:12:45,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:12:45,535 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 23:12:45,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 23:12:45,791 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 23:12:45,792 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 23:12:45,792 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ##fun~$Pointer$~TO~$Pointer$Err3ASSERT_VIOLATIONINTEGER_OVERFLOW (15 of 16 remaining) [2024-11-22 23:12:45,794 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (14 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_lockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (13 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err0ASSERT_VIOLATIONINTEGER_OVERFLOW (12 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err1ASSERT_VIOLATIONINTEGER_OVERFLOW (11 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ##fun~$Pointer$~TO~$Pointer$Err2ASSERT_VIOLATIONINTEGER_OVERFLOW (10 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (9 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (8 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (7 of 16 remaining) [2024-11-22 23:12:45,795 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_csErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (6 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (5 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __CS_pthread_mutex_unlockErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (4 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0ASSERT_VIOLATIONINTEGER_OVERFLOW (3 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1ASSERT_VIOLATIONINTEGER_OVERFLOW (2 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONINTEGER_OVERFLOW (1 of 16 remaining) [2024-11-22 23:12:45,796 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3ASSERT_VIOLATIONINTEGER_OVERFLOW (0 of 16 remaining) [2024-11-22 23:12:45,796 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-22 23:12:45,798 INFO L407 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 23:12:45,896 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 23:12:45,899 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 11:12:45 BoogieIcfgContainer [2024-11-22 23:12:45,899 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 23:12:45,900 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 23:12:45,900 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 23:12:45,900 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 23:12:45,900 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:11:29" (3/4) ... [2024-11-22 23:12:45,901 INFO L136 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-22 23:12:45,980 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-22 23:12:45,981 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 23:12:45,981 INFO L158 Benchmark]: Toolchain (without parser) took 77903.11ms. Allocated memory was 172.0MB in the beginning and 1.0GB in the end (delta: 870.3MB). Free memory was 99.9MB in the beginning and 739.9MB in the end (delta: -640.0MB). Peak memory consumption was 230.4MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,981 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 172.0MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 23:12:45,981 INFO L158 Benchmark]: CACSL2BoogieTranslator took 570.75ms. Allocated memory was 172.0MB in the beginning and 291.5MB in the end (delta: 119.5MB). Free memory was 99.5MB in the beginning and 249.4MB in the end (delta: -149.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,982 INFO L158 Benchmark]: Boogie Procedure Inliner took 62.97ms. Allocated memory is still 291.5MB. Free memory was 249.4MB in the beginning and 244.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,982 INFO L158 Benchmark]: Boogie Preprocessor took 73.59ms. Allocated memory is still 291.5MB. Free memory was 244.2MB in the beginning and 236.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,983 INFO L158 Benchmark]: RCFGBuilder took 908.88ms. Allocated memory is still 291.5MB. Free memory was 236.8MB in the beginning and 169.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,983 INFO L158 Benchmark]: TraceAbstraction took 76199.73ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 750.8MB). Free memory was 169.7MB in the beginning and 757.8MB in the end (delta: -588.0MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,983 INFO L158 Benchmark]: Witness Printer took 80.92ms. Allocated memory is still 1.0GB. Free memory was 757.8MB in the beginning and 739.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-22 23:12:45,985 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.81ms. Allocated memory is still 172.0MB. Free memory is still 124.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 570.75ms. Allocated memory was 172.0MB in the beginning and 291.5MB in the end (delta: 119.5MB). Free memory was 99.5MB in the beginning and 249.4MB in the end (delta: -149.9MB). Peak memory consumption was 22.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 62.97ms. Allocated memory is still 291.5MB. Free memory was 249.4MB in the beginning and 244.2MB in the end (delta: 5.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.59ms. Allocated memory is still 291.5MB. Free memory was 244.2MB in the beginning and 236.8MB in the end (delta: 7.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * RCFGBuilder took 908.88ms. Allocated memory is still 291.5MB. Free memory was 236.8MB in the beginning and 169.7MB in the end (delta: 67.1MB). Peak memory consumption was 67.1MB. Max. memory is 16.1GB. * TraceAbstraction took 76199.73ms. Allocated memory was 291.5MB in the beginning and 1.0GB in the end (delta: 750.8MB). Free memory was 169.7MB in the beginning and 757.8MB in the end (delta: -588.0MB). Peak memory consumption was 163.8MB. Max. memory is 16.1GB. * Witness Printer took 80.92ms. Allocated memory is still 1.0GB. Free memory was 757.8MB in the beginning and 739.9MB in the end (delta: 17.8MB). Peak memory consumption was 16.8MB. 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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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) VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={13:0}, __CS_cp_mutex={14: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}] [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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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={13:0}, __CS_cp_mutex={14: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) VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={13:0}, __CS_cp_mutex={14: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}] [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={13:0}, __CS_cp_mutex={14: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) VAL [__CS_cp___CS_thread_lockedon={17:0}, __CS_cp___CS_thread_status={15:0}, __CS_cp_data={13:0}, __CS_cp_mutex={14: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}] [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={18:0}, t2={11:0}, t3={19: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=1, 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=1, __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={18:0}, t2={11:0}, t3={19: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=1, __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={18:0}, t2={11:0}, t3={19: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)={18: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=1, __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)={18: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=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}] [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=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={18:0}, t2={11:0}, t3={19:0}] [L729] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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=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}, k=0, 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={18:0}, t2={11:0}, t3={19: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={13:0}, __CS_cp_mutex={14: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=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}] [L780] CALL __CS_thread[1](0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L683] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}, 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)=1, \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}] [L683] COND FALSE !(__CS_ret != 0) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L684] CALL __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8: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}] [L580] EXPR \read(*lock) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8: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}, lock={8:1}, mutex={8:0}] [L580] COND TRUE *lock == 0 [L580] EXPR __CS_thread_index+1 [L580] *lock = (__CS_thread_index+1) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8: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}] [L582] return 0; VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \old(__CS_thread_index)=1, \old(lock)={8:1}, \result=0, __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}] [L684] RET __CS_pthread_mutex_lock(&mutex[__CS_round]) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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] CALL __CS_cs() VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L560] unsigned char k = __VERIFIER_nondet_uchar(); [L561] EXPR __CS_round+k VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}] [L561] COND FALSE !(!(__CS_round+k < 2)) VAL [\old(__CS_error)=0, \old(__CS_ret)=0, \old(__CS_round)=1, \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}, k=0, 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)=1, \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)=1, \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: 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: 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: 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: 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. - 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. - StatisticsResult: Ultimate Automizer benchmark data CFG has 7 procedures, 192 locations, 16 error locations. Started 1 CEGAR loops. OverallTime: 76.0s, OverallIterations: 22, TraceHistogramMax: 8, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 54.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 10620 SdHoareTripleChecker+Valid, 46.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 10540 mSDsluCounter, 24327 SdHoareTripleChecker+Invalid, 43.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 19197 mSDsCounter, 5548 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18181 IncrementalHoareTripleChecker+Invalid, 23731 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 5548 mSolverCounterUnsat, 5130 mSDtfsCounter, 18181 mSolverCounterSat, 0.2s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1430 GetRequests, 1063 SyntacticMatches, 6 SemanticMatches, 361 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5051 ImplicationChecksByTransitivity, 8.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=1929occurred in iteration=21, InterpolantAutomatonStates: 274, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 21 MinimizatonAttempts, 1054 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.5s SsaConstructionTime, 2.2s SatisfiabilityAnalysisTime, 12.8s InterpolantComputationTime, 2272 NumberOfCodeBlocks, 2172 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 2343 ConstructedInterpolants, 0 QuantifiedInterpolants, 14262 SizeOfPredicates, 62 NumberOfNonLiveVariables, 8987 ConjunctsInSsa, 223 ConjunctsInUnsatCore, 35 InterpolantComputations, 15 PerfectInterpolantSequences, 2910/3157 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 RESULT: Ultimate proved your program to be incorrect! [2024-11-22 23:12:46,022 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW)