./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 8be7027f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-12 17:54:57,700 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-12 17:54:57,782 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Overflow-32bit-Automizer_Default.epf [2024-11-12 17:54:57,795 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-12 17:54:57,796 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-12 17:54:57,826 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-12 17:54:57,826 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-12 17:54:57,827 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-12 17:54:57,827 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-12 17:54:57,828 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-12 17:54:57,829 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-12 17:54:57,829 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-12 17:54:57,830 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-12 17:54:57,830 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-12 17:54:57,830 INFO L153 SettingsManager]: * Use SBE=true [2024-11-12 17:54:57,832 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-12 17:54:57,832 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-12 17:54:57,833 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-12 17:54:57,833 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-12 17:54:57,833 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-12 17:54:57,837 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-12 17:54:57,838 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-12 17:54:57,838 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-12 17:54:57,838 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-12 17:54:57,838 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-12 17:54:57,839 INFO L153 SettingsManager]: * Check absence of signed integer overflows=ASSERTandASSUME [2024-11-12 17:54:57,839 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-12 17:54:57,839 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-12 17:54:57,839 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-12 17:54:57,839 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-12 17:54:57,840 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-12 17:54:57,840 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-12 17:54:57,840 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-12 17:54:57,840 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-12 17:54:57,840 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:54:57,841 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-12 17:54:57,841 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-12 17:54:57,841 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-12 17:54:57,841 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-12 17:54:57,842 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-12 17:54:57,842 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-12 17:54:57,843 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-12 17:54:57,843 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-12 17:54:57,844 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-12 17:54:57,844 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-12 17:54:58,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-12 17:54:58,153 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-12 17:54:58,156 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-12 17:54:58,157 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-12 17:54:58,157 INFO L274 PluginConnector]: CDTParser initialized [2024-11-12 17:54:58,159 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-12 17:54:59,643 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-12 17:54:59,962 INFO L384 CDTParser]: Found 1 translation units. [2024-11-12 17:54:59,962 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-pthread/cs_lazy.i [2024-11-12 17:54:59,987 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4893ee9c0/3445b3d4e6054bc5a2272c6ed9c83c57/FLAGab52d435c [2024-11-12 17:55:00,226 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4893ee9c0/3445b3d4e6054bc5a2272c6ed9c83c57 [2024-11-12 17:55:00,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-12 17:55:00,229 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-12 17:55:00,232 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-12 17:55:00,232 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-12 17:55:00,237 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-12 17:55:00,238 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,239 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1fe0f018 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00, skipping insertion in model container [2024-11-12 17:55:00,239 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,288 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-12 17:55:00,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:55:00,777 INFO L200 MainTranslator]: Completed pre-run [2024-11-12 17:55:00,844 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-12 17:55:00,890 INFO L204 MainTranslator]: Completed translation [2024-11-12 17:55:00,891 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00 WrapperNode [2024-11-12 17:55:00,891 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-12 17:55:00,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:00,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-12 17:55:00,892 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-12 17:55:00,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,922 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,976 INFO L138 Inliner]: procedures = 145, calls = 224, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 539 [2024-11-12 17:55:00,977 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-12 17:55:00,978 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-12 17:55:00,978 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-12 17:55:00,978 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-12 17:55:00,991 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:00,992 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,048 INFO L175 MemorySlicer]: Split 119 memory accesses to 14 slices as follows [2, 0, 10, 3, 10, 10, 25, 9, 16, 9, 5, 3, 8, 9]. 21 percent of accesses are in the largest equivalence class. The 34 initializations are split as follows [2, 0, 4, 0, 4, 4, 8, 0, 8, 2, 0, 0, 2, 0]. The 32 writes are split as follows [0, 0, 2, 1, 2, 2, 10, 1, 4, 3, 2, 1, 3, 1]. [2024-11-12 17:55:01,048 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,048 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,073 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,078 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,088 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,093 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,105 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-12 17:55:01,106 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-12 17:55:01,106 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-12 17:55:01,106 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-12 17:55:01,107 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (1/1) ... [2024-11-12 17:55:01,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-12 17:55:01,126 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:01,145 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-12 17:55:01,150 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-12 17:55:01,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-12 17:55:01,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-12 17:55:01,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-12 17:55:01,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-12 17:55:01,253 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2024-11-12 17:55:01,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2024-11-12 17:55:01,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#6 [2024-11-12 17:55:01,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#7 [2024-11-12 17:55:01,254 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#8 [2024-11-12 17:55:01,255 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#9 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#10 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#11 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#12 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#13 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-12 17:55:01,256 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-12 17:55:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-12 17:55:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-12 17:55:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2024-11-12 17:55:01,257 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2024-11-12 17:55:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#6 [2024-11-12 17:55:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#7 [2024-11-12 17:55:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#8 [2024-11-12 17:55:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#9 [2024-11-12 17:55:01,258 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#10 [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#11 [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#12 [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#13 [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-12 17:55:01,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-12 17:55:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-12 17:55:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-12 17:55:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-12 17:55:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#4 [2024-11-12 17:55:01,260 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#5 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#6 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#7 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#8 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#9 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#10 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#11 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#12 [2024-11-12 17:55:01,261 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#13 [2024-11-12 17:55:01,298 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_lock [2024-11-12 17:55:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_lock [2024-11-12 17:55:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_create [2024-11-12 17:55:01,299 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_create [2024-11-12 17:55:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-12 17:55:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-12 17:55:01,299 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#4 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#5 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#6 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#7 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#8 [2024-11-12 17:55:01,300 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#9 [2024-11-12 17:55:01,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#10 [2024-11-12 17:55:01,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#11 [2024-11-12 17:55:01,301 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#12 [2024-11-12 17:55:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#13 [2024-11-12 17:55:01,302 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_join [2024-11-12 17:55:01,303 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_join [2024-11-12 17:55:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-12 17:55:01,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ##fun~$Pointer$~TO~$Pointer$ [2024-11-12 17:55:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-12 17:55:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-12 17:55:01,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#4 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#5 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#6 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#7 [2024-11-12 17:55:01,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#8 [2024-11-12 17:55:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#9 [2024-11-12 17:55:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#10 [2024-11-12 17:55:01,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#11 [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#12 [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#13 [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_cs [2024-11-12 17:55:01,306 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_cs [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-12 17:55:01,306 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#6 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#7 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#8 [2024-11-12 17:55:01,307 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#9 [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#10 [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#11 [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#12 [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#13 [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure __CS_pthread_mutex_unlock [2024-11-12 17:55:01,308 INFO L138 BoogieDeclarations]: Found implementation of procedure __CS_pthread_mutex_unlock [2024-11-12 17:55:01,308 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-12 17:55:01,308 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-12 17:55:01,595 INFO L238 CfgBuilder]: Building ICFG [2024-11-12 17:55:01,597 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-12 17:55:02,022 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-12 17:55:02,022 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-12 17:55:02,023 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-12 17:55:02,023 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-12 17:55:02,023 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint L714: SUMMARY for call __CS_cs(); srcloc: null [2024-11-12 17:55:02,023 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-12 17:55:02,023 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-12 17:55:02,377 INFO L? ?]: Removed 100 outVars from TransFormulas that were not future-live. [2024-11-12 17:55:02,379 INFO L287 CfgBuilder]: Performing block encoding [2024-11-12 17:55:02,397 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-12 17:55:02,398 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-12 17:55:02,399 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:02 BoogieIcfgContainer [2024-11-12 17:55:02,399 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-12 17:55:02,402 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-12 17:55:02,402 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-12 17:55:02,405 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-12 17:55:02,406 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 05:55:00" (1/3) ... [2024-11-12 17:55:02,406 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29231c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:02, skipping insertion in model container [2024-11-12 17:55:02,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 05:55:00" (2/3) ... [2024-11-12 17:55:02,407 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@29231c06 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 05:55:02, skipping insertion in model container [2024-11-12 17:55:02,407 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 05:55:02" (3/3) ... [2024-11-12 17:55:02,409 INFO L112 eAbstractionObserver]: Analyzing ICFG cs_lazy.i [2024-11-12 17:55:02,428 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-12 17:55:02,428 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2024-11-12 17:55:02,510 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-12 17:55:02,517 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;@5075959e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-12 17:55:02,518 INFO L334 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2024-11-12 17:55:02,523 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-12 17:55:02,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-12 17:55:02,529 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:02,529 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-12 17:55:02,530 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-12 17:55:02,537 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:02,538 INFO L85 PathProgramCache]: Analyzing trace with hash 295904321, now seen corresponding path program 1 times [2024-11-12 17:55:02,547 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:02,548 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [122738724] [2024-11-12 17:55:02,548 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:02,548 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:02,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:02,919 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-12 17:55:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:02,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [122738724] [2024-11-12 17:55:02,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [122738724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:02,925 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:02,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:55:02,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857628868] [2024-11-12 17:55:02,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:02,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:02,940 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:02,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:02,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:02,989 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-12 17:55:03,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:03,104 INFO L93 Difference]: Finished difference Result 376 states and 592 transitions. [2024-11-12 17:55:03,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:03,107 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-12 17:55:03,107 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:03,117 INFO L225 Difference]: With dead ends: 376 [2024-11-12 17:55:03,117 INFO L226 Difference]: Without dead ends: 156 [2024-11-12 17:55:03,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:03,133 INFO L435 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-12 17:55:03,135 INFO L436 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-12 17:55:03,149 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-12 17:55:03,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-12 17:55:03,181 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-12 17:55:03,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 226 transitions. [2024-11-12 17:55:03,187 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 226 transitions. Word has length 5 [2024-11-12 17:55:03,187 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:03,187 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 226 transitions. [2024-11-12 17:55:03,187 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-12 17:55:03,188 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 226 transitions. [2024-11-12 17:55:03,188 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-11-12 17:55:03,188 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:03,189 INFO L218 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:03,189 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-12 17:55:03,189 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-12 17:55:03,190 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:03,190 INFO L85 PathProgramCache]: Analyzing trace with hash 2013066031, now seen corresponding path program 1 times [2024-11-12 17:55:03,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:03,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125075944] [2024-11-12 17:55:03,191 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:03,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:03,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:03,381 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-12 17:55:03,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:03,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125075944] [2024-11-12 17:55:03,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [125075944] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:03,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [834155614] [2024-11-12 17:55:03,382 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:03,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:03,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:03,386 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-12 17:55:03,388 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-12 17:55:03,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:03,621 INFO L256 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:55:03,627 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:03,671 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-12 17:55:03,671 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:03,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [834155614] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:03,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:03,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 4 [2024-11-12 17:55:03,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818394635] [2024-11-12 17:55:03,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:03,675 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-12 17:55:03,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:03,676 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-12 17:55:03,676 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:03,676 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-12 17:55:03,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:03,748 INFO L93 Difference]: Finished difference Result 156 states and 226 transitions. [2024-11-12 17:55:03,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-12 17:55:03,749 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-12 17:55:03,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:03,751 INFO L225 Difference]: With dead ends: 156 [2024-11-12 17:55:03,752 INFO L226 Difference]: Without dead ends: 155 [2024-11-12 17:55:03,753 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:03,754 INFO L435 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-12 17:55:03,754 INFO L436 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-12 17:55:03,756 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2024-11-12 17:55:03,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2024-11-12 17:55:03,774 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-12 17:55:03,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 225 transitions. [2024-11-12 17:55:03,776 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 225 transitions. Word has length 8 [2024-11-12 17:55:03,776 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:03,777 INFO L471 AbstractCegarLoop]: Abstraction has 155 states and 225 transitions. [2024-11-12 17:55:03,777 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-12 17:55:03,777 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 225 transitions. [2024-11-12 17:55:03,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 17:55:03,796 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:03,797 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:03,819 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:03,997 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-12 17:55:03,998 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-12 17:55:03,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:03,999 INFO L85 PathProgramCache]: Analyzing trace with hash -2019463875, now seen corresponding path program 1 times [2024-11-12 17:55:03,999 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:03,999 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104188974] [2024-11-12 17:55:03,999 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:03,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:04,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:04,135 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-12 17:55:04,136 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104188974] [2024-11-12 17:55:04,136 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104188974] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:04,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1588318493] [2024-11-12 17:55:04,136 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:04,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:04,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:04,142 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-12 17:55:04,143 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-12 17:55:04,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:04,354 INFO L256 TraceCheckSpWp]: Trace formula consists of 295 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:55:04,355 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:04,386 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-12 17:55:04,386 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:04,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1588318493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:04,387 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:04,387 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 17:55:04,387 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1763988883] [2024-11-12 17:55:04,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:04,387 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:04,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:04,388 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:04,388 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:04,388 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-12 17:55:04,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:04,471 INFO L93 Difference]: Finished difference Result 155 states and 225 transitions. [2024-11-12 17:55:04,472 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:04,472 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-12 17:55:04,472 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:04,474 INFO L225 Difference]: With dead ends: 155 [2024-11-12 17:55:04,474 INFO L226 Difference]: Without dead ends: 154 [2024-11-12 17:55:04,474 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:04,477 INFO L435 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-12 17:55:04,478 INFO L436 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-12 17:55:04,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-12 17:55:04,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 154. [2024-11-12 17:55:04,493 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-12 17:55:04,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 224 transitions. [2024-11-12 17:55:04,495 INFO L78 Accepts]: Start accepts. Automaton has 154 states and 224 transitions. Word has length 9 [2024-11-12 17:55:04,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:04,495 INFO L471 AbstractCegarLoop]: Abstraction has 154 states and 224 transitions. [2024-11-12 17:55:04,496 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-12 17:55:04,496 INFO L276 IsEmpty]: Start isEmpty. Operand 154 states and 224 transitions. [2024-11-12 17:55:04,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-12 17:55:04,497 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:04,497 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1] [2024-11-12 17:55:04,510 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-12 17:55:04,698 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-12 17:55:04,698 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-12 17:55:04,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:04,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2019462146, now seen corresponding path program 1 times [2024-11-12 17:55:04,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:04,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158931016] [2024-11-12 17:55:04,700 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:04,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:04,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:04,758 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-12 17:55:04,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:04,758 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158931016] [2024-11-12 17:55:04,759 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158931016] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:04,759 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:04,759 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-12 17:55:04,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821007610] [2024-11-12 17:55:04,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:04,759 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:04,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:04,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:04,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:04,760 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-12 17:55:04,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:04,790 INFO L93 Difference]: Finished difference Result 154 states and 224 transitions. [2024-11-12 17:55:04,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:04,791 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-12 17:55:04,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:04,795 INFO L225 Difference]: With dead ends: 154 [2024-11-12 17:55:04,795 INFO L226 Difference]: Without dead ends: 153 [2024-11-12 17:55:04,795 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-12 17:55:04,796 INFO L435 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-12 17:55:04,797 INFO L436 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-12 17:55:04,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-12 17:55:04,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 151. [2024-11-12 17:55:04,815 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-12 17:55:04,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-12 17:55:04,816 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 9 [2024-11-12 17:55:04,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:04,817 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-12 17:55:04,817 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-12 17:55:04,817 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-12 17:55:04,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-12 17:55:04,818 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:04,818 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:04,818 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-12 17:55:04,818 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-12 17:55:04,819 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:04,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1821129657, now seen corresponding path program 1 times [2024-11-12 17:55:04,819 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:04,819 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917108773] [2024-11-12 17:55:04,820 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:04,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:04,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:04,914 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-12 17:55:04,914 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:04,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917108773] [2024-11-12 17:55:04,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1917108773] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:04,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [722818386] [2024-11-12 17:55:04,915 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:04,915 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:04,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:04,917 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-12 17:55:04,920 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-12 17:55:05,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:05,117 INFO L256 TraceCheckSpWp]: Trace formula consists of 296 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:55:05,118 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:05,137 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-12 17:55:05,137 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:05,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [722818386] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:05,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:05,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 17:55:05,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1890500501] [2024-11-12 17:55:05,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:05,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:05,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:05,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:05,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:05,139 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-12 17:55:05,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:05,210 INFO L93 Difference]: Finished difference Result 300 states and 440 transitions. [2024-11-12 17:55:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:05,213 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-12 17:55:05,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:05,214 INFO L225 Difference]: With dead ends: 300 [2024-11-12 17:55:05,214 INFO L226 Difference]: Without dead ends: 159 [2024-11-12 17:55:05,215 INFO L434 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-12 17:55:05,217 INFO L435 NwaCegarLoop]: 215 mSDtfsCounter, 0 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.1s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:05,217 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 426 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-12 17:55:05,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-11-12 17:55:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 159. [2024-11-12 17:55:05,227 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-12 17:55:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 230 transitions. [2024-11-12 17:55:05,229 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 230 transitions. Word has length 10 [2024-11-12 17:55:05,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:05,229 INFO L471 AbstractCegarLoop]: Abstraction has 159 states and 230 transitions. [2024-11-12 17:55:05,229 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-12 17:55:05,230 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 230 transitions. [2024-11-12 17:55:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-12 17:55:05,230 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:05,231 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2024-11-12 17:55:05,249 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-12 17:55:05,431 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-12 17:55:05,432 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-12 17:55:05,432 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:05,432 INFO L85 PathProgramCache]: Analyzing trace with hash -204772944, now seen corresponding path program 1 times [2024-11-12 17:55:05,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:05,432 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290777615] [2024-11-12 17:55:05,432 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:05,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:05,570 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-12 17:55:05,570 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:05,570 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290777615] [2024-11-12 17:55:05,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [290777615] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:05,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1904813406] [2024-11-12 17:55:05,571 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:05,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:05,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:05,573 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-12 17:55:05,575 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-12 17:55:05,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:05,804 INFO L256 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 2 conjuncts are in the unsatisfiable core [2024-11-12 17:55:05,806 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:05,825 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-12 17:55:05,826 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:05,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1904813406] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:05,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:05,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [4] total 5 [2024-11-12 17:55:05,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759697049] [2024-11-12 17:55:05,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:05,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-12 17:55:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:05,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-12 17:55:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-12 17:55:05,828 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-12 17:55:05,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:05,930 INFO L93 Difference]: Finished difference Result 159 states and 230 transitions. [2024-11-12 17:55:05,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-12 17:55:05,938 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-12 17:55:05,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:05,940 INFO L225 Difference]: With dead ends: 159 [2024-11-12 17:55:05,940 INFO L226 Difference]: Without dead ends: 158 [2024-11-12 17:55:05,940 INFO L434 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-12 17:55:05,941 INFO L435 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-12 17:55:05,941 INFO L436 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-12 17:55:05,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 158 states. [2024-11-12 17:55:05,953 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 158 to 151. [2024-11-12 17:55:05,954 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-12 17:55:05,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 151 states to 151 states and 221 transitions. [2024-11-12 17:55:05,956 INFO L78 Accepts]: Start accepts. Automaton has 151 states and 221 transitions. Word has length 18 [2024-11-12 17:55:05,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:05,956 INFO L471 AbstractCegarLoop]: Abstraction has 151 states and 221 transitions. [2024-11-12 17:55:05,956 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-12 17:55:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 221 transitions. [2024-11-12 17:55:05,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2024-11-12 17:55:05,959 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:05,960 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:05,974 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-12 17:55:06,160 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-12 17:55:06,160 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-12 17:55:06,161 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:06,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1170227925, now seen corresponding path program 1 times [2024-11-12 17:55:06,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:06,161 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1831817044] [2024-11-12 17:55:06,161 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:06,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,344 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-12 17:55:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,363 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 34 [2024-11-12 17:55:06,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,368 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-12 17:55:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,375 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-12 17:55:06,375 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1831817044] [2024-11-12 17:55:06,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1831817044] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:06,375 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1951743606] [2024-11-12 17:55:06,375 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:06,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:06,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:06,380 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-12 17:55:06,383 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-12 17:55:06,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:06,677 INFO L256 TraceCheckSpWp]: Trace formula consists of 641 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:55:06,680 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:06,710 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-12 17:55:06,714 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:06,782 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-12 17:55:06,783 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1951743606] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:06,783 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:06,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2024-11-12 17:55:06,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808989125] [2024-11-12 17:55:06,783 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:06,783 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-12 17:55:06,783 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:06,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-12 17:55:06,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:55:06,785 INFO L87 Difference]: Start difference. First operand 151 states and 221 transitions. Second operand has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 17:55:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:07,432 INFO L93 Difference]: Finished difference Result 314 states and 463 transitions. [2024-11-12 17:55:07,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:55:07,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 51 [2024-11-12 17:55:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:07,436 INFO L225 Difference]: With dead ends: 314 [2024-11-12 17:55:07,436 INFO L226 Difference]: Without dead ends: 166 [2024-11-12 17:55:07,438 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 104 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:55:07,438 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 71 mSDsluCounter, 326 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 355 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:07,438 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [71 Valid, 513 Invalid, 355 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-12 17:55:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2024-11-12 17:55:07,454 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 160. [2024-11-12 17:55:07,454 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-12 17:55:07,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 230 transitions. [2024-11-12 17:55:07,457 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 230 transitions. Word has length 51 [2024-11-12 17:55:07,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:07,457 INFO L471 AbstractCegarLoop]: Abstraction has 160 states and 230 transitions. [2024-11-12 17:55:07,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 6.444444444444445) internal successors, (58), 7 states have internal predecessors, (58), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 17:55:07,458 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 230 transitions. [2024-11-12 17:55:07,462 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2024-11-12 17:55:07,462 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:07,462 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:07,484 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-12 17:55:07,665 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-12 17:55:07,666 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-12 17:55:07,666 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:07,667 INFO L85 PathProgramCache]: Analyzing trace with hash 1553781337, now seen corresponding path program 2 times [2024-11-12 17:55:07,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:07,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267111914] [2024-11-12 17:55:07,667 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:07,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:07,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,862 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 33 [2024-11-12 17:55:07,865 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,879 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 43 [2024-11-12 17:55:07,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,884 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 49 [2024-11-12 17:55:07,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:07,891 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-12 17:55:07,891 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267111914] [2024-11-12 17:55:07,891 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267111914] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:07,891 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [916510769] [2024-11-12 17:55:07,892 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-12 17:55:07,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:07,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:07,894 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-12 17:55:07,895 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-12 17:55:08,187 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-12 17:55:08,188 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-12 17:55:08,191 INFO L256 TraceCheckSpWp]: Trace formula consists of 524 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-12 17:55:08,196 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:08,287 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 25 treesize of output 13 [2024-11-12 17:55:08,339 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2024-11-12 17:55:08,340 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-12 17:55:08,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [916510769] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:08,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-12 17:55:08,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [6] total 9 [2024-11-12 17:55:08,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523661330] [2024-11-12 17:55:08,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:08,341 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-12 17:55:08,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:08,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-12 17:55:08,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:55:08,342 INFO L87 Difference]: Start difference. First operand 160 states and 230 transitions. Second operand has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 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-12 17:55:09,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:09,099 INFO L93 Difference]: Finished difference Result 422 states and 622 transitions. [2024-11-12 17:55:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-12 17:55:09,100 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 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 60 [2024-11-12 17:55:09,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:09,105 INFO L225 Difference]: With dead ends: 422 [2024-11-12 17:55:09,106 INFO L226 Difference]: Without dead ends: 311 [2024-11-12 17:55:09,107 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2024-11-12 17:55:09,107 INFO L435 NwaCegarLoop]: 275 mSDtfsCounter, 231 mSDsluCounter, 731 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 1006 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:09,108 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 1006 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-12 17:55:09,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2024-11-12 17:55:09,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 305. [2024-11-12 17:55:09,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 305 states, 213 states have (on average 1.403755868544601) internal successors, (299), 216 states have internal predecessors, (299), 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-12 17:55:09,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 305 states to 305 states and 455 transitions. [2024-11-12 17:55:09,149 INFO L78 Accepts]: Start accepts. Automaton has 305 states and 455 transitions. Word has length 60 [2024-11-12 17:55:09,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:09,151 INFO L471 AbstractCegarLoop]: Abstraction has 305 states and 455 transitions. [2024-11-12 17:55:09,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.25) internal successors, (37), 4 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-12 17:55:09,152 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 455 transitions. [2024-11-12 17:55:09,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-12 17:55:09,154 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:09,156 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-12 17:55:09,174 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-12 17:55:09,356 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-12 17:55:09,357 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-12 17:55:09,358 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:09,358 INFO L85 PathProgramCache]: Analyzing trace with hash 1238860846, now seen corresponding path program 1 times [2024-11-12 17:55:09,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:09,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271852229] [2024-11-12 17:55:09,358 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:09,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,555 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 31 [2024-11-12 17:55:09,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 41 [2024-11-12 17:55:09,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,577 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 47 [2024-11-12 17:55:09,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,584 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-12 17:55:09,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:09,585 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271852229] [2024-11-12 17:55:09,586 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [271852229] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:55:09,586 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [683883457] [2024-11-12 17:55:09,586 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:09,586 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:09,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:55:09,588 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-12 17:55:09,590 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-12 17:55:09,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:09,901 INFO L256 TraceCheckSpWp]: Trace formula consists of 725 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-12 17:55:09,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:55:09,939 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-12 17:55:09,939 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:55:09,990 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-12 17:55:09,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [683883457] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:55:09,990 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:55:09,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 7 [2024-11-12 17:55:09,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572544407] [2024-11-12 17:55:09,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:55:09,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:55:09,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:09,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:55:09,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:09,992 INFO L87 Difference]: Start difference. First operand 305 states and 455 transitions. Second operand has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 17:55:14,037 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-12 17:55:15,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:15,405 INFO L93 Difference]: Finished difference Result 619 states and 932 transitions. [2024-11-12 17:55:15,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-12 17:55:15,405 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) Word has length 58 [2024-11-12 17:55:15,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:15,408 INFO L225 Difference]: With dead ends: 619 [2024-11-12 17:55:15,409 INFO L226 Difference]: Without dead ends: 334 [2024-11-12 17:55:15,410 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 118 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:15,411 INFO L435 NwaCegarLoop]: 185 mSDtfsCounter, 74 mSDsluCounter, 321 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 75 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 5.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 352 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 5.4s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:15,411 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [74 Valid, 506 Invalid, 352 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 276 Invalid, 1 Unknown, 0 Unchecked, 5.4s Time] [2024-11-12 17:55:15,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 334 states. [2024-11-12 17:55:15,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 334 to 322. [2024-11-12 17:55:15,450 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-12 17:55:15,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 322 states to 322 states and 473 transitions. [2024-11-12 17:55:15,453 INFO L78 Accepts]: Start accepts. Automaton has 322 states and 473 transitions. Word has length 58 [2024-11-12 17:55:15,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:15,453 INFO L471 AbstractCegarLoop]: Abstraction has 322 states and 473 transitions. [2024-11-12 17:55:15,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 8.0) internal successors, (56), 5 states have internal predecessors, (56), 1 states have call successors, (10), 4 states have call predecessors, (10), 2 states have return successors, (6), 1 states have call predecessors, (6), 1 states have call successors, (6) [2024-11-12 17:55:15,453 INFO L276 IsEmpty]: Start isEmpty. Operand 322 states and 473 transitions. [2024-11-12 17:55:15,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 17:55:15,455 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:15,455 INFO L218 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-12 17:55:15,474 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-12 17:55:15,655 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:55:15,656 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-12 17:55:15,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:15,656 INFO L85 PathProgramCache]: Analyzing trace with hash -236048063, now seen corresponding path program 1 times [2024-11-12 17:55:15,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:15,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246665662] [2024-11-12 17:55:15,657 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:15,657 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:15,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,236 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 17:55:16,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,255 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:55:16,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,260 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 17:55:16,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:16,272 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-12 17:55:16,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:16,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246665662] [2024-11-12 17:55:16,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246665662] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:16,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:16,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 17:55:16,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941031123] [2024-11-12 17:55:16,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:16,275 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:55:16,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:16,276 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:55:16,276 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:16,276 INFO L87 Difference]: Start difference. First operand 322 states and 473 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 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-12 17:55:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:18,248 INFO L93 Difference]: Finished difference Result 642 states and 962 transitions. [2024-11-12 17:55:18,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-12 17:55:18,248 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 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-12 17:55:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:18,252 INFO L225 Difference]: With dead ends: 642 [2024-11-12 17:55:18,252 INFO L226 Difference]: Without dead ends: 365 [2024-11-12 17:55:18,253 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-12 17:55:18,254 INFO L435 NwaCegarLoop]: 204 mSDtfsCounter, 384 mSDsluCounter, 549 mSDsCounter, 0 mSdLazyCounter, 680 mSolverCounterSat, 181 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 397 SdHoareTripleChecker+Valid, 753 SdHoareTripleChecker+Invalid, 861 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 181 IncrementalHoareTripleChecker+Valid, 680 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:18,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [397 Valid, 753 Invalid, 861 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [181 Valid, 680 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2024-11-12 17:55:18,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 365 states. [2024-11-12 17:55:18,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 365 to 347. [2024-11-12 17:55:18,278 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 347 states, 247 states have (on average 1.3805668016194332) internal successors, (341), 251 states have internal predecessors, (341), 82 states have call successors, (82), 14 states have call predecessors, (82), 14 states have return successors, (90), 81 states have call predecessors, (90), 80 states have call successors, (90) [2024-11-12 17:55:18,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 347 states to 347 states and 513 transitions. [2024-11-12 17:55:18,280 INFO L78 Accepts]: Start accepts. Automaton has 347 states and 513 transitions. Word has length 71 [2024-11-12 17:55:18,281 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:18,281 INFO L471 AbstractCegarLoop]: Abstraction has 347 states and 513 transitions. [2024-11-12 17:55:18,281 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 5 states have internal predecessors, (31), 2 states have call successors, (4), 3 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-12 17:55:18,281 INFO L276 IsEmpty]: Start isEmpty. Operand 347 states and 513 transitions. [2024-11-12 17:55:18,282 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2024-11-12 17:55:18,283 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:18,283 INFO L218 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-12 17:55:18,283 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-12 17:55:18,283 INFO L396 AbstractCegarLoop]: === Iteration 11 === 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-12 17:55:18,284 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:18,284 INFO L85 PathProgramCache]: Analyzing trace with hash -848367843, now seen corresponding path program 1 times [2024-11-12 17:55:18,284 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:18,284 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451765915] [2024-11-12 17:55:18,284 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:18,285 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:18,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:19,097 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 17:55:19,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:19,117 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:55:19,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:19,152 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 17:55:19,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:19,290 INFO L134 CoverageAnalysis]: Checked inductivity of 115 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 108 trivial. 0 not checked. [2024-11-12 17:55:19,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:19,290 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451765915] [2024-11-12 17:55:19,290 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451765915] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:19,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:19,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-12 17:55:19,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135796205] [2024-11-12 17:55:19,291 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:19,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-12 17:55:19,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:19,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-12 17:55:19,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:55:19,292 INFO L87 Difference]: Start difference. First operand 347 states and 513 transitions. Second operand has 10 states, 10 states have (on average 3.8) 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-12 17:55:20,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:20,742 INFO L93 Difference]: Finished difference Result 893 states and 1359 transitions. [2024-11-12 17:55:20,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-12 17:55:20,743 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.8) 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-12 17:55:20,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:20,751 INFO L225 Difference]: With dead ends: 893 [2024-11-12 17:55:20,752 INFO L226 Difference]: Without dead ends: 593 [2024-11-12 17:55:20,755 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=88, Invalid=184, Unknown=0, NotChecked=0, Total=272 [2024-11-12 17:55:20,756 INFO L435 NwaCegarLoop]: 166 mSDtfsCounter, 445 mSDsluCounter, 425 mSDsCounter, 0 mSdLazyCounter, 943 mSolverCounterSat, 255 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 456 SdHoareTripleChecker+Valid, 591 SdHoareTripleChecker+Invalid, 1198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 255 IncrementalHoareTripleChecker+Valid, 943 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:20,756 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [456 Valid, 591 Invalid, 1198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [255 Valid, 943 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-12 17:55:20,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 593 states. [2024-11-12 17:55:20,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 593 to 443. [2024-11-12 17:55:20,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 443 states, 320 states have (on average 1.29375) internal successors, (414), 313 states have internal predecessors, (414), 95 states have call successors, (95), 16 states have call predecessors, (95), 24 states have return successors, (128), 113 states have call predecessors, (128), 93 states have call successors, (128) [2024-11-12 17:55:20,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 443 states to 443 states and 637 transitions. [2024-11-12 17:55:20,808 INFO L78 Accepts]: Start accepts. Automaton has 443 states and 637 transitions. Word has length 71 [2024-11-12 17:55:20,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:20,808 INFO L471 AbstractCegarLoop]: Abstraction has 443 states and 637 transitions. [2024-11-12 17:55:20,808 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.8) 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-12 17:55:20,809 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 637 transitions. [2024-11-12 17:55:20,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2024-11-12 17:55:20,810 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:20,810 INFO L218 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-12 17:55:20,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-12 17:55:20,810 INFO L396 AbstractCegarLoop]: === Iteration 12 === 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-12 17:55:20,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:20,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1415800899, now seen corresponding path program 1 times [2024-11-12 17:55:20,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:20,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595455775] [2024-11-12 17:55:20,811 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:20,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:21,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:21,858 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2024-11-12 17:55:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:21,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 54 [2024-11-12 17:55:21,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:21,885 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 63 [2024-11-12 17:55:21,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:21,891 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-12 17:55:21,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:21,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595455775] [2024-11-12 17:55:21,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1595455775] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:21,892 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:21,892 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-12 17:55:21,892 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290344427] [2024-11-12 17:55:21,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:21,893 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-12 17:55:21,893 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:21,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-12 17:55:21,894 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-12 17:55:21,894 INFO L87 Difference]: Start difference. First operand 443 states and 637 transitions. Second operand has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 3 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-12 17:55:26,002 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-12 17:55:27,137 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 17:55:28,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:28,816 INFO L93 Difference]: Finished difference Result 828 states and 1193 transitions. [2024-11-12 17:55:28,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-12 17:55:28,817 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 3 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-12 17:55:28,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:28,822 INFO L225 Difference]: With dead ends: 828 [2024-11-12 17:55:28,822 INFO L226 Difference]: Without dead ends: 434 [2024-11-12 17:55:28,824 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2024-11-12 17:55:28,825 INFO L435 NwaCegarLoop]: 187 mSDtfsCounter, 583 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 722 mSolverCounterSat, 296 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 583 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 1019 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 296 IncrementalHoareTripleChecker+Valid, 722 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 6.6s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:28,825 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [583 Valid, 698 Invalid, 1019 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [296 Valid, 722 Invalid, 1 Unknown, 0 Unchecked, 6.6s Time] [2024-11-12 17:55:28,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 434 states. [2024-11-12 17:55:28,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 434 to 422. [2024-11-12 17:55:28,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 306 states have (on average 1.2843137254901962) internal successors, (393), 300 states have internal predecessors, (393), 88 states have call successors, (88), 16 states have call predecessors, (88), 24 states have return successors, (120), 105 states have call predecessors, (120), 86 states have call successors, (120) [2024-11-12 17:55:28,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 601 transitions. [2024-11-12 17:55:28,864 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 601 transitions. Word has length 74 [2024-11-12 17:55:28,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:28,866 INFO L471 AbstractCegarLoop]: Abstraction has 422 states and 601 transitions. [2024-11-12 17:55:28,866 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 2 states have call successors, (4), 3 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-12 17:55:28,866 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 601 transitions. [2024-11-12 17:55:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 17:55:28,868 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:28,869 INFO L218 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] [2024-11-12 17:55:28,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-12 17:55:28,869 INFO L396 AbstractCegarLoop]: === Iteration 13 === 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-12 17:55:28,869 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:28,870 INFO L85 PathProgramCache]: Analyzing trace with hash -121054956, now seen corresponding path program 1 times [2024-11-12 17:55:28,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:28,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940718245] [2024-11-12 17:55:28,871 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:28,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:28,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:29,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 17:55:29,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:29,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:55:29,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:29,311 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:55:29,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:29,316 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-12 17:55:29,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:29,317 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940718245] [2024-11-12 17:55:29,317 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940718245] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:29,317 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:29,317 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 17:55:29,317 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49655126] [2024-11-12 17:55:29,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:29,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:55:29,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:29,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:55:29,319 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:29,320 INFO L87 Difference]: Start difference. First operand 422 states and 601 transitions. Second operand has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 3 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-12 17:55:32,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:32,061 INFO L93 Difference]: Finished difference Result 831 states and 1187 transitions. [2024-11-12 17:55:32,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:55:32,062 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 3 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 76 [2024-11-12 17:55:32,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:32,065 INFO L225 Difference]: With dead ends: 831 [2024-11-12 17:55:32,066 INFO L226 Difference]: Without dead ends: 465 [2024-11-12 17:55:32,068 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:55:32,070 INFO L435 NwaCegarLoop]: 239 mSDtfsCounter, 343 mSDsluCounter, 786 mSDsCounter, 0 mSdLazyCounter, 551 mSolverCounterSat, 148 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 1025 SdHoareTripleChecker+Invalid, 699 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 148 IncrementalHoareTripleChecker+Valid, 551 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.6s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:32,070 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [343 Valid, 1025 Invalid, 699 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [148 Valid, 551 Invalid, 0 Unknown, 0 Unchecked, 2.6s Time] [2024-11-12 17:55:32,072 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 465 states. [2024-11-12 17:55:32,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 465 to 451. [2024-11-12 17:55:32,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 451 states, 326 states have (on average 1.2852760736196318) internal successors, (419), 320 states have internal predecessors, (419), 95 states have call successors, (95), 17 states have call predecessors, (95), 26 states have return successors, (124), 113 states have call predecessors, (124), 93 states have call successors, (124) [2024-11-12 17:55:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 451 states to 451 states and 638 transitions. [2024-11-12 17:55:32,109 INFO L78 Accepts]: Start accepts. Automaton has 451 states and 638 transitions. Word has length 76 [2024-11-12 17:55:32,110 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:32,110 INFO L471 AbstractCegarLoop]: Abstraction has 451 states and 638 transitions. [2024-11-12 17:55:32,110 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.0) internal successors, (36), 5 states have internal predecessors, (36), 2 states have call successors, (4), 3 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-12 17:55:32,110 INFO L276 IsEmpty]: Start isEmpty. Operand 451 states and 638 transitions. [2024-11-12 17:55:32,112 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2024-11-12 17:55:32,112 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:32,112 INFO L218 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] [2024-11-12 17:55:32,112 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-12 17:55:32,112 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-12 17:55:32,113 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:32,113 INFO L85 PathProgramCache]: Analyzing trace with hash 517112248, now seen corresponding path program 1 times [2024-11-12 17:55:32,113 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:32,113 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [575855173] [2024-11-12 17:55:32,113 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:32,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:32,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:32,471 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 46 [2024-11-12 17:55:32,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:32,486 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 56 [2024-11-12 17:55:32,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:32,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 65 [2024-11-12 17:55:32,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:32,497 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-12 17:55:32,497 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:32,497 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [575855173] [2024-11-12 17:55:32,497 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [575855173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:32,498 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:32,498 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:55:32,498 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1316295778] [2024-11-12 17:55:32,498 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:32,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:32,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:32,499 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:32,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:55:32,499 INFO L87 Difference]: Start difference. First operand 451 states and 638 transitions. Second operand has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 3 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-12 17:55:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:33,573 INFO L93 Difference]: Finished difference Result 818 states and 1159 transitions. [2024-11-12 17:55:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:55:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 3 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 76 [2024-11-12 17:55:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:33,577 INFO L225 Difference]: With dead ends: 818 [2024-11-12 17:55:33,578 INFO L226 Difference]: Without dead ends: 429 [2024-11-12 17:55:33,580 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:55:33,581 INFO L435 NwaCegarLoop]: 228 mSDtfsCounter, 306 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 418 mSolverCounterSat, 129 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 547 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 129 IncrementalHoareTripleChecker+Valid, 418 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:33,581 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 781 Invalid, 547 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [129 Valid, 418 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-12 17:55:33,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 429 states. [2024-11-12 17:55:33,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 429 to 417. [2024-11-12 17:55:33,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 417 states, 302 states have (on average 1.281456953642384) internal successors, (387), 297 states have internal predecessors, (387), 87 states have call successors, (87), 16 states have call predecessors, (87), 24 states have return successors, (114), 103 states have call predecessors, (114), 85 states have call successors, (114) [2024-11-12 17:55:33,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 417 states to 417 states and 588 transitions. [2024-11-12 17:55:33,617 INFO L78 Accepts]: Start accepts. Automaton has 417 states and 588 transitions. Word has length 76 [2024-11-12 17:55:33,617 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:33,617 INFO L471 AbstractCegarLoop]: Abstraction has 417 states and 588 transitions. [2024-11-12 17:55:33,617 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.0) internal successors, (36), 4 states have internal predecessors, (36), 1 states have call successors, (4), 3 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-12 17:55:33,618 INFO L276 IsEmpty]: Start isEmpty. Operand 417 states and 588 transitions. [2024-11-12 17:55:33,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 17:55:33,618 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:33,619 INFO L218 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-12 17:55:33,619 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-12 17:55:33,619 INFO L396 AbstractCegarLoop]: === Iteration 15 === 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-12 17:55:33,620 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:33,621 INFO L85 PathProgramCache]: Analyzing trace with hash -2134707223, now seen corresponding path program 1 times [2024-11-12 17:55:33,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:33,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [550100634] [2024-11-12 17:55:33,621 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:33,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:33,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:34,056 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:55:34,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:34,075 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 17:55:34,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:34,082 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:55:34,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:34,088 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-12 17:55:34,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:34,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [550100634] [2024-11-12 17:55:34,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [550100634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:34,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:34,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-12 17:55:34,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [464254749] [2024-11-12 17:55:34,089 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:34,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-12 17:55:34,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:34,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-12 17:55:34,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-12 17:55:34,090 INFO L87 Difference]: Start difference. First operand 417 states and 588 transitions. Second operand has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 3 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-12 17:55:38,640 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-12 17:55:42,646 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-12 17:55:44,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:44,154 INFO L93 Difference]: Finished difference Result 718 states and 990 transitions. [2024-11-12 17:55:44,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-12 17:55:44,155 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 3 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-12 17:55:44,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:44,158 INFO L225 Difference]: With dead ends: 718 [2024-11-12 17:55:44,159 INFO L226 Difference]: Without dead ends: 389 [2024-11-12 17:55:44,160 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:55:44,161 INFO L435 NwaCegarLoop]: 231 mSDtfsCounter, 266 mSDsluCounter, 770 mSDsCounter, 0 mSdLazyCounter, 523 mSolverCounterSat, 121 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 267 SdHoareTripleChecker+Valid, 1001 SdHoareTripleChecker+Invalid, 646 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 121 IncrementalHoareTripleChecker+Valid, 523 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.9s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:44,161 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [267 Valid, 1001 Invalid, 646 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [121 Valid, 523 Invalid, 2 Unknown, 0 Unchecked, 9.9s Time] [2024-11-12 17:55:44,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 389 states. [2024-11-12 17:55:44,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 389 to 377. [2024-11-12 17:55:44,191 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-12 17:55:44,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 377 states to 377 states and 512 transitions. [2024-11-12 17:55:44,194 INFO L78 Accepts]: Start accepts. Automaton has 377 states and 512 transitions. Word has length 78 [2024-11-12 17:55:44,194 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:44,194 INFO L471 AbstractCegarLoop]: Abstraction has 377 states and 512 transitions. [2024-11-12 17:55:44,194 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 6.333333333333333) internal successors, (38), 5 states have internal predecessors, (38), 2 states have call successors, (4), 3 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-12 17:55:44,194 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 512 transitions. [2024-11-12 17:55:44,195 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 79 [2024-11-12 17:55:44,195 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:44,195 INFO L218 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-12 17:55:44,196 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-12 17:55:44,196 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-12 17:55:44,196 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:44,197 INFO L85 PathProgramCache]: Analyzing trace with hash -1496540019, now seen corresponding path program 1 times [2024-11-12 17:55:44,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:44,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2128646946] [2024-11-12 17:55:44,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:44,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:44,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:44,558 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 48 [2024-11-12 17:55:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:44,574 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 58 [2024-11-12 17:55:44,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:44,579 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 67 [2024-11-12 17:55:44,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:44,584 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-12 17:55:44,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:44,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2128646946] [2024-11-12 17:55:44,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2128646946] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:44,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:44,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:55:44,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230963265] [2024-11-12 17:55:44,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:44,585 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:44,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:44,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:44,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:55:44,586 INFO L87 Difference]: Start difference. First operand 377 states and 512 transitions. Second operand has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 3 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-12 17:55:49,343 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-12 17:55:53,353 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-12 17:55:54,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:54,075 INFO L93 Difference]: Finished difference Result 427 states and 565 transitions. [2024-11-12 17:55:54,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-12 17:55:54,076 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 3 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-12 17:55:54,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:54,078 INFO L225 Difference]: With dead ends: 427 [2024-11-12 17:55:54,079 INFO L226 Difference]: Without dead ends: 343 [2024-11-12 17:55:54,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2024-11-12 17:55:54,080 INFO L435 NwaCegarLoop]: 229 mSDtfsCounter, 207 mSDsluCounter, 553 mSDsCounter, 0 mSdLazyCounter, 411 mSolverCounterSat, 93 mSolverCounterUnsat, 2 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 782 SdHoareTripleChecker+Invalid, 506 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 93 IncrementalHoareTripleChecker+Valid, 411 IncrementalHoareTripleChecker+Invalid, 2 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 9.4s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:54,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [208 Valid, 782 Invalid, 506 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [93 Valid, 411 Invalid, 2 Unknown, 0 Unchecked, 9.4s Time] [2024-11-12 17:55:54,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 343 states. [2024-11-12 17:55:54,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 343 to 335. [2024-11-12 17:55:54,109 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-12 17:55:54,111 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 335 states to 335 states and 454 transitions. [2024-11-12 17:55:54,112 INFO L78 Accepts]: Start accepts. Automaton has 335 states and 454 transitions. Word has length 78 [2024-11-12 17:55:54,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:54,113 INFO L471 AbstractCegarLoop]: Abstraction has 335 states and 454 transitions. [2024-11-12 17:55:54,113 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.333333333333333) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (4), 3 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-12 17:55:54,113 INFO L276 IsEmpty]: Start isEmpty. Operand 335 states and 454 transitions. [2024-11-12 17:55:54,114 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2024-11-12 17:55:54,114 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:54,114 INFO L218 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-12 17:55:54,114 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-12 17:55:54,115 INFO L396 AbstractCegarLoop]: === Iteration 17 === 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-12 17:55:54,115 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:54,115 INFO L85 PathProgramCache]: Analyzing trace with hash -1248403262, now seen corresponding path program 1 times [2024-11-12 17:55:54,115 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:54,115 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724687760] [2024-11-12 17:55:54,115 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:54,116 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:54,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:54,508 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 50 [2024-11-12 17:55:54,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:54,524 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 60 [2024-11-12 17:55:54,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:54,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 69 [2024-11-12 17:55:54,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:54,534 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-12 17:55:54,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:54,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724687760] [2024-11-12 17:55:54,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724687760] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:54,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:54,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-12 17:55:54,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304170008] [2024-11-12 17:55:54,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:54,536 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-12 17:55:54,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:54,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-12 17:55:54,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-12 17:55:54,537 INFO L87 Difference]: Start difference. First operand 335 states and 454 transitions. Second operand has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (4), 3 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-12 17:55:55,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:55:55,596 INFO L93 Difference]: Finished difference Result 351 states and 473 transitions. [2024-11-12 17:55:55,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-12 17:55:55,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (4), 3 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-12 17:55:55,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:55:55,599 INFO L225 Difference]: With dead ends: 351 [2024-11-12 17:55:55,599 INFO L226 Difference]: Without dead ends: 258 [2024-11-12 17:55:55,599 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-12 17:55:55,600 INFO L435 NwaCegarLoop]: 232 mSDtfsCounter, 168 mSDsluCounter, 560 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 792 SdHoareTripleChecker+Invalid, 491 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-12 17:55:55,600 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [168 Valid, 792 Invalid, 491 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-12 17:55:55,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2024-11-12 17:55:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 254. [2024-11-12 17:55:55,620 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-12 17:55:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 345 transitions. [2024-11-12 17:55:55,623 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 345 transitions. Word has length 80 [2024-11-12 17:55:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:55:55,623 INFO L471 AbstractCegarLoop]: Abstraction has 254 states and 345 transitions. [2024-11-12 17:55:55,623 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 6.666666666666667) internal successors, (40), 4 states have internal predecessors, (40), 1 states have call successors, (4), 3 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-12 17:55:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 345 transitions. [2024-11-12 17:55:55,625 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2024-11-12 17:55:55,625 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:55:55,625 INFO L218 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-12 17:55:55,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-12 17:55:55,626 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-12 17:55:55,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:55:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash 1166047273, now seen corresponding path program 1 times [2024-11-12 17:55:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:55:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124963774] [2024-11-12 17:55:55,627 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:55:55,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:55:55,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:56,665 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:55:56,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:56,904 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:55:56,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:56,910 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:55:56,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:56,971 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 17:55:56,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:57,080 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:55:57,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:57,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 96 [2024-11-12 17:55:57,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:57,116 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 106 [2024-11-12 17:55:57,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:57,122 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 115 [2024-11-12 17:55:57,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:55:57,127 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 187 trivial. 0 not checked. [2024-11-12 17:55:57,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:55:57,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124963774] [2024-11-12 17:55:57,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124963774] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-12 17:55:57,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-12 17:55:57,127 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-12 17:55:57,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910781476] [2024-11-12 17:55:57,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-12 17:55:57,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-12 17:55:57,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:55:57,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-12 17:55:57,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-12 17:55:57,130 INFO L87 Difference]: Start difference. First operand 254 states and 345 transitions. Second operand has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 17:55:59,167 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.83s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 17:56:03,247 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-12 17:56:05,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-12 17:56:05,715 INFO L93 Difference]: Finished difference Result 682 states and 987 transitions. [2024-11-12 17:56:05,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-12 17:56:05,716 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 126 [2024-11-12 17:56:05,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-12 17:56:05,720 INFO L225 Difference]: With dead ends: 682 [2024-11-12 17:56:05,721 INFO L226 Difference]: Without dead ends: 470 [2024-11-12 17:56:05,723 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=133, Invalid=419, Unknown=0, NotChecked=0, Total=552 [2024-11-12 17:56:05,724 INFO L435 NwaCegarLoop]: 211 mSDtfsCounter, 840 mSDsluCounter, 746 mSDsCounter, 0 mSdLazyCounter, 1188 mSolverCounterSat, 517 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 875 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 1706 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 517 IncrementalHoareTripleChecker+Valid, 1188 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 7.9s IncrementalHoareTripleChecker+Time [2024-11-12 17:56:05,724 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [875 Valid, 957 Invalid, 1706 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [517 Valid, 1188 Invalid, 1 Unknown, 0 Unchecked, 7.9s Time] [2024-11-12 17:56:05,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 470 states. [2024-11-12 17:56:05,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 470 to 447. [2024-11-12 17:56:05,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 447 states, 317 states have (on average 1.2649842271293374) internal successors, (401), 311 states have internal predecessors, (401), 101 states have call successors, (101), 16 states have call predecessors, (101), 25 states have return successors, (141), 119 states have call predecessors, (141), 100 states have call successors, (141) [2024-11-12 17:56:05,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 447 states to 447 states and 643 transitions. [2024-11-12 17:56:05,781 INFO L78 Accepts]: Start accepts. Automaton has 447 states and 643 transitions. Word has length 126 [2024-11-12 17:56:05,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-12 17:56:05,781 INFO L471 AbstractCegarLoop]: Abstraction has 447 states and 643 transitions. [2024-11-12 17:56:05,781 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.230769230769231) internal successors, (55), 9 states have internal predecessors, (55), 4 states have call successors, (9), 5 states have call predecessors, (9), 3 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2024-11-12 17:56:05,782 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 643 transitions. [2024-11-12 17:56:05,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2024-11-12 17:56:05,783 INFO L210 NwaCegarLoop]: Found error trace [2024-11-12 17:56:05,784 INFO L218 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-12 17:56:05,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-12 17:56:05,784 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-12 17:56:05,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-12 17:56:05,785 INFO L85 PathProgramCache]: Analyzing trace with hash 316397215, now seen corresponding path program 1 times [2024-11-12 17:56:05,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-12 17:56:05,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1805794205] [2024-11-12 17:56:05,785 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:56:05,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-12 17:56:05,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:06,973 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 39 [2024-11-12 17:56:07,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-12 17:56:07,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,375 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-12 17:56:07,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,441 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-12 17:56:07,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 29 [2024-11-12 17:56:07,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 92 [2024-11-12 17:56:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 102 [2024-11-12 17:56:07,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,686 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 111 [2024-11-12 17:56:07,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:07,691 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-12 17:56:07,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-12 17:56:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1805794205] [2024-11-12 17:56:07,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1805794205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-12 17:56:07,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1833671297] [2024-11-12 17:56:07,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-12 17:56:07,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-12 17:56:07,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-12 17:56:07,694 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-12 17:56:07,696 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-12 17:56:08,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-12 17:56:08,244 INFO L256 TraceCheckSpWp]: Trace formula consists of 1277 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-12 17:56:08,250 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-12 17:56:08,406 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-12 17:56:08,636 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-12 17:56:08,684 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-12 17:56:08,684 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-12 17:56:08,926 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-12 17:56:08,932 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-12 17:56:09,120 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-12 17:56:09,125 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-12 17:56:09,255 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-12 17:56:09,261 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-12 17:56:09,454 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-12 17:56:09,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1833671297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-12 17:56:09,454 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-12 17:56:09,454 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 12, 12] total 32 [2024-11-12 17:56:09,455 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539233652] [2024-11-12 17:56:09,455 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-12 17:56:09,455 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-12 17:56:09,455 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-12 17:56:09,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-12 17:56:09,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=102, Invalid=890, Unknown=0, NotChecked=0, Total=992 [2024-11-12 17:56:09,457 INFO L87 Difference]: Start difference. First operand 447 states and 643 transitions. Second operand has 32 states, 28 states have (on average 4.357142857142857) internal successors, (122), 27 states have internal predecessors, (122), 12 states have call successors, (26), 12 states have call predecessors, (26), 9 states have return successors, (21), 9 states have call predecessors, (21), 10 states have call successors, (21) [2024-11-12 17:56:13,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.75s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-12 17:56:17,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers []