./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:41:57,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:41:57,690 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:41:57,733 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:41:57,734 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:41:57,737 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:41:57,739 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:41:57,741 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:41:57,743 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:41:57,747 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:41:57,748 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:41:57,751 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:41:57,751 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:41:57,753 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:41:57,754 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:41:57,760 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:41:57,761 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:41:57,763 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:41:57,765 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:41:57,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:41:57,776 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:41:57,777 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:41:57,778 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:41:57,779 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:41:57,784 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:41:57,786 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:41:57,787 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:41:57,788 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:41:57,789 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:41:57,789 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:41:57,790 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:41:57,791 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:41:57,792 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:41:57,793 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:41:57,794 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:41:57,794 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:41:57,795 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:41:57,795 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:41:57,795 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:41:57,796 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:41:57,797 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:41:57,798 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 23:41:57,832 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:41:57,832 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:41:57,833 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:41:57,833 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:41:57,834 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:41:57,835 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:41:57,835 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:41:57,835 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:41:57,835 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:41:57,836 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:41:57,836 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:41:57,837 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:41:57,837 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:41:57,837 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:41:57,837 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:41:57,837 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:41:57,838 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:41:57,839 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:41:57,839 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:41:57,839 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:41:57,839 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:41:57,840 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:41:57,840 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:41:57,840 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 23:41:57,840 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 23:41:57,840 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:41:57,840 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:41:57,841 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:41:57,841 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:41:57,841 INFO L138 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:41:58,136 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:41:58,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:41:58,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:41:58,160 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:41:58,160 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:41:58,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-08-31 23:41:59,265 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:41:59,532 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:41:59,536 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-08-31 23:41:59,547 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f2da7ee/4876f068033345bc93fea36ea1c17522/FLAG5b9c6acfb [2023-08-31 23:41:59,563 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/28f2da7ee/4876f068033345bc93fea36ea1c17522 [2023-08-31 23:41:59,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:41:59,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:41:59,567 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:41:59,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:41:59,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:41:59,570 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:41:59" (1/1) ... [2023-08-31 23:41:59,571 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@397957dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:41:59, skipping insertion in model container [2023-08-31 23:41:59,571 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:41:59" (1/1) ... [2023-08-31 23:41:59,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:41:59,615 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:41:59,738 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i[990,1003] [2023-08-31 23:41:59,937 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:41:59,949 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:41:59,958 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i[990,1003] [2023-08-31 23:42:00,038 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:42:00,072 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:00,073 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:00,079 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:42:00,079 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00 WrapperNode [2023-08-31 23:42:00,079 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:42:00,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:00,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:42:00,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:42:00,087 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,121 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,165 INFO L138 Inliner]: procedures = 176, calls = 86, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 229 [2023-08-31 23:42:00,166 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:00,167 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:42:00,167 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:42:00,168 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:42:00,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,176 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,191 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,191 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,211 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,225 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,227 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,229 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,240 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:42:00,245 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:42:00,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:42:00,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:42:00,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (1/1) ... [2023-08-31 23:42:00,254 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:42:00,267 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:42:00,279 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:42:00,295 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:42:00,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 23:42:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 23:42:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:42:00,319 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:42:00,320 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:42:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:42:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:42:00,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:42:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:42:00,321 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:42:00,321 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:42:00,322 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:42:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 23:42:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:42:00,322 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:42:00,322 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:42:00,323 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:42:00,516 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:42:00,517 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:42:00,993 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:42:01,782 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:42:01,782 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:42:01,784 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:01 BoogieIcfgContainer [2023-08-31 23:42:01,784 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:42:01,786 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:42:01,786 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:42:01,789 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:42:01,789 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:41:59" (1/3) ... [2023-08-31 23:42:01,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325f6087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:01, skipping insertion in model container [2023-08-31 23:42:01,790 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:00" (2/3) ... [2023-08-31 23:42:01,790 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@325f6087 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:01, skipping insertion in model container [2023-08-31 23:42:01,791 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:01" (3/3) ... [2023-08-31 23:42:01,792 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2023-08-31 23:42:01,807 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:42:01,808 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-08-31 23:42:01,809 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:42:01,944 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:42:01,973 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 199 places, 191 transitions, 397 flow [2023-08-31 23:42:02,045 INFO L130 PetriNetUnfolder]: 2/188 cut-off events. [2023-08-31 23:42:02,045 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:02,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 2/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 340 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-31 23:42:02,052 INFO L82 GeneralOperation]: Start removeDead. Operand has 199 places, 191 transitions, 397 flow [2023-08-31 23:42:02,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 196 places, 188 transitions, 385 flow [2023-08-31 23:42:02,093 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:42:02,107 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 196 places, 188 transitions, 385 flow [2023-08-31 23:42:02,113 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 196 places, 188 transitions, 385 flow [2023-08-31 23:42:02,114 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 196 places, 188 transitions, 385 flow [2023-08-31 23:42:02,212 INFO L130 PetriNetUnfolder]: 2/188 cut-off events. [2023-08-31 23:42:02,212 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:02,219 INFO L83 FinitePrefix]: Finished finitePrefix Result has 198 conditions, 188 events. 2/188 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 340 event pairs, 0 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-31 23:42:02,223 INFO L119 LiptonReduction]: Number of co-enabled transitions 8824 [2023-08-31 23:42:17,364 INFO L134 LiptonReduction]: Checked pairs total: 54846 [2023-08-31 23:42:17,365 INFO L136 LiptonReduction]: Total number of compositions: 149 [2023-08-31 23:42:17,377 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:42:17,383 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@5b922eb4, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:42:17,383 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-08-31 23:42:17,385 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-08-31 23:42:17,386 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:17,386 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:17,386 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:42:17,387 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:42:17,391 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:17,391 INFO L85 PathProgramCache]: Analyzing trace with hash 1415, now seen corresponding path program 1 times [2023-08-31 23:42:17,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:17,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [972110224] [2023-08-31 23:42:17,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:17,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:17,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:17,490 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:17,490 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:17,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [972110224] [2023-08-31 23:42:17,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [972110224] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:17,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:17,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:42:17,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1507435390] [2023-08-31 23:42:17,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:17,514 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:42:17,533 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:17,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:42:17,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:42:17,559 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 340 [2023-08-31 23:42:17,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 191 flow. Second operand has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 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) [2023-08-31 23:42:17,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:17,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 340 [2023-08-31 23:42:17,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:23,785 INFO L130 PetriNetUnfolder]: 31093/43250 cut-off events. [2023-08-31 23:42:23,785 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:42:23,840 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86591 conditions, 43250 events. 31093/43250 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 3249. Compared 294333 event pairs, 31093 based on Foata normal form. 660/18836 useless extension candidates. Maximal degree in co-relation 86580. Up to 43191 conditions per place. [2023-08-31 23:42:24,033 INFO L137 encePairwiseOnDemand]: 299/340 looper letters, 49 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-31 23:42:24,034 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 207 flow [2023-08-31 23:42:24,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:42:24,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:42:24,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 332 transitions. [2023-08-31 23:42:24,050 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48823529411764705 [2023-08-31 23:42:24,051 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 332 transitions. [2023-08-31 23:42:24,052 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 332 transitions. [2023-08-31 23:42:24,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:24,056 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 332 transitions. [2023-08-31 23:42:24,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 166.0) internal successors, (332), 2 states have internal predecessors, (332), 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) [2023-08-31 23:42:24,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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) [2023-08-31 23:42:24,068 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 340.0) internal successors, (1020), 3 states have internal predecessors, (1020), 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) [2023-08-31 23:42:24,069 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 191 flow. Second operand 2 states and 332 transitions. [2023-08-31 23:42:24,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 207 flow [2023-08-31 23:42:24,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:42:24,076 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-31 23:42:24,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-31 23:42:24,083 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2023-08-31 23:42:24,083 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-31 23:42:24,084 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 121.5) internal successors, (243), 2 states have internal predecessors, (243), 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) [2023-08-31 23:42:24,085 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:24,085 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:42:24,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 23:42:24,088 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:42:24,096 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:24,096 INFO L85 PathProgramCache]: Analyzing trace with hash 43413235, now seen corresponding path program 1 times [2023-08-31 23:42:24,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:24,096 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256964190] [2023-08-31 23:42:24,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:24,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:24,328 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:24,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:24,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256964190] [2023-08-31 23:42:24,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256964190] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:24,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:24,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:42:24,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1409016811] [2023-08-31 23:42:24,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:24,330 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:42:24,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:24,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:42:24,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:42:24,365 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 340 [2023-08-31 23:42:24,366 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-08-31 23:42:24,366 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:24,366 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 340 [2023-08-31 23:42:24,366 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:27,910 INFO L130 PetriNetUnfolder]: 18775/27255 cut-off events. [2023-08-31 23:42:27,910 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:27,934 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54311 conditions, 27255 events. 18775/27255 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1627. Compared 183631 event pairs, 12475 based on Foata normal form. 0/14605 useless extension candidates. Maximal degree in co-relation 54308. Up to 17448 conditions per place. [2023-08-31 23:42:28,026 INFO L137 encePairwiseOnDemand]: 322/340 looper letters, 58 selfloop transitions, 9 changer transitions 0/68 dead transitions. [2023-08-31 23:42:28,026 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 68 transitions, 276 flow [2023-08-31 23:42:28,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:42:28,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:42:28,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-31 23:42:28,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41862745098039217 [2023-08-31 23:42:28,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-31 23:42:28,029 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-31 23:42:28,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:28,029 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-31 23:42:28,031 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 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) [2023-08-31 23:42:28,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:28,036 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:28,036 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 427 transitions. [2023-08-31 23:42:28,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 68 transitions, 276 flow [2023-08-31 23:42:28,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 68 transitions, 276 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:42:28,038 INFO L231 Difference]: Finished difference. Result has 59 places, 54 transitions, 176 flow [2023-08-31 23:42:28,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=176, PETRI_PLACES=59, PETRI_TRANSITIONS=54} [2023-08-31 23:42:28,039 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -41 predicate places. [2023-08-31 23:42:28,039 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 54 transitions, 176 flow [2023-08-31 23:42:28,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.33333333333333) internal successors, (355), 3 states have internal predecessors, (355), 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) [2023-08-31 23:42:28,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:28,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:42:28,040 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 23:42:28,041 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:42:28,043 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:28,043 INFO L85 PathProgramCache]: Analyzing trace with hash 43413236, now seen corresponding path program 1 times [2023-08-31 23:42:28,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:28,044 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2046276974] [2023-08-31 23:42:28,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:28,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:28,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:28,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:28,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:28,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2046276974] [2023-08-31 23:42:28,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2046276974] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:28,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:28,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:42:28,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139648698] [2023-08-31 23:42:28,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:28,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:42:28,229 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:28,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:42:28,230 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:42:28,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 340 [2023-08-31 23:42:28,255 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 54 transitions, 176 flow. Second operand has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2023-08-31 23:42:28,256 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:28,256 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 340 [2023-08-31 23:42:28,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:29,577 INFO L130 PetriNetUnfolder]: 6507/9888 cut-off events. [2023-08-31 23:42:29,577 INFO L131 PetriNetUnfolder]: For 2468/2468 co-relation queries the response was YES. [2023-08-31 23:42:29,594 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26120 conditions, 9888 events. 6507/9888 cut-off events. For 2468/2468 co-relation queries the response was YES. Maximal size of possible extension queue 639. Compared 60849 event pairs, 5306 based on Foata normal form. 2068/9870 useless extension candidates. Maximal degree in co-relation 26115. Up to 9684 conditions per place. [2023-08-31 23:42:29,624 INFO L137 encePairwiseOnDemand]: 330/340 looper letters, 43 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-31 23:42:29,625 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 45 transitions, 246 flow [2023-08-31 23:42:29,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:42:29,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:42:29,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 406 transitions. [2023-08-31 23:42:29,628 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3980392156862745 [2023-08-31 23:42:29,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 406 transitions. [2023-08-31 23:42:29,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 406 transitions. [2023-08-31 23:42:29,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:29,629 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 406 transitions. [2023-08-31 23:42:29,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 135.33333333333334) internal successors, (406), 3 states have internal predecessors, (406), 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) [2023-08-31 23:42:29,632 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:29,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:29,633 INFO L175 Difference]: Start difference. First operand has 59 places, 54 transitions, 176 flow. Second operand 3 states and 406 transitions. [2023-08-31 23:42:29,633 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 45 transitions, 246 flow [2023-08-31 23:42:29,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 45 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:42:29,652 INFO L231 Difference]: Finished difference. Result has 50 places, 45 transitions, 142 flow [2023-08-31 23:42:29,653 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=50, PETRI_TRANSITIONS=45} [2023-08-31 23:42:29,654 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -50 predicate places. [2023-08-31 23:42:29,657 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 45 transitions, 142 flow [2023-08-31 23:42:29,658 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 121.33333333333333) internal successors, (364), 3 states have internal predecessors, (364), 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) [2023-08-31 23:42:29,658 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:29,658 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:42:29,658 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 23:42:29,659 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:42:29,659 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:29,659 INFO L85 PathProgramCache]: Analyzing trace with hash -1226950649, now seen corresponding path program 1 times [2023-08-31 23:42:29,659 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:29,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882403606] [2023-08-31 23:42:29,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:29,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:29,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:42:29,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:42:29,819 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 23:42:29,819 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882403606] [2023-08-31 23:42:29,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882403606] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:42:29,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:42:29,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:42:29,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [553366491] [2023-08-31 23:42:29,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:42:29,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:42:29,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 23:42:29,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:42:29,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:42:29,824 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 120 out of 340 [2023-08-31 23:42:29,824 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 45 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2023-08-31 23:42:29,825 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:42:29,826 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 120 of 340 [2023-08-31 23:42:29,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:42:31,049 INFO L130 PetriNetUnfolder]: 5660/8529 cut-off events. [2023-08-31 23:42:31,049 INFO L131 PetriNetUnfolder]: For 1418/1418 co-relation queries the response was YES. [2023-08-31 23:42:31,058 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21492 conditions, 8529 events. 5660/8529 cut-off events. For 1418/1418 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 52521 event pairs, 1224 based on Foata normal form. 0/6297 useless extension candidates. Maximal degree in co-relation 21487. Up to 7596 conditions per place. [2023-08-31 23:42:31,079 INFO L137 encePairwiseOnDemand]: 337/340 looper letters, 71 selfloop transitions, 2 changer transitions 0/74 dead transitions. [2023-08-31 23:42:31,079 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 74 transitions, 382 flow [2023-08-31 23:42:31,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:42:31,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:42:31,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 421 transitions. [2023-08-31 23:42:31,081 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41274509803921566 [2023-08-31 23:42:31,081 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 421 transitions. [2023-08-31 23:42:31,081 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 421 transitions. [2023-08-31 23:42:31,081 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:42:31,082 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 421 transitions. [2023-08-31 23:42:31,083 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 140.33333333333334) internal successors, (421), 3 states have internal predecessors, (421), 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) [2023-08-31 23:42:31,085 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:31,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 340.0) internal successors, (1360), 4 states have internal predecessors, (1360), 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) [2023-08-31 23:42:31,086 INFO L175 Difference]: Start difference. First operand has 50 places, 45 transitions, 142 flow. Second operand 3 states and 421 transitions. [2023-08-31 23:42:31,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 74 transitions, 382 flow [2023-08-31 23:42:31,087 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 74 transitions, 381 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:42:31,088 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 143 flow [2023-08-31 23:42:31,088 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=340, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-08-31 23:42:31,089 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -50 predicate places. [2023-08-31 23:42:31,089 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 143 flow [2023-08-31 23:42:31,089 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 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) [2023-08-31 23:42:31,090 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:42:31,090 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:42:31,090 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 23:42:31,090 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:42:31,090 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:42:31,091 INFO L85 PathProgramCache]: Analyzing trace with hash 619236771, now seen corresponding path program 1 times [2023-08-31 23:42:31,091 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 23:42:31,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1736810400] [2023-08-31 23:42:31,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:42:31,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 23:42:31,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:42:31,109 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:42:31,122 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:42:31,153 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 23:42:31,153 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:42:31,154 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2023-08-31 23:42:31,157 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2023-08-31 23:42:31,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2023-08-31 23:42:31,158 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2023-08-31 23:42:31,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2023-08-31 23:42:31,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2023-08-31 23:42:31,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2023-08-31 23:42:31,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2023-08-31 23:42:31,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2023-08-31 23:42:31,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2023-08-31 23:42:31,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2023-08-31 23:42:31,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2023-08-31 23:42:31,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2023-08-31 23:42:31,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (91 of 105 remaining) [2023-08-31 23:42:31,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (90 of 105 remaining) [2023-08-31 23:42:31,162 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2023-08-31 23:42:31,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2023-08-31 23:42:31,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2023-08-31 23:42:31,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2023-08-31 23:42:31,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2023-08-31 23:42:31,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2023-08-31 23:42:31,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2023-08-31 23:42:31,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2023-08-31 23:42:31,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2023-08-31 23:42:31,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2023-08-31 23:42:31,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2023-08-31 23:42:31,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2023-08-31 23:42:31,167 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2023-08-31 23:42:31,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2023-08-31 23:42:31,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2023-08-31 23:42:31,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2023-08-31 23:42:31,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2023-08-31 23:42:31,168 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2023-08-31 23:42:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2023-08-31 23:42:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2023-08-31 23:42:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2023-08-31 23:42:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2023-08-31 23:42:31,169 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2023-08-31 23:42:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2023-08-31 23:42:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2023-08-31 23:42:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2023-08-31 23:42:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2023-08-31 23:42:31,170 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2023-08-31 23:42:31,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2023-08-31 23:42:31,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2023-08-31 23:42:31,171 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2023-08-31 23:42:31,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2023-08-31 23:42:31,174 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2023-08-31 23:42:31,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2023-08-31 23:42:31,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2023-08-31 23:42:31,175 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2023-08-31 23:42:31,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2023-08-31 23:42:31,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2023-08-31 23:42:31,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2023-08-31 23:42:31,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2023-08-31 23:42:31,176 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2023-08-31 23:42:31,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2023-08-31 23:42:31,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2023-08-31 23:42:31,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2023-08-31 23:42:31,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2023-08-31 23:42:31,177 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2023-08-31 23:42:31,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2023-08-31 23:42:31,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2023-08-31 23:42:31,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 105 remaining) [2023-08-31 23:42:31,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (40 of 105 remaining) [2023-08-31 23:42:31,178 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 105 remaining) [2023-08-31 23:42:31,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 105 remaining) [2023-08-31 23:42:31,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 105 remaining) [2023-08-31 23:42:31,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2023-08-31 23:42:31,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2023-08-31 23:42:31,179 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2023-08-31 23:42:31,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2023-08-31 23:42:31,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2023-08-31 23:42:31,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2023-08-31 23:42:31,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2023-08-31 23:42:31,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2023-08-31 23:42:31,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2023-08-31 23:42:31,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2023-08-31 23:42:31,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2023-08-31 23:42:31,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 105 remaining) [2023-08-31 23:42:31,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 105 remaining) [2023-08-31 23:42:31,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 105 remaining) [2023-08-31 23:42:31,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2023-08-31 23:42:31,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2023-08-31 23:42:31,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2023-08-31 23:42:31,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2023-08-31 23:42:31,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2023-08-31 23:42:31,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2023-08-31 23:42:31,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2023-08-31 23:42:31,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2023-08-31 23:42:31,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2023-08-31 23:42:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2023-08-31 23:42:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2023-08-31 23:42:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2023-08-31 23:42:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2023-08-31 23:42:31,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2023-08-31 23:42:31,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 105 remaining) [2023-08-31 23:42:31,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 105 remaining) [2023-08-31 23:42:31,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 105 remaining) [2023-08-31 23:42:31,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2023-08-31 23:42:31,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2023-08-31 23:42:31,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 105 remaining) [2023-08-31 23:42:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 105 remaining) [2023-08-31 23:42:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 105 remaining) [2023-08-31 23:42:31,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 105 remaining) [2023-08-31 23:42:31,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 23:42:31,188 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-31 23:42:31,196 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:42:31,196 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:42:31,252 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:42:31 BasicIcfg [2023-08-31 23:42:31,252 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:42:31,253 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:42:31,253 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:42:31,253 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:42:31,253 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:01" (3/4) ... [2023-08-31 23:42:31,256 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:42:31,256 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:42:31,256 INFO L158 Benchmark]: Toolchain (without parser) took 31690.49ms. Allocated memory was 71.3MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 43.4MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-31 23:42:31,256 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:31,258 INFO L158 Benchmark]: CACSL2BoogieTranslator took 513.05ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 34.0MB in the end (delta: 9.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. [2023-08-31 23:42:31,258 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.10ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:42:31,259 INFO L158 Benchmark]: Boogie Preprocessor took 73.34ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 28.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:42:31,259 INFO L158 Benchmark]: RCFGBuilder took 1539.23ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 28.1MB in the beginning and 53.4MB in the end (delta: -25.4MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. [2023-08-31 23:42:31,259 INFO L158 Benchmark]: TraceAbstraction took 29466.52ms. Allocated memory was 104.9MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 52.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. [2023-08-31 23:42:31,260 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 7.4GB. Free memory is still 6.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:42:31,263 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 56.6MB. Free memory is still 34.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 513.05ms. Allocated memory is still 71.3MB. Free memory was 43.2MB in the beginning and 34.0MB in the end (delta: 9.2MB). Peak memory consumption was 11.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.10ms. Allocated memory is still 71.3MB. Free memory was 34.0MB in the beginning and 31.1MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 73.34ms. Allocated memory is still 71.3MB. Free memory was 31.1MB in the beginning and 28.4MB in the end (delta: 2.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1539.23ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 28.1MB in the beginning and 53.4MB in the end (delta: -25.4MB). Peak memory consumption was 32.8MB. Max. memory is 16.1GB. * TraceAbstraction took 29466.52ms. Allocated memory was 104.9MB in the beginning and 7.4GB in the end (delta: 7.3GB). Free memory was 52.9MB in the beginning and 6.3GB in the end (delta: -6.2GB). Peak memory consumption was 1.1GB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 7.4GB. Free memory is still 6.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 15.3s, 196 PlacesBefore, 100 PlacesAfterwards, 188 TransitionsBefore, 91 TransitionsAfterwards, 8824 CoEnabledTransitionPairs, 7 FixpointIterations, 72 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 149 TotalNumberOfCompositions, 54846 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 14947, independent: 14110, independent conditional: 0, independent unconditional: 14110, dependent: 837, dependent conditional: 0, dependent unconditional: 837, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3131, independent: 3010, independent conditional: 0, independent unconditional: 3010, dependent: 121, dependent conditional: 0, dependent unconditional: 121, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 14947, independent: 11100, independent conditional: 0, independent unconditional: 11100, dependent: 716, dependent conditional: 0, dependent unconditional: 716, unknown: 3131, unknown conditional: 0, unknown unconditional: 3131] , Statistics on independence cache: Total cache size (in pairs): 562, Positive cache size: 479, Positive conditional cache size: 0, Positive unconditional cache size: 479, Negative cache size: 83, Negative conditional cache size: 0, Negative unconditional cache size: 83, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2369; [L874] FCALL, FORK 0 pthread_create(&t2369, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2369, ((void *)0), P0, ((void *)0))=-1, t2369={6:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L875] 0 pthread_t t2370; [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2370, ((void *)0), P1, ((void *)0))=0, t2369={6:0}, t2370={5:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L803] 2 x$w_buff1 = x$w_buff0 [L804] 2 x$w_buff0 = 2 [L805] 2 x$w_buff1_used = x$w_buff0_used [L806] 2 x$w_buff0_used = (_Bool)1 [L807] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 254 locations, 105 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 29.2s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 12.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 15.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 171 SdHoareTripleChecker+Valid, 0.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 1 SdHoareTripleChecker+Invalid, 0.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 58 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 302 IncrementalHoareTripleChecker+Invalid, 360 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 58 mSolverCounterUnsat, 1 mSDtfsCounter, 302 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 77 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:42:31,303 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/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/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-31 23:42:33,347 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 23:42:33,349 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 23:42:33,391 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 23:42:33,393 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 23:42:33,397 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 23:42:33,398 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 23:42:33,401 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 23:42:33,403 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 23:42:33,407 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 23:42:33,408 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 23:42:33,410 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 23:42:33,410 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 23:42:33,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 23:42:33,413 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 23:42:33,418 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 23:42:33,419 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 23:42:33,420 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 23:42:33,421 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 23:42:33,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 23:42:33,436 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 23:42:33,437 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 23:42:33,438 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 23:42:33,439 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 23:42:33,445 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 23:42:33,446 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 23:42:33,446 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 23:42:33,448 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 23:42:33,448 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 23:42:33,449 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 23:42:33,449 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 23:42:33,455 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 23:42:33,456 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 23:42:33,457 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 23:42:33,457 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 23:42:33,458 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 23:42:33,458 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 23:42:33,458 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 23:42:33,459 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 23:42:33,459 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 23:42:33,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 23:42:33,461 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 23:42:33,494 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 23:42:33,494 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 23:42:33,495 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 23:42:33,495 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 23:42:33,496 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 23:42:33,496 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 23:42:33,497 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 23:42:33,497 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 23:42:33,497 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 23:42:33,497 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 23:42:33,498 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 23:42:33,498 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 23:42:33,499 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 23:42:33,500 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 23:42:33,500 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 23:42:33,500 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 23:42:33,500 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 23:42:33,500 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 23:42:33,501 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 23:42:33,501 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 23:42:33,501 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 23:42:33,501 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 23:42:33,501 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:42:33,502 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 23:42:33,502 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 23:42:33,502 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 23:42:33,502 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 23:42:33,502 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 23:42:33,503 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 23:42:33,503 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 23:42:33,503 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 23:42:33,503 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 23:42:33,503 INFO L138 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.graphml 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 6b4ccd44d6ad5c937026f9c7e728382cb906c06e55c568dcdbddf828dfe89bc6 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-08-31 23:42:33,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 23:42:33,800 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 23:42:33,802 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 23:42:33,803 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 23:42:33,803 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 23:42:33,804 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-08-31 23:42:34,892 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 23:42:35,108 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 23:42:35,109 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i [2023-08-31 23:42:35,122 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9636d1c6/4d6f243a004849f5a81b04080fdaae5b/FLAG4a4826aa0 [2023-08-31 23:42:35,135 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b9636d1c6/4d6f243a004849f5a81b04080fdaae5b [2023-08-31 23:42:35,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 23:42:35,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 23:42:35,139 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 23:42:35,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 23:42:35,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 23:42:35,143 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,143 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@28478315 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35, skipping insertion in model container [2023-08-31 23:42:35,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 23:42:35,188 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 23:42:35,322 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i[990,1003] [2023-08-31 23:42:35,573 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:42:35,585 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 23:42:35,596 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe025_power.i[990,1003] [2023-08-31 23:42:35,671 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 23:42:35,715 WARN L667 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:35,715 WARN L667 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-08-31 23:42:35,721 INFO L208 MainTranslator]: Completed translation [2023-08-31 23:42:35,722 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35 WrapperNode [2023-08-31 23:42:35,722 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 23:42:35,723 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:35,723 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 23:42:35,723 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 23:42:35,730 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,756 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,803 INFO L138 Inliner]: procedures = 180, calls = 86, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 230 [2023-08-31 23:42:35,804 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 23:42:35,806 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 23:42:35,806 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 23:42:35,806 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 23:42:35,814 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,815 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,832 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,832 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,846 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,862 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,872 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,874 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,884 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 23:42:35,888 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 23:42:35,888 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 23:42:35,888 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 23:42:35,889 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (1/1) ... [2023-08-31 23:42:35,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 23:42:35,905 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 23:42:35,916 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-31 23:42:35,924 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 23:42:35,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 23:42:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 23:42:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-31 23:42:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-08-31 23:42:35,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-08-31 23:42:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-08-31 23:42:35,955 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-08-31 23:42:35,955 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-08-31 23:42:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-08-31 23:42:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-08-31 23:42:35,956 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 23:42:35,956 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 23:42:35,957 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-31 23:42:36,145 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 23:42:36,146 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 23:42:36,912 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 23:42:37,810 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 23:42:37,811 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-08-31 23:42:37,813 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:37 BoogieIcfgContainer [2023-08-31 23:42:37,813 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 23:42:37,815 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 23:42:37,815 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 23:42:37,818 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 23:42:37,818 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 11:42:35" (1/3) ... [2023-08-31 23:42:37,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f58aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:37, skipping insertion in model container [2023-08-31 23:42:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 11:42:35" (2/3) ... [2023-08-31 23:42:37,819 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30f58aa3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 11:42:37, skipping insertion in model container [2023-08-31 23:42:37,819 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:37" (3/3) ... [2023-08-31 23:42:37,820 INFO L112 eAbstractionObserver]: Analyzing ICFG safe025_power.i [2023-08-31 23:42:37,835 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 23:42:37,836 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 64 error locations. [2023-08-31 23:42:37,836 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 23:42:37,982 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-31 23:42:38,030 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 200 places, 192 transitions, 399 flow [2023-08-31 23:42:38,126 INFO L130 PetriNetUnfolder]: 2/189 cut-off events. [2023-08-31 23:42:38,126 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:38,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 2/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 340 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-31 23:42:38,133 INFO L82 GeneralOperation]: Start removeDead. Operand has 200 places, 192 transitions, 399 flow [2023-08-31 23:42:38,143 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 197 places, 189 transitions, 387 flow [2023-08-31 23:42:38,146 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 23:42:38,163 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 197 places, 189 transitions, 387 flow [2023-08-31 23:42:38,165 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 197 places, 189 transitions, 387 flow [2023-08-31 23:42:38,166 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 197 places, 189 transitions, 387 flow [2023-08-31 23:42:38,224 INFO L130 PetriNetUnfolder]: 2/189 cut-off events. [2023-08-31 23:42:38,224 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:42:38,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 189 events. 2/189 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 340 event pairs, 0 based on Foata normal form. 0/123 useless extension candidates. Maximal degree in co-relation 130. Up to 2 conditions per place. [2023-08-31 23:42:38,232 INFO L119 LiptonReduction]: Number of co-enabled transitions 8824 [2023-08-31 23:43:06,411 INFO L134 LiptonReduction]: Checked pairs total: 55222 [2023-08-31 23:43:06,412 INFO L136 LiptonReduction]: Total number of compositions: 142 [2023-08-31 23:43:06,424 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 23:43:06,430 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@46158bb, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 23:43:06,430 INFO L358 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2023-08-31 23:43:06,431 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 23:43:06,432 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:43:06,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:43:06,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 23:43:06,433 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:43:06,436 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:43:06,437 INFO L85 PathProgramCache]: Analyzing trace with hash 1411, now seen corresponding path program 1 times [2023-08-31 23:43:06,453 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:43:06,453 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1671241311] [2023-08-31 23:43:06,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:43:06,454 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:06,454 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:43:06,457 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:43:06,460 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-08-31 23:43:06,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:43:06,568 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 23:43:06,571 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:43:06,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:43:06,575 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:43:06,575 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:43:06,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1671241311] [2023-08-31 23:43:06,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1671241311] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:43:06,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:43:06,577 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 23:43:06,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [736234487] [2023-08-31 23:43:06,578 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:43:06,584 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 23:43:06,590 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:43:06,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 23:43:06,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 23:43:06,613 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 334 [2023-08-31 23:43:06,616 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 91 transitions, 191 flow. Second operand has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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) [2023-08-31 23:43:06,616 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:43:06,616 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 334 [2023-08-31 23:43:06,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:43:12,268 INFO L130 PetriNetUnfolder]: 31093/43250 cut-off events. [2023-08-31 23:43:12,269 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 23:43:12,323 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86591 conditions, 43250 events. 31093/43250 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 3253. Compared 294137 event pairs, 31093 based on Foata normal form. 660/18836 useless extension candidates. Maximal degree in co-relation 86580. Up to 43191 conditions per place. [2023-08-31 23:43:12,521 INFO L137 encePairwiseOnDemand]: 293/334 looper letters, 49 selfloop transitions, 0 changer transitions 0/50 dead transitions. [2023-08-31 23:43:12,521 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 50 transitions, 207 flow [2023-08-31 23:43:12,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 23:43:12,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 23:43:12,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 334 transitions. [2023-08-31 23:43:12,537 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5 [2023-08-31 23:43:12,538 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 334 transitions. [2023-08-31 23:43:12,538 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 334 transitions. [2023-08-31 23:43:12,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:43:12,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 334 transitions. [2023-08-31 23:43:12,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 167.0) internal successors, (334), 2 states have internal predecessors, (334), 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) [2023-08-31 23:43:12,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2023-08-31 23:43:12,552 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 334.0) internal successors, (1002), 3 states have internal predecessors, (1002), 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) [2023-08-31 23:43:12,554 INFO L175 Difference]: Start difference. First operand has 100 places, 91 transitions, 191 flow. Second operand 2 states and 334 transitions. [2023-08-31 23:43:12,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 50 transitions, 207 flow [2023-08-31 23:43:12,562 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 50 transitions, 204 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 23:43:12,564 INFO L231 Difference]: Finished difference. Result has 58 places, 50 transitions, 106 flow [2023-08-31 23:43:12,566 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=106, PETRI_PLACES=58, PETRI_TRANSITIONS=50} [2023-08-31 23:43:12,569 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2023-08-31 23:43:12,569 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 50 transitions, 106 flow [2023-08-31 23:43:12,570 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 122.5) internal successors, (245), 2 states have internal predecessors, (245), 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) [2023-08-31 23:43:12,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:43:12,571 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:43:12,583 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-08-31 23:43:12,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:12,784 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:43:12,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:43:12,784 INFO L85 PathProgramCache]: Analyzing trace with hash 43296088, now seen corresponding path program 1 times [2023-08-31 23:43:12,785 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:43:12,785 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1258991043] [2023-08-31 23:43:12,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:43:12,785 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:12,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:43:12,791 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:43:12,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-08-31 23:43:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:43:12,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:43:12,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:43:13,155 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-31 23:43:13,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-31 23:43:13,198 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:43:13,198 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:43:13,199 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:43:13,199 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1258991043] [2023-08-31 23:43:13,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1258991043] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:43:13,201 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:43:13,201 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:43:13,201 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113347363] [2023-08-31 23:43:13,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:43:13,202 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:43:13,203 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:43:13,203 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:43:13,203 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:43:13,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 119 out of 334 [2023-08-31 23:43:13,294 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 50 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-08-31 23:43:13,294 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:43:13,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 119 of 334 [2023-08-31 23:43:13,295 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:43:16,657 INFO L130 PetriNetUnfolder]: 15379/21675 cut-off events. [2023-08-31 23:43:16,657 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 23:43:16,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 43415 conditions, 21675 events. 15379/21675 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1313. Compared 135406 event pairs, 10115 based on Foata normal form. 0/11053 useless extension candidates. Maximal degree in co-relation 43412. Up to 12364 conditions per place. [2023-08-31 23:43:16,752 INFO L137 encePairwiseOnDemand]: 323/334 looper letters, 62 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-08-31 23:43:16,753 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 65 transitions, 264 flow [2023-08-31 23:43:16,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:43:16,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:43:16,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 430 transitions. [2023-08-31 23:43:16,755 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4291417165668663 [2023-08-31 23:43:16,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 430 transitions. [2023-08-31 23:43:16,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 430 transitions. [2023-08-31 23:43:16,756 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:43:16,756 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 430 transitions. [2023-08-31 23:43:16,757 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 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) [2023-08-31 23:43:16,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:16,760 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:16,761 INFO L175 Difference]: Start difference. First operand has 58 places, 50 transitions, 106 flow. Second operand 3 states and 430 transitions. [2023-08-31 23:43:16,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 65 transitions, 264 flow [2023-08-31 23:43:16,761 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 65 transitions, 264 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 23:43:16,762 INFO L231 Difference]: Finished difference. Result has 58 places, 47 transitions, 118 flow [2023-08-31 23:43:16,763 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=58, PETRI_TRANSITIONS=47} [2023-08-31 23:43:16,763 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -42 predicate places. [2023-08-31 23:43:16,763 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 47 transitions, 118 flow [2023-08-31 23:43:16,764 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 120.33333333333333) internal successors, (361), 3 states have internal predecessors, (361), 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) [2023-08-31 23:43:16,764 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:43:16,764 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 23:43:16,775 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-08-31 23:43:16,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:16,973 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:43:16,973 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:43:16,974 INFO L85 PathProgramCache]: Analyzing trace with hash 43296089, now seen corresponding path program 1 times [2023-08-31 23:43:16,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:43:16,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1701269017] [2023-08-31 23:43:16,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:43:16,975 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:16,975 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:43:16,976 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:43:16,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-08-31 23:43:17,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:43:17,074 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 23:43:17,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:43:17,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 23:43:17,098 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 23:43:17,126 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:43:17,127 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:43:17,127 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:43:17,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1701269017] [2023-08-31 23:43:17,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1701269017] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:43:17,127 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:43:17,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:43:17,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [616441728] [2023-08-31 23:43:17,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:43:17,128 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:43:17,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:43:17,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:43:17,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:43:17,171 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 334 [2023-08-31 23:43:17,172 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 47 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-08-31 23:43:17,172 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:43:17,172 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 334 [2023-08-31 23:43:17,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:43:18,225 INFO L130 PetriNetUnfolder]: 5150/7427 cut-off events. [2023-08-31 23:43:18,226 INFO L131 PetriNetUnfolder]: For 447/447 co-relation queries the response was YES. [2023-08-31 23:43:18,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16198 conditions, 7427 events. 5150/7427 cut-off events. For 447/447 co-relation queries the response was YES. Maximal size of possible extension queue 443. Compared 39973 event pairs, 5150 based on Foata normal form. 0/5756 useless extension candidates. Maximal degree in co-relation 16193. Up to 7403 conditions per place. [2023-08-31 23:43:18,265 INFO L137 encePairwiseOnDemand]: 324/334 looper letters, 36 selfloop transitions, 1 changer transitions 0/38 dead transitions. [2023-08-31 23:43:18,265 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 38 transitions, 174 flow [2023-08-31 23:43:18,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:43:18,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:43:18,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-08-31 23:43:18,267 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4111776447105788 [2023-08-31 23:43:18,268 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-08-31 23:43:18,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-08-31 23:43:18,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:43:18,268 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-08-31 23:43:18,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 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) [2023-08-31 23:43:18,271 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:18,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:18,272 INFO L175 Difference]: Start difference. First operand has 58 places, 47 transitions, 118 flow. Second operand 3 states and 412 transitions. [2023-08-31 23:43:18,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 38 transitions, 174 flow [2023-08-31 23:43:18,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 38 transitions, 170 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 23:43:18,278 INFO L231 Difference]: Finished difference. Result has 49 places, 38 transitions, 98 flow [2023-08-31 23:43:18,278 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=49, PETRI_TRANSITIONS=38} [2023-08-31 23:43:18,279 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -51 predicate places. [2023-08-31 23:43:18,279 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 38 transitions, 98 flow [2023-08-31 23:43:18,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 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) [2023-08-31 23:43:18,280 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:43:18,280 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 23:43:18,291 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-08-31 23:43:18,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:18,488 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:43:18,489 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:43:18,489 INFO L85 PathProgramCache]: Analyzing trace with hash -1340242875, now seen corresponding path program 1 times [2023-08-31 23:43:18,489 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:43:18,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [518773219] [2023-08-31 23:43:18,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:43:18,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:18,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:43:18,493 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:43:18,496 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-08-31 23:43:18,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 23:43:18,606 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 23:43:18,608 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 23:43:18,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 23:43:18,622 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 23:43:18,622 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 23:43:18,622 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [518773219] [2023-08-31 23:43:18,623 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [518773219] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 23:43:18,623 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 23:43:18,623 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 23:43:18,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1515396490] [2023-08-31 23:43:18,623 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 23:43:18,624 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 23:43:18,624 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 23:43:18,625 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 23:43:18,625 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 23:43:18,627 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 334 [2023-08-31 23:43:18,627 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 38 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2023-08-31 23:43:18,627 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 23:43:18,627 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 334 [2023-08-31 23:43:18,628 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 23:43:19,743 INFO L130 PetriNetUnfolder]: 4472/6449 cut-off events. [2023-08-31 23:43:19,743 INFO L131 PetriNetUnfolder]: For 427/427 co-relation queries the response was YES. [2023-08-31 23:43:19,750 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14038 conditions, 6449 events. 4472/6449 cut-off events. For 427/427 co-relation queries the response was YES. Maximal size of possible extension queue 394. Compared 35619 event pairs, 904 based on Foata normal form. 0/5201 useless extension candidates. Maximal degree in co-relation 14033. Up to 5745 conditions per place. [2023-08-31 23:43:19,771 INFO L137 encePairwiseOnDemand]: 331/334 looper letters, 58 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-08-31 23:43:19,772 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 61 transitions, 275 flow [2023-08-31 23:43:19,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 23:43:19,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 23:43:19,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 424 transitions. [2023-08-31 23:43:19,774 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4231536926147705 [2023-08-31 23:43:19,774 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 424 transitions. [2023-08-31 23:43:19,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 424 transitions. [2023-08-31 23:43:19,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 23:43:19,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 424 transitions. [2023-08-31 23:43:19,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 141.33333333333334) internal successors, (424), 3 states have internal predecessors, (424), 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) [2023-08-31 23:43:19,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:19,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 334.0) internal successors, (1336), 4 states have internal predecessors, (1336), 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) [2023-08-31 23:43:19,779 INFO L175 Difference]: Start difference. First operand has 49 places, 38 transitions, 98 flow. Second operand 3 states and 424 transitions. [2023-08-31 23:43:19,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 61 transitions, 275 flow [2023-08-31 23:43:19,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 274 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 23:43:19,780 INFO L231 Difference]: Finished difference. Result has 49 places, 37 transitions, 99 flow [2023-08-31 23:43:19,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=334, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=49, PETRI_TRANSITIONS=37} [2023-08-31 23:43:19,781 INFO L281 CegarLoopForPetriNet]: 100 programPoint places, -51 predicate places. [2023-08-31 23:43:19,782 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 37 transitions, 99 flow [2023-08-31 23:43:19,782 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 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) [2023-08-31 23:43:19,782 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 23:43:19,782 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-31 23:43:19,794 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-08-31 23:43:19,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:19,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err1ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 102 more)] === [2023-08-31 23:43:19,992 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 23:43:19,992 INFO L85 PathProgramCache]: Analyzing trace with hash 1402145063, now seen corresponding path program 1 times [2023-08-31 23:43:19,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 23:43:19,992 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2055928655] [2023-08-31 23:43:19,992 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 23:43:19,992 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:19,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 23:43:19,993 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-08-31 23:43:19,994 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-08-31 23:43:20,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:43:20,094 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 23:43:20,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 23:43:20,178 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 23:43:20,178 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 23:43:20,179 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2023-08-31 23:43:20,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (103 of 105 remaining) [2023-08-31 23:43:20,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (102 of 105 remaining) [2023-08-31 23:43:20,180 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (101 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (100 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (99 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (98 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (97 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (96 of 105 remaining) [2023-08-31 23:43:20,181 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (95 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (94 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (93 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (92 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (91 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err1ASSERT_VIOLATIONMEMORY_LEAK (90 of 105 remaining) [2023-08-31 23:43:20,182 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (89 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (88 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 105 remaining) [2023-08-31 23:43:20,183 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 105 remaining) [2023-08-31 23:43:20,184 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 105 remaining) [2023-08-31 23:43:20,185 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 105 remaining) [2023-08-31 23:43:20,186 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 105 remaining) [2023-08-31 23:43:20,187 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 105 remaining) [2023-08-31 23:43:20,188 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 105 remaining) [2023-08-31 23:43:20,189 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (41 of 105 remaining) [2023-08-31 23:43:20,190 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_LEAK (40 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (39 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (38 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (37 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 105 remaining) [2023-08-31 23:43:20,191 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 105 remaining) [2023-08-31 23:43:20,192 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (24 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 105 remaining) [2023-08-31 23:43:20,193 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 105 remaining) [2023-08-31 23:43:20,194 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 105 remaining) [2023-08-31 23:43:20,195 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 105 remaining) [2023-08-31 23:43:20,196 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 105 remaining) [2023-08-31 23:43:20,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 105 remaining) [2023-08-31 23:43:20,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 105 remaining) [2023-08-31 23:43:20,197 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P2Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 105 remaining) [2023-08-31 23:43:20,208 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-31 23:43:20,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-08-31 23:43:20,406 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1] [2023-08-31 23:43:20,412 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 23:43:20,412 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 23:43:20,449 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 11:43:20 BasicIcfg [2023-08-31 23:43:20,449 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 23:43:20,449 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 23:43:20,450 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 23:43:20,450 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 23:43:20,450 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 11:42:37" (3/4) ... [2023-08-31 23:43:20,452 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 23:43:20,452 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 23:43:20,462 INFO L158 Benchmark]: Toolchain (without parser) took 45314.23ms. Allocated memory was 69.2MB in the beginning and 5.9GB in the end (delta: 5.9GB). Free memory was 42.0MB in the beginning and 4.3GB in the end (delta: -4.3GB). Peak memory consumption was 1.6GB. Max. memory is 16.1GB. [2023-08-31 23:43:20,467 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:43:20,468 INFO L158 Benchmark]: CACSL2BoogieTranslator took 582.68ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 60.6MB in the end (delta: -18.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. [2023-08-31 23:43:20,468 INFO L158 Benchmark]: Boogie Procedure Inliner took 81.90ms. Allocated memory is still 92.3MB. Free memory was 60.6MB in the beginning and 57.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-08-31 23:43:20,469 INFO L158 Benchmark]: Boogie Preprocessor took 80.79ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 54.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 23:43:20,469 INFO L158 Benchmark]: RCFGBuilder took 1925.47ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 54.3MB in the beginning and 94.0MB in the end (delta: -39.7MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. [2023-08-31 23:43:20,469 INFO L158 Benchmark]: TraceAbstraction took 42634.02ms. Allocated memory was 134.2MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 94.0MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2023-08-31 23:43:20,470 INFO L158 Benchmark]: Witness Printer took 2.76ms. Allocated memory is still 5.9GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 23:43:20,472 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 69.2MB. Free memory is still 47.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 582.68ms. Allocated memory was 69.2MB in the beginning and 92.3MB in the end (delta: 23.1MB). Free memory was 41.7MB in the beginning and 60.6MB in the end (delta: -18.9MB). Peak memory consumption was 19.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 81.90ms. Allocated memory is still 92.3MB. Free memory was 60.6MB in the beginning and 57.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 80.79ms. Allocated memory is still 92.3MB. Free memory was 57.5MB in the beginning and 54.3MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1925.47ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 54.3MB in the beginning and 94.0MB in the end (delta: -39.7MB). Peak memory consumption was 42.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42634.02ms. Allocated memory was 134.2MB in the beginning and 5.9GB in the end (delta: 5.8GB). Free memory was 94.0MB in the beginning and 4.3GB in the end (delta: -4.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. * Witness Printer took 2.76ms. Allocated memory is still 5.9GB. Free memory was 4.3GB in the beginning and 4.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 28.2s, 197 PlacesBefore, 100 PlacesAfterwards, 189 TransitionsBefore, 91 TransitionsAfterwards, 8824 CoEnabledTransitionPairs, 7 FixpointIterations, 65 TrivialSequentialCompositions, 71 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 5 ConcurrentYvCompositions, 1 ChoiceCompositions, 142 TotalNumberOfCompositions, 55222 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 15048, independent: 14202, independent conditional: 0, independent unconditional: 14202, dependent: 846, dependent conditional: 0, dependent unconditional: 846, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 3098, independent: 2970, independent conditional: 0, independent unconditional: 2970, dependent: 128, dependent conditional: 0, dependent unconditional: 128, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 15048, independent: 11232, independent conditional: 0, independent unconditional: 11232, dependent: 718, dependent conditional: 0, dependent unconditional: 718, unknown: 3098, unknown conditional: 0, unknown unconditional: 3098] , Statistics on independence cache: Total cache size (in pairs): 571, Positive cache size: 496, Positive conditional cache size: 0, Positive unconditional cache size: 496, Negative cache size: 75, Negative conditional cache size: 0, Negative unconditional cache size: 75, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 19. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L715] 0 _Bool __unbuffered_p2_EAX$flush_delayed; [L716] 0 int __unbuffered_p2_EAX$mem_tmp; [L717] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd0; [L718] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd1; [L719] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd2; [L720] 0 _Bool __unbuffered_p2_EAX$r_buff0_thd3; [L721] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd0; [L722] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd1; [L723] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd2; [L724] 0 _Bool __unbuffered_p2_EAX$r_buff1_thd3; [L725] 0 _Bool __unbuffered_p2_EAX$read_delayed; [L726] 0 int *__unbuffered_p2_EAX$read_delayed_var; [L727] 0 int __unbuffered_p2_EAX$w_buff0; [L728] 0 _Bool __unbuffered_p2_EAX$w_buff0_used; [L729] 0 int __unbuffered_p2_EAX$w_buff1; [L730] 0 _Bool __unbuffered_p2_EAX$w_buff1_used; [L732] 0 int __unbuffered_p2_EBX = 0; [L733] 0 _Bool main$tmp_guard0; [L734] 0 _Bool main$tmp_guard1; [L736] 0 int x = 0; [L737] 0 _Bool x$flush_delayed; [L738] 0 int x$mem_tmp; [L739] 0 _Bool x$r_buff0_thd0; [L740] 0 _Bool x$r_buff0_thd1; [L741] 0 _Bool x$r_buff0_thd2; [L742] 0 _Bool x$r_buff0_thd3; [L743] 0 _Bool x$r_buff1_thd0; [L744] 0 _Bool x$r_buff1_thd1; [L745] 0 _Bool x$r_buff1_thd2; [L746] 0 _Bool x$r_buff1_thd3; [L747] 0 _Bool x$read_delayed; [L748] 0 int *x$read_delayed_var; [L749] 0 int x$w_buff0; [L750] 0 _Bool x$w_buff0_used; [L751] 0 int x$w_buff1; [L752] 0 _Bool x$w_buff1_used; [L754] 0 int y = 0; [L755] 0 _Bool weak$$choice0; [L756] 0 _Bool weak$$choice1; [L757] 0 _Bool weak$$choice2; [L873] 0 pthread_t t2369; [L874] FCALL, FORK 0 pthread_create(&t2369, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2369, ((void *)0), P0, ((void *)0))=0, t2369={7:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L875] 0 pthread_t t2370; [L876] FCALL, FORK 0 pthread_create(&t2370, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, pthread_create(&t2370, ((void *)0), P1, ((void *)0))=1, t2369={7:0}, t2370={15:0}, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L791] 2 x$w_buff1 = x$w_buff0 [L792] 2 x$w_buff0 = 1 [L793] 2 x$w_buff1_used = x$w_buff0_used [L794] 2 x$w_buff0_used = (_Bool)1 [L795] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L795] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L796] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L797] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L798] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L799] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L800] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x={3:0}, y=0] [L803] 2 x$w_buff1 = x$w_buff0 [L804] 2 x$w_buff0 = 2 [L805] 2 x$w_buff1_used = x$w_buff0_used [L806] 2 x$w_buff0_used = (_Bool)1 [L807] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND TRUE 2 !expression [L19] 2 reach_error() VAL [\old(expression)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX$flush_delayed=0, __unbuffered_p2_EAX$mem_tmp=0, __unbuffered_p2_EAX$r_buff0_thd0=0, __unbuffered_p2_EAX$r_buff0_thd1=0, __unbuffered_p2_EAX$r_buff0_thd2=0, __unbuffered_p2_EAX$r_buff0_thd3=0, __unbuffered_p2_EAX$r_buff1_thd0=0, __unbuffered_p2_EAX$r_buff1_thd1=0, __unbuffered_p2_EAX$r_buff1_thd2=0, __unbuffered_p2_EAX$r_buff1_thd3=0, __unbuffered_p2_EAX$read_delayed=0, __unbuffered_p2_EAX$read_delayed_var={0:0}, __unbuffered_p2_EAX$w_buff0=0, __unbuffered_p2_EAX$w_buff0_used=0, __unbuffered_p2_EAX$w_buff1=0, __unbuffered_p2_EAX$w_buff1_used=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, expression=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=1, x$w_buff1_used=1, x={3:0}, y=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 19]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - UnprovableResult [Line: 874]: Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Unable to prove that petrification did provide enough thread instances (tool internal message, not intended for end users) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 7 procedures, 255 locations, 105 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.4s, OverallIterations: 5, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 11.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 28.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 170 SdHoareTripleChecker+Valid, 0.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 103 mSDsluCounter, 2 SdHoareTripleChecker+Invalid, 0.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 0 mSDsCounter, 56 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 295 IncrementalHoareTripleChecker+Invalid, 351 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 56 mSolverCounterUnsat, 2 mSDtfsCounter, 295 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=191occurred in iteration=0, InterpolantAutomatonStates: 11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 22 NumberOfCodeBlocks, 22 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 11 ConstructedInterpolants, 0 QuantifiedInterpolants, 84 SizeOfPredicates, 2 NumberOfNonLiveVariables, 279 ConjunctsInSsa, 18 ConjunctsInUnsatCore, 4 InterpolantComputations, 4 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-31 23:43:20,500 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample