./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread/bigshot_s2.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/bigshot_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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 22:07:34,468 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:07:34,470 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:07:34,509 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:07:34,511 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:07:34,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:07:34,516 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:07:34,518 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:07:34,520 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:07:34,524 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:07:34,525 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:07:34,527 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:07:34,528 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:07:34,529 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:07:34,530 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:07:34,536 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:07:34,537 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:07:34,538 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:07:34,540 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:07:34,543 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:07:34,545 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:07:34,545 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:07:34,546 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:07:34,547 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:07:34,553 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:07:34,553 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:07:34,554 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:07:34,555 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:07:34,556 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:07:34,556 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:07:34,556 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:07:34,561 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:07:34,562 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:07:34,563 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:07:34,564 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:07:34,564 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:07:34,565 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:07:34,565 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:07:34,565 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:07:34,565 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:07:34,566 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:07:34,567 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-31 22:07:34,593 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:07:34,593 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:07:34,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:07:34,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:07:34,595 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:07:34,595 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:07:34,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:07:34,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:07:34,595 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:07:34,596 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:07:34,596 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:07:34,596 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:07:34,596 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:07:34,597 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:07:34,598 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:07:34,598 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:07:34,598 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:07:34,598 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:07:34,598 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:34,598 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:07:34,599 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:07:34,599 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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 22:07:34,854 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:07:34,874 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:07:34,876 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:07:34,876 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:07:34,877 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:07:34,878 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-31 22:07:35,946 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:07:36,252 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:07:36,253 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-31 22:07:36,278 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a0f76e0/2e50e056f04a45d9886ed9d19c2e5269/FLAGe349579d1 [2023-08-31 22:07:36,287 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16a0f76e0/2e50e056f04a45d9886ed9d19c2e5269 [2023-08-31 22:07:36,288 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:07:36,289 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:07:36,290 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:36,290 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:07:36,292 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:07:36,294 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,295 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@701a83dd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36, skipping insertion in model container [2023-08-31 22:07:36,295 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,299 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:07:36,343 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:07:36,693 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/bigshot_s2.i[55203,55216] [2023-08-31 22:07:36,705 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:36,713 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:07:36,752 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/bigshot_s2.i[55203,55216] [2023-08-31 22:07:36,759 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:07:36,820 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:07:36,821 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36 WrapperNode [2023-08-31 22:07:36,821 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:07:36,822 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:36,822 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:07:36,822 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:07:36,826 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,849 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,875 INFO L138 Inliner]: procedures = 323, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 75 [2023-08-31 22:07:36,875 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:07:36,876 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:07:36,876 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:07:36,876 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:07:36,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,892 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,892 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,898 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,903 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,906 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,910 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,912 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:07:36,913 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:07:36,914 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:07:36,914 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:07:36,915 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (1/1) ... [2023-08-31 22:07:36,919 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:07:36,927 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:36,937 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 22:07:36,943 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 22:07:36,971 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~int [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 22:07:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 22:07:36,972 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-31 22:07:36,972 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 22:07:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:07:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-31 22:07:36,973 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:07:36,973 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:07:36,974 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 22:07:37,062 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:07:37,063 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:07:37,329 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:07:37,334 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:07:37,337 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-31 22:07:37,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37 BoogieIcfgContainer [2023-08-31 22:07:37,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:07:37,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:07:37,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:07:37,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:07:37,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:07:36" (1/3) ... [2023-08-31 22:07:37,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20831ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:37, skipping insertion in model container [2023-08-31 22:07:37,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:07:36" (2/3) ... [2023-08-31 22:07:37,344 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@20831ffb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:07:37, skipping insertion in model container [2023-08-31 22:07:37,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37" (3/3) ... [2023-08-31 22:07:37,345 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-31 22:07:37,355 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:07:37,355 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-31 22:07:37,355 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:07:37,442 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:07:37,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 109 places, 106 transitions, 228 flow [2023-08-31 22:07:37,508 INFO L130 PetriNetUnfolder]: 4/104 cut-off events. [2023-08-31 22:07:37,508 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:37,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113 conditions, 104 events. 4/104 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/82 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-31 22:07:37,512 INFO L82 GeneralOperation]: Start removeDead. Operand has 109 places, 106 transitions, 228 flow [2023-08-31 22:07:37,517 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 103 places, 100 transitions, 212 flow [2023-08-31 22:07:37,520 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:07:37,528 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-31 22:07:37,531 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 103 places, 100 transitions, 212 flow [2023-08-31 22:07:37,531 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 103 places, 100 transitions, 212 flow [2023-08-31 22:07:37,563 INFO L130 PetriNetUnfolder]: 4/100 cut-off events. [2023-08-31 22:07:37,563 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:37,563 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 100 events. 4/100 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 126 event pairs, 0 based on Foata normal form. 0/79 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-31 22:07:37,565 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-31 22:07:40,706 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-31 22:07:40,707 INFO L136 LiptonReduction]: Total number of compositions: 115 [2023-08-31 22:07:40,715 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:07:40,719 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;@637fe6be, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:07:40,719 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-31 22:07:40,720 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 22:07:40,720 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:40,720 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:40,720 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:07:40,721 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:40,723 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:40,723 INFO L85 PathProgramCache]: Analyzing trace with hash 409, now seen corresponding path program 1 times [2023-08-31 22:07:40,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:40,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446239917] [2023-08-31 22:07:40,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:40,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:40,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:40,790 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 22:07:40,790 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:40,790 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [446239917] [2023-08-31 22:07:40,790 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [446239917] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:40,791 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:40,791 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:07:40,792 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980866743] [2023-08-31 22:07:40,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:40,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:07:40,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:40,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:07:40,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:07:40,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 99 out of 221 [2023-08-31 22:07:40,813 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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 22:07:40,813 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:40,814 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 99 of 221 [2023-08-31 22:07:40,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:40,877 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-31 22:07:40,880 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:07:40,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 209 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-31 22:07:40,882 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 22:07:40,882 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-31 22:07:40,884 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:07:40,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:07:40,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 228 transitions. [2023-08-31 22:07:40,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5158371040723982 [2023-08-31 22:07:40,896 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 228 transitions. [2023-08-31 22:07:40,896 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 228 transitions. [2023-08-31 22:07:40,898 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:40,899 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 228 transitions. [2023-08-31 22:07:40,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 114.0) internal successors, (228), 2 states have internal predecessors, (228), 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 22:07:40,909 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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 22:07:40,910 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 221.0) internal successors, (663), 3 states have internal predecessors, (663), 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 22:07:40,912 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 228 transitions. [2023-08-31 22:07:40,912 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-31 22:07:40,915 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:40,916 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-31 22:07:40,918 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-31 22:07:40,921 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:07:40,921 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-31 22:07:40,922 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 99.5) internal successors, (199), 2 states have internal predecessors, (199), 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 22:07:40,922 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:40,922 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:40,922 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-31 22:07:40,923 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:40,930 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:40,930 INFO L85 PathProgramCache]: Analyzing trace with hash 402564, now seen corresponding path program 1 times [2023-08-31 22:07:40,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:40,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455656604] [2023-08-31 22:07:40,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:40,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:40,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:41,087 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 22:07:41,087 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:41,087 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455656604] [2023-08-31 22:07:41,087 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455656604] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:41,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:41,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:41,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141423779] [2023-08-31 22:07:41,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:41,089 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:41,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:41,089 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:41,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:41,128 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-31 22:07:41,128 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 22:07:41,128 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:41,128 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-31 22:07:41,129 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:41,168 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-31 22:07:41,168 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:41,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 200 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-31 22:07:41,169 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-31 22:07:41,169 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-31 22:07:41,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:41,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:41,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-08-31 22:07:41,171 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4464555052790347 [2023-08-31 22:07:41,171 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-08-31 22:07:41,171 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-08-31 22:07:41,172 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:41,172 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-08-31 22:07:41,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 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 22:07:41,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,174 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,174 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 296 transitions. [2023-08-31 22:07:41,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-31 22:07:41,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 22:07:41,175 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-31 22:07:41,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-31 22:07:41,176 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:41,176 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-31 22:07:41,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 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 22:07:41,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:41,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:07:41,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-31 22:07:41,177 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:41,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:41,177 INFO L85 PathProgramCache]: Analyzing trace with hash 402565, now seen corresponding path program 1 times [2023-08-31 22:07:41,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:41,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411288670] [2023-08-31 22:07:41,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:41,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:41,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:41,254 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 22:07:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411288670] [2023-08-31 22:07:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411288670] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:41,255 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:41,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:41,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018514510] [2023-08-31 22:07:41,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:41,256 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:41,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:41,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:41,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:41,290 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-31 22:07:41,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 22:07:41,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:41,291 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-31 22:07:41,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:41,327 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-31 22:07:41,329 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:41,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 195 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-31 22:07:41,330 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-31 22:07:41,330 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-31 22:07:41,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:41,331 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:41,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-31 22:07:41,333 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-31 22:07:41,335 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-31 22:07:41,335 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-31 22:07:41,335 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:41,335 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-31 22:07:41,336 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 22:07:41,338 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,340 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,340 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 306 transitions. [2023-08-31 22:07:41,340 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-31 22:07:41,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:41,341 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-31 22:07:41,341 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-31 22:07:41,342 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-31 22:07:41,342 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-31 22:07:41,343 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 94.0) internal successors, (282), 3 states have internal predecessors, (282), 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 22:07:41,343 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:41,344 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 22:07:41,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-31 22:07:41,344 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:41,344 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:41,344 INFO L85 PathProgramCache]: Analyzing trace with hash 12480382, now seen corresponding path program 1 times [2023-08-31 22:07:41,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:41,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355763764] [2023-08-31 22:07:41,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:41,345 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:41,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:41,474 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 22:07:41,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:41,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355763764] [2023-08-31 22:07:41,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355763764] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:41,475 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:41,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:41,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187301195] [2023-08-31 22:07:41,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:41,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:41,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:41,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:41,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:41,547 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 221 [2023-08-31 22:07:41,547 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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 22:07:41,547 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:41,547 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 221 [2023-08-31 22:07:41,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:41,576 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-31 22:07:41,576 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:07:41,576 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 17. Compared 193 event pairs, 16 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 61 conditions per place. [2023-08-31 22:07:41,577 INFO L137 encePairwiseOnDemand]: 218/221 looper letters, 22 selfloop transitions, 2 changer transitions 0/25 dead transitions. [2023-08-31 22:07:41,577 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 108 flow [2023-08-31 22:07:41,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:41,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:41,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 304 transitions. [2023-08-31 22:07:41,579 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45852187028657615 [2023-08-31 22:07:41,580 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 304 transitions. [2023-08-31 22:07:41,580 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 304 transitions. [2023-08-31 22:07:41,580 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:41,580 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 304 transitions. [2023-08-31 22:07:41,582 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 101.33333333333333) internal successors, (304), 3 states have internal predecessors, (304), 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 22:07:41,583 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,584 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,584 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 3 states and 304 transitions. [2023-08-31 22:07:41,584 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 108 flow [2023-08-31 22:07:41,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 102 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:41,586 INFO L231 Difference]: Finished difference. Result has 29 places, 25 transitions, 58 flow [2023-08-31 22:07:41,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=25} [2023-08-31 22:07:41,587 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:07:41,587 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 25 transitions, 58 flow [2023-08-31 22:07:41,588 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 94.0) internal successors, (376), 4 states have internal predecessors, (376), 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 22:07:41,588 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:41,588 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:41,588 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-31 22:07:41,588 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:41,589 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:41,589 INFO L85 PathProgramCache]: Analyzing trace with hash -891795905, now seen corresponding path program 1 times [2023-08-31 22:07:41,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:41,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096769538] [2023-08-31 22:07:41,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:41,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:41,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:41,673 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 22:07:41,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:41,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096769538] [2023-08-31 22:07:41,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096769538] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:41,674 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:41,674 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:07:41,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [660663920] [2023-08-31 22:07:41,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:41,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:41,675 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:41,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:41,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:41,716 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-31 22:07:41,717 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 25 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 22:07:41,717 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:41,717 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-31 22:07:41,717 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:41,749 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-31 22:07:41,749 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:41,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107 conditions, 51 events. 17/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 128 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 103. Up to 47 conditions per place. [2023-08-31 22:07:41,750 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-31 22:07:41,750 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 29 places, 23 transitions, 98 flow [2023-08-31 22:07:41,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:41,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:41,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-08-31 22:07:41,751 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4434389140271493 [2023-08-31 22:07:41,751 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-08-31 22:07:41,751 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-08-31 22:07:41,752 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:41,752 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-08-31 22:07:41,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 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 22:07:41,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,754 INFO L175 Difference]: Start difference. First operand has 29 places, 25 transitions, 58 flow. Second operand 3 states and 294 transitions. [2023-08-31 22:07:41,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 29 places, 23 transitions, 98 flow [2023-08-31 22:07:41,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:41,755 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-31 22:07:41,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-31 22:07:41,755 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:07:41,756 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-31 22:07:41,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 22:07:41,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:41,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:07:41,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-31 22:07:41,756 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:41,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:41,757 INFO L85 PathProgramCache]: Analyzing trace with hash -891795903, now seen corresponding path program 1 times [2023-08-31 22:07:41,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:41,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1707789617] [2023-08-31 22:07:41,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:41,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:41,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:41,837 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 22:07:41,837 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:41,837 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1707789617] [2023-08-31 22:07:41,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1707789617] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:41,837 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:41,838 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:07:41,838 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779082747] [2023-08-31 22:07:41,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:41,838 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:41,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:41,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:41,839 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:41,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-31 22:07:41,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 22:07:41,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:41,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-31 22:07:41,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:41,917 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-31 22:07:41,917 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:41,917 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 71 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-31 22:07:41,918 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-31 22:07:41,918 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-31 22:07:41,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:41,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:41,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 283 transitions. [2023-08-31 22:07:41,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.42684766214177977 [2023-08-31 22:07:41,920 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 283 transitions. [2023-08-31 22:07:41,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 283 transitions. [2023-08-31 22:07:41,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:41,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 283 transitions. [2023-08-31 22:07:41,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 94.33333333333333) internal successors, (283), 3 states have internal predecessors, (283), 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 22:07:41,922 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,922 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:41,922 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 283 transitions. [2023-08-31 22:07:41,922 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-31 22:07:41,923 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:41,923 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-31 22:07:41,923 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:07:41,924 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:07:41,924 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-31 22:07:41,924 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 88.5) internal successors, (354), 4 states have internal predecessors, (354), 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 22:07:41,924 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:41,924 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:41,924 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-31 22:07:41,925 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:41,925 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:41,925 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181263, now seen corresponding path program 1 times [2023-08-31 22:07:41,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:41,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609951737] [2023-08-31 22:07:41,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:41,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:41,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:42,109 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 22:07:42,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:42,113 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609951737] [2023-08-31 22:07:42,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609951737] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:42,114 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:42,114 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:42,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [27464527] [2023-08-31 22:07:42,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:42,114 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 22:07:42,114 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:42,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 22:07:42,115 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-08-31 22:07:42,250 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 221 [2023-08-31 22:07:42,251 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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 22:07:42,251 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:42,251 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 221 [2023-08-31 22:07:42,251 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:42,307 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-31 22:07:42,308 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:07:42,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 79 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-31 22:07:42,308 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-31 22:07:42,308 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-31 22:07:42,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:42,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:42,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 339 transitions. [2023-08-31 22:07:42,310 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3834841628959276 [2023-08-31 22:07:42,310 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 339 transitions. [2023-08-31 22:07:42,310 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 339 transitions. [2023-08-31 22:07:42,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:42,310 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 339 transitions. [2023-08-31 22:07:42,311 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 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 22:07:42,313 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:42,313 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:42,313 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 339 transitions. [2023-08-31 22:07:42,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-31 22:07:42,314 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:07:42,314 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-31 22:07:42,315 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:07:42,315 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:07:42,315 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-31 22:07:42,315 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 79.28571428571429) internal successors, (555), 7 states have internal predecessors, (555), 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 22:07:42,316 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:42,316 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:42,316 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-31 22:07:42,316 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:42,316 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:42,316 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181298, now seen corresponding path program 1 times [2023-08-31 22:07:42,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:42,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720760194] [2023-08-31 22:07:42,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:42,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:42,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:42,563 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 22:07:42,564 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:42,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720760194] [2023-08-31 22:07:42,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [720760194] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:42,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:42,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:07:42,564 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777865560] [2023-08-31 22:07:42,564 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:42,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-08-31 22:07:42,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:42,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-08-31 22:07:42,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-08-31 22:07:42,767 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 221 [2023-08-31 22:07:42,768 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 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 22:07:42,768 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:42,768 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 221 [2023-08-31 22:07:42,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:42,918 INFO L130 PetriNetUnfolder]: 14/57 cut-off events. [2023-08-31 22:07:42,918 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:07:42,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 126 conditions, 57 events. 14/57 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 173 event pairs, 7 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 122. Up to 38 conditions per place. [2023-08-31 22:07:42,918 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 25 selfloop transitions, 6 changer transitions 0/31 dead transitions. [2023-08-31 22:07:42,919 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 31 transitions, 139 flow [2023-08-31 22:07:42,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:42,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:42,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 529 transitions. [2023-08-31 22:07:42,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39894419306184015 [2023-08-31 22:07:42,920 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 529 transitions. [2023-08-31 22:07:42,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 529 transitions. [2023-08-31 22:07:42,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:42,921 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 529 transitions. [2023-08-31 22:07:42,921 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 88.16666666666667) internal successors, (529), 6 states have internal predecessors, (529), 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 22:07:42,923 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:42,923 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:42,923 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 6 states and 529 transitions. [2023-08-31 22:07:42,923 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 31 transitions, 139 flow [2023-08-31 22:07:42,924 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:42,924 INFO L231 Difference]: Finished difference. Result has 30 places, 23 transitions, 75 flow [2023-08-31 22:07:42,924 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=51, PETRI_DIFFERENCE_MINUEND_PLACES=24, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=75, PETRI_PLACES=30, PETRI_TRANSITIONS=23} [2023-08-31 22:07:42,925 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:42,925 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 23 transitions, 75 flow [2023-08-31 22:07:42,925 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 84.28571428571429) internal successors, (590), 7 states have internal predecessors, (590), 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 22:07:42,925 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:42,925 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:42,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-31 22:07:42,926 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:42,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:42,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181353, now seen corresponding path program 1 times [2023-08-31 22:07:42,926 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:42,926 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259371914] [2023-08-31 22:07:42,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:42,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:42,935 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:42,959 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 22:07:42,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:42,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259371914] [2023-08-31 22:07:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259371914] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:42,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420527833] [2023-08-31 22:07:42,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:42,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:42,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:42,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:43,033 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-31 22:07:43,034 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 23 transitions, 75 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 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 22:07:43,034 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,034 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-31 22:07:43,034 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,067 INFO L130 PetriNetUnfolder]: 12/48 cut-off events. [2023-08-31 22:07:43,068 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-08-31 22:07:43,068 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121 conditions, 48 events. 12/48 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 126 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 116. Up to 29 conditions per place. [2023-08-31 22:07:43,068 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-31 22:07:43,068 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 26 transitions, 134 flow [2023-08-31 22:07:43,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:43,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:43,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-31 22:07:43,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-31 22:07:43,070 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,070 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,070 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,070 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,071 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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 22:07:43,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:43,072 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:43,073 INFO L175 Difference]: Start difference. First operand has 30 places, 23 transitions, 75 flow. Second operand 4 states and 387 transitions. [2023-08-31 22:07:43,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 26 transitions, 134 flow [2023-08-31 22:07:43,073 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 133 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:43,074 INFO L231 Difference]: Finished difference. Result has 30 places, 21 transitions, 80 flow [2023-08-31 22:07:43,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=80, PETRI_PLACES=30, PETRI_TRANSITIONS=21} [2023-08-31 22:07:43,074 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:43,074 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 21 transitions, 80 flow [2023-08-31 22:07:43,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 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 22:07:43,075 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,075 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:43,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-31 22:07:43,075 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,076 INFO L85 PathProgramCache]: Analyzing trace with hash 1176181352, now seen corresponding path program 1 times [2023-08-31 22:07:43,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268473072] [2023-08-31 22:07:43,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,130 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 22:07:43,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268473072] [2023-08-31 22:07:43,131 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [268473072] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:43,131 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:43,131 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:43,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1078788126] [2023-08-31 22:07:43,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,131 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:07:43,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:07:43,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:07:43,208 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 90 out of 221 [2023-08-31 22:07:43,209 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 21 transitions, 80 flow. Second operand has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 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 22:07:43,209 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:43,209 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 90 of 221 [2023-08-31 22:07:43,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:43,247 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-31 22:07:43,247 INFO L131 PetriNetUnfolder]: For 27/27 co-relation queries the response was YES. [2023-08-31 22:07:43,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 42 events. 11/42 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 111. Up to 30 conditions per place. [2023-08-31 22:07:43,248 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 3 changer transitions 0/25 dead transitions. [2023-08-31 22:07:43,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 139 flow [2023-08-31 22:07:43,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:07:43,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:07:43,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 387 transitions. [2023-08-31 22:07:43,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43778280542986425 [2023-08-31 22:07:43,250 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,250 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:43,250 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 387 transitions. [2023-08-31 22:07:43,251 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 96.75) internal successors, (387), 4 states have internal predecessors, (387), 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 22:07:43,252 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:43,252 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 221.0) internal successors, (1105), 5 states have internal predecessors, (1105), 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 22:07:43,252 INFO L175 Difference]: Start difference. First operand has 30 places, 21 transitions, 80 flow. Second operand 4 states and 387 transitions. [2023-08-31 22:07:43,252 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 139 flow [2023-08-31 22:07:43,253 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 129 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:43,253 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 78 flow [2023-08-31 22:07:43,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=68, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=78, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-31 22:07:43,254 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:07:43,254 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 78 flow [2023-08-31 22:07:43,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 92.25) internal successors, (369), 4 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 22:07:43,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:43,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:43,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-31 22:07:43,255 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:43,255 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:43,255 INFO L85 PathProgramCache]: Analyzing trace with hash 2101885032, now seen corresponding path program 1 times [2023-08-31 22:07:43,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:43,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1056494665] [2023-08-31 22:07:43,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:43,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,453 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:43,454 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:43,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1056494665] [2023-08-31 22:07:43,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1056494665] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:43,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [838191347] [2023-08-31 22:07:43,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:43,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:43,470 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:43,489 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-31 22:07:43,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:43,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 171 conjuncts, 28 conjunts are in the unsatisfiable core [2023-08-31 22:07:43,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:43,651 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:43,652 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:43,659 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:43,707 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:43,707 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:43,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:43,805 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 22:07:43,868 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:43,868 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:43,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:43,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [838191347] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:43,965 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:43,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 14 [2023-08-31 22:07:43,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969914079] [2023-08-31 22:07:43,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:43,966 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:07:43,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:43,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:07:43,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=179, Unknown=0, NotChecked=0, Total=240 [2023-08-31 22:07:44,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 221 [2023-08-31 22:07:44,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 78 flow. Second operand has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 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 22:07:44,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:44,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 221 [2023-08-31 22:07:44,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:45,222 INFO L130 PetriNetUnfolder]: 24/85 cut-off events. [2023-08-31 22:07:45,222 INFO L131 PetriNetUnfolder]: For 34/34 co-relation queries the response was YES. [2023-08-31 22:07:45,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 226 conditions, 85 events. 24/85 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 278 event pairs, 4 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 220. Up to 23 conditions per place. [2023-08-31 22:07:45,223 INFO L137 encePairwiseOnDemand]: 214/221 looper letters, 36 selfloop transitions, 15 changer transitions 0/51 dead transitions. [2023-08-31 22:07:45,223 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 43 places, 51 transitions, 272 flow [2023-08-31 22:07:45,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-08-31 22:07:45,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-08-31 22:07:45,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1189 transitions. [2023-08-31 22:07:45,225 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3842921784098255 [2023-08-31 22:07:45,225 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 1189 transitions. [2023-08-31 22:07:45,225 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 1189 transitions. [2023-08-31 22:07:45,226 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:45,226 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 1189 transitions. [2023-08-31 22:07:45,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 84.92857142857143) internal successors, (1189), 14 states have internal predecessors, (1189), 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 22:07:45,232 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 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 22:07:45,233 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 221.0) internal successors, (3315), 15 states have internal predecessors, (3315), 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 22:07:45,233 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 78 flow. Second operand 14 states and 1189 transitions. [2023-08-31 22:07:45,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 43 places, 51 transitions, 272 flow [2023-08-31 22:07:45,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 51 transitions, 266 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:45,235 INFO L231 Difference]: Finished difference. Result has 45 places, 29 transitions, 173 flow [2023-08-31 22:07:45,235 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=173, PETRI_PLACES=45, PETRI_TRANSITIONS=29} [2023-08-31 22:07:45,235 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-31 22:07:45,236 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 29 transitions, 173 flow [2023-08-31 22:07:45,236 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 82.875) internal successors, (1326), 16 states have internal predecessors, (1326), 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 22:07:45,236 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:45,236 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:45,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-08-31 22:07:45,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-08-31 22:07:45,440 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:45,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:45,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1172842328, now seen corresponding path program 1 times [2023-08-31 22:07:45,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:45,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113134067] [2023-08-31 22:07:45,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:45,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:45,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:45,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:45,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:45,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113134067] [2023-08-31 22:07:45,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113134067] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:45,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [167767264] [2023-08-31 22:07:45,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:45,524 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:45,524 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:45,525 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:45,527 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-31 22:07:45,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:45,590 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-31 22:07:45,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:45,597 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:07:45,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:45,636 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:45,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:45,688 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [167767264] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:45,688 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:45,688 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2023-08-31 22:07:45,689 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401667814] [2023-08-31 22:07:45,689 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:45,689 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-08-31 22:07:45,689 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:45,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-08-31 22:07:45,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2023-08-31 22:07:45,979 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 221 [2023-08-31 22:07:45,979 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 29 transitions, 173 flow. Second operand has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 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 22:07:45,979 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:45,979 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 221 [2023-08-31 22:07:45,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:46,105 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-31 22:07:46,105 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-31 22:07:46,106 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 76 events. 21/76 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 201 event pairs, 5 based on Foata normal form. 6/82 useless extension candidates. Maximal degree in co-relation 254. Up to 29 conditions per place. [2023-08-31 22:07:46,106 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 38 selfloop transitions, 8 changer transitions 0/46 dead transitions. [2023-08-31 22:07:46,106 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 46 transitions, 311 flow [2023-08-31 22:07:46,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:07:46,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:07:46,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 654 transitions. [2023-08-31 22:07:46,108 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4227537168713639 [2023-08-31 22:07:46,108 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 654 transitions. [2023-08-31 22:07:46,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 654 transitions. [2023-08-31 22:07:46,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:46,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 654 transitions. [2023-08-31 22:07:46,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 93.42857142857143) internal successors, (654), 7 states have internal predecessors, (654), 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 22:07:46,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 22:07:46,111 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 22:07:46,111 INFO L175 Difference]: Start difference. First operand has 45 places, 29 transitions, 173 flow. Second operand 7 states and 654 transitions. [2023-08-31 22:07:46,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 46 transitions, 311 flow [2023-08-31 22:07:46,112 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 46 transitions, 283 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:46,113 INFO L231 Difference]: Finished difference. Result has 51 places, 30 transitions, 186 flow [2023-08-31 22:07:46,113 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=186, PETRI_PLACES=51, PETRI_TRANSITIONS=30} [2023-08-31 22:07:46,113 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 15 predicate places. [2023-08-31 22:07:46,113 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 30 transitions, 186 flow [2023-08-31 22:07:46,114 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 89.36363636363636) internal successors, (983), 11 states have internal predecessors, (983), 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 22:07:46,114 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:46,114 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:46,130 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-31 22:07:46,319 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-08-31 22:07:46,319 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:46,319 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:46,319 INFO L85 PathProgramCache]: Analyzing trace with hash 733306717, now seen corresponding path program 1 times [2023-08-31 22:07:46,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:46,320 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412969564] [2023-08-31 22:07:46,320 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:46,320 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:46,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:46,338 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 22:07:46,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:46,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412969564] [2023-08-31 22:07:46,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412969564] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:46,338 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:46,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:07:46,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1940173517] [2023-08-31 22:07:46,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:46,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:07:46,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:46,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:07:46,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:07:46,355 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 96 out of 221 [2023-08-31 22:07:46,356 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 30 transitions, 186 flow. Second operand has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 22:07:46,356 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:46,356 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 96 of 221 [2023-08-31 22:07:46,356 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:46,382 INFO L130 PetriNetUnfolder]: 20/70 cut-off events. [2023-08-31 22:07:46,382 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-31 22:07:46,383 INFO L83 FinitePrefix]: Finished finitePrefix Result has 279 conditions, 70 events. 20/70 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 13 based on Foata normal form. 2/72 useless extension candidates. Maximal degree in co-relation 264. Up to 67 conditions per place. [2023-08-31 22:07:46,383 INFO L137 encePairwiseOnDemand]: 219/221 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-31 22:07:46,383 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 29 transitions, 237 flow [2023-08-31 22:07:46,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:07:46,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:07:46,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 306 transitions. [2023-08-31 22:07:46,384 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46153846153846156 [2023-08-31 22:07:46,384 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 306 transitions. [2023-08-31 22:07:46,384 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 306 transitions. [2023-08-31 22:07:46,385 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:46,385 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 306 transitions. [2023-08-31 22:07:46,385 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 102.0) internal successors, (306), 3 states have internal predecessors, (306), 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 22:07:46,386 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:46,386 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 221.0) internal successors, (884), 4 states have internal predecessors, (884), 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 22:07:46,386 INFO L175 Difference]: Start difference. First operand has 51 places, 30 transitions, 186 flow. Second operand 3 states and 306 transitions. [2023-08-31 22:07:46,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 29 transitions, 237 flow [2023-08-31 22:07:46,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 29 transitions, 224 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-08-31 22:07:46,388 INFO L231 Difference]: Finished difference. Result has 46 places, 28 transitions, 166 flow [2023-08-31 22:07:46,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=166, PETRI_PLACES=46, PETRI_TRANSITIONS=28} [2023-08-31 22:07:46,389 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 10 predicate places. [2023-08-31 22:07:46,389 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 28 transitions, 166 flow [2023-08-31 22:07:46,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 22:07:46,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:46,389 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:46,390 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-31 22:07:46,390 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:46,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:46,390 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283604, now seen corresponding path program 1 times [2023-08-31 22:07:46,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:46,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953017111] [2023-08-31 22:07:46,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:46,391 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:46,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:46,487 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 22:07:46,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:46,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953017111] [2023-08-31 22:07:46,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953017111] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:46,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:46,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:07:46,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936638277] [2023-08-31 22:07:46,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:46,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:07:46,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:46,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:07:46,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:07:46,570 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-31 22:07:46,570 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 28 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 22:07:46,570 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:46,570 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-31 22:07:46,571 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:46,621 INFO L130 PetriNetUnfolder]: 20/69 cut-off events. [2023-08-31 22:07:46,621 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-31 22:07:46,621 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 69 events. 20/69 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 179 event pairs, 12 based on Foata normal form. 1/70 useless extension candidates. Maximal degree in co-relation 247. Up to 61 conditions per place. [2023-08-31 22:07:46,622 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 28 selfloop transitions, 4 changer transitions 0/32 dead transitions. [2023-08-31 22:07:46,622 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 32 transitions, 239 flow [2023-08-31 22:07:46,622 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:07:46,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:07:46,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 478 transitions. [2023-08-31 22:07:46,623 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.432579185520362 [2023-08-31 22:07:46,623 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 478 transitions. [2023-08-31 22:07:46,623 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 478 transitions. [2023-08-31 22:07:46,624 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:46,624 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 478 transitions. [2023-08-31 22:07:46,624 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 95.6) internal successors, (478), 5 states have internal predecessors, (478), 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 22:07:46,626 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 22:07:46,626 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 22:07:46,626 INFO L175 Difference]: Start difference. First operand has 46 places, 28 transitions, 166 flow. Second operand 5 states and 478 transitions. [2023-08-31 22:07:46,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 32 transitions, 239 flow [2023-08-31 22:07:46,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 32 transitions, 238 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:07:46,627 INFO L231 Difference]: Finished difference. Result has 48 places, 28 transitions, 178 flow [2023-08-31 22:07:46,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=48, PETRI_TRANSITIONS=28} [2023-08-31 22:07:46,628 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 12 predicate places. [2023-08-31 22:07:46,628 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 28 transitions, 178 flow [2023-08-31 22:07:46,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.4) internal successors, (467), 5 states have internal predecessors, (467), 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 22:07:46,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:46,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:46,629 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-31 22:07:46,629 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:46,629 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:46,629 INFO L85 PathProgramCache]: Analyzing trace with hash 1258283588, now seen corresponding path program 1 times [2023-08-31 22:07:46,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:46,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1956328918] [2023-08-31 22:07:46,630 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:46,630 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:46,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:46,843 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 22:07:46,843 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:46,843 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1956328918] [2023-08-31 22:07:46,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1956328918] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:46,844 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:07:46,844 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-08-31 22:07:46,844 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1944475424] [2023-08-31 22:07:46,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:46,845 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 22:07:46,845 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:46,845 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 22:07:46,845 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-08-31 22:07:47,096 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 221 [2023-08-31 22:07:47,096 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 28 transitions, 178 flow. Second operand has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 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 22:07:47,096 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:47,096 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 221 [2023-08-31 22:07:47,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:47,170 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-31 22:07:47,170 INFO L131 PetriNetUnfolder]: For 85/85 co-relation queries the response was YES. [2023-08-31 22:07:47,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 262 conditions, 64 events. 19/64 cut-off events. For 85/85 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 151 event pairs, 1 based on Foata normal form. 2/66 useless extension candidates. Maximal degree in co-relation 246. Up to 45 conditions per place. [2023-08-31 22:07:47,170 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 22 selfloop transitions, 9 changer transitions 0/31 dead transitions. [2023-08-31 22:07:47,170 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 31 transitions, 245 flow [2023-08-31 22:07:47,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:47,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:47,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 527 transitions. [2023-08-31 22:07:47,173 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3974358974358974 [2023-08-31 22:07:47,173 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 527 transitions. [2023-08-31 22:07:47,173 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 527 transitions. [2023-08-31 22:07:47,174 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:47,174 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 527 transitions. [2023-08-31 22:07:47,174 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 87.83333333333333) internal successors, (527), 6 states have internal predecessors, (527), 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 22:07:47,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:47,176 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:47,176 INFO L175 Difference]: Start difference. First operand has 48 places, 28 transitions, 178 flow. Second operand 6 states and 527 transitions. [2023-08-31 22:07:47,176 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 31 transitions, 245 flow [2023-08-31 22:07:47,177 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 31 transitions, 237 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:07:47,178 INFO L231 Difference]: Finished difference. Result has 50 places, 28 transitions, 192 flow [2023-08-31 22:07:47,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=161, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=50, PETRI_TRANSITIONS=28} [2023-08-31 22:07:47,190 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-31 22:07:47,190 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 28 transitions, 192 flow [2023-08-31 22:07:47,190 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 85.5) internal successors, (684), 8 states have internal predecessors, (684), 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 22:07:47,190 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:47,191 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:47,191 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-31 22:07:47,191 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:47,191 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:47,191 INFO L85 PathProgramCache]: Analyzing trace with hash 351953142, now seen corresponding path program 1 times [2023-08-31 22:07:47,191 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:47,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135140296] [2023-08-31 22:07:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:47,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:47,383 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:47,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:47,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135140296] [2023-08-31 22:07:47,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135140296] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:47,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [772242550] [2023-08-31 22:07:47,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:47,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:47,384 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:47,384 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:47,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-31 22:07:47,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:47,455 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-31 22:07:47,457 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:47,494 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:47,494 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:47,500 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:47,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:47,586 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:07:47,586 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:07:47,613 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:47,653 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:47,669 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:47,670 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:47,684 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_225) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-31 22:07:47,773 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-08-31 22:07:47,773 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [772242550] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:47,773 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:47,773 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 15 [2023-08-31 22:07:47,773 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065764252] [2023-08-31 22:07:47,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:47,774 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:07:47,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:47,775 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:07:47,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=172, Unknown=2, NotChecked=26, Total=240 [2023-08-31 22:07:47,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:07:47,784 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 28 transitions, 192 flow. Second operand has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 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 22:07:47,784 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:47,784 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:07:47,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:47,982 INFO L130 PetriNetUnfolder]: 18/58 cut-off events. [2023-08-31 22:07:47,982 INFO L131 PetriNetUnfolder]: For 118/118 co-relation queries the response was YES. [2023-08-31 22:07:47,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 251 conditions, 58 events. 18/58 cut-off events. For 118/118 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 125 event pairs, 2 based on Foata normal form. 2/60 useless extension candidates. Maximal degree in co-relation 234. Up to 40 conditions per place. [2023-08-31 22:07:47,982 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 24 selfloop transitions, 6 changer transitions 0/30 dead transitions. [2023-08-31 22:07:47,982 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 30 transitions, 249 flow [2023-08-31 22:07:47,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:07:47,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:07:47,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 204 transitions. [2023-08-31 22:07:47,984 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.18461538461538463 [2023-08-31 22:07:47,984 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 204 transitions. [2023-08-31 22:07:47,984 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 204 transitions. [2023-08-31 22:07:47,984 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:47,984 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 204 transitions. [2023-08-31 22:07:47,984 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 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 22:07:47,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 22:07:47,986 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 221.0) internal successors, (1326), 6 states have internal predecessors, (1326), 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 22:07:47,986 INFO L175 Difference]: Start difference. First operand has 50 places, 28 transitions, 192 flow. Second operand 5 states and 204 transitions. [2023-08-31 22:07:47,987 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 30 transitions, 249 flow [2023-08-31 22:07:47,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 236 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-08-31 22:07:47,988 INFO L231 Difference]: Finished difference. Result has 50 places, 27 transitions, 189 flow [2023-08-31 22:07:47,989 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=160, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=189, PETRI_PLACES=50, PETRI_TRANSITIONS=27} [2023-08-31 22:07:47,990 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-31 22:07:47,990 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 27 transitions, 189 flow [2023-08-31 22:07:47,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 38.1875) internal successors, (611), 16 states have internal predecessors, (611), 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 22:07:47,991 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:47,991 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:47,995 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-31 22:07:48,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:48,195 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:48,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:48,196 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254242, now seen corresponding path program 2 times [2023-08-31 22:07:48,196 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:48,196 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1118946871] [2023-08-31 22:07:48,196 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:48,196 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:48,348 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:48,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1118946871] [2023-08-31 22:07:48,348 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1118946871] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:48,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [543169273] [2023-08-31 22:07:48,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:07:48,349 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:48,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:48,350 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:48,351 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-31 22:07:48,413 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 22:07:48,413 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:07:48,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-31 22:07:48,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:48,424 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:48,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:48,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:48,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:48,448 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:48,448 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:48,489 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-31 22:07:48,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 22:07:48,493 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 22:07:48,584 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2023-08-31 22:07:48,585 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:07:48,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [543169273] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:07:48,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-08-31 22:07:48,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [8] total 11 [2023-08-31 22:07:48,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864974289] [2023-08-31 22:07:48,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:07:48,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:07:48,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:48,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:07:48,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=111, Unknown=0, NotChecked=0, Total=132 [2023-08-31 22:07:48,726 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 221 [2023-08-31 22:07:48,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 27 transitions, 189 flow. Second operand has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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 22:07:48,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:48,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 221 [2023-08-31 22:07:48,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:48,805 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-31 22:07:48,805 INFO L131 PetriNetUnfolder]: For 107/107 co-relation queries the response was YES. [2023-08-31 22:07:48,805 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 53 events. 15/53 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 106 event pairs, 0 based on Foata normal form. 4/57 useless extension candidates. Maximal degree in co-relation 220. Up to 40 conditions per place. [2023-08-31 22:07:48,806 INFO L137 encePairwiseOnDemand]: 216/221 looper letters, 21 selfloop transitions, 6 changer transitions 0/27 dead transitions. [2023-08-31 22:07:48,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 27 transitions, 229 flow [2023-08-31 22:07:48,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:07:48,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:07:48,807 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 564 transitions. [2023-08-31 22:07:48,807 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4253393665158371 [2023-08-31 22:07:48,807 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 564 transitions. [2023-08-31 22:07:48,807 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 564 transitions. [2023-08-31 22:07:48,807 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:48,807 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 564 transitions. [2023-08-31 22:07:48,808 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 94.0) internal successors, (564), 6 states have internal predecessors, (564), 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 22:07:48,809 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:48,810 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 221.0) internal successors, (1547), 7 states have internal predecessors, (1547), 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 22:07:48,810 INFO L175 Difference]: Start difference. First operand has 50 places, 27 transitions, 189 flow. Second operand 6 states and 564 transitions. [2023-08-31 22:07:48,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 27 transitions, 229 flow [2023-08-31 22:07:48,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 27 transitions, 208 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-31 22:07:48,811 INFO L231 Difference]: Finished difference. Result has 47 places, 25 transitions, 162 flow [2023-08-31 22:07:48,811 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=162, PETRI_PLACES=47, PETRI_TRANSITIONS=25} [2023-08-31 22:07:48,811 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-31 22:07:48,811 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 25 transitions, 162 flow [2023-08-31 22:07:48,811 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 93.0) internal successors, (465), 5 states have internal predecessors, (465), 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 22:07:48,811 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:48,812 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:48,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-08-31 22:07:49,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-08-31 22:07:49,016 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:49,017 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:49,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1974487420, now seen corresponding path program 1 times [2023-08-31 22:07:49,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:49,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846117534] [2023-08-31 22:07:49,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:49,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,246 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:49,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846117534] [2023-08-31 22:07:49,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1846117534] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:49,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1097576389] [2023-08-31 22:07:49,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:49,247 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:49,247 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:49,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:49,303 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-31 22:07:49,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:49,351 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-31 22:07:49,353 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:49,386 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:49,386 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:49,394 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:49,469 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:49,474 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:07:49,474 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:07:49,502 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:49,549 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:49,577 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:07:49,597 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:49,597 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:49,615 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_314 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_314) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 1)))) is different from false [2023-08-31 22:07:49,757 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-08-31 22:07:49,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1097576389] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:49,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:49,758 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 20 [2023-08-31 22:07:49,758 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727414963] [2023-08-31 22:07:49,758 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:49,758 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-08-31 22:07:49,758 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:49,759 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-08-31 22:07:49,759 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=321, Unknown=6, NotChecked=36, Total=420 [2023-08-31 22:07:49,959 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:07:49,960 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 25 transitions, 162 flow. Second operand has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 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 22:07:49,960 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:07:49,960 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:07:49,960 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:07:52,240 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:07:54,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.06s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:07:56,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:07:56,424 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-08-31 22:07:56,424 INFO L131 PetriNetUnfolder]: For 80/80 co-relation queries the response was YES. [2023-08-31 22:07:56,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 47 events. 14/47 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 71 event pairs, 1 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 185. Up to 26 conditions per place. [2023-08-31 22:07:56,425 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 21 selfloop transitions, 7 changer transitions 0/28 dead transitions. [2023-08-31 22:07:56,425 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 28 transitions, 211 flow [2023-08-31 22:07:56,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:07:56,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:07:56,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 278 transitions. [2023-08-31 22:07:56,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17970265029088558 [2023-08-31 22:07:56,426 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 278 transitions. [2023-08-31 22:07:56,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 278 transitions. [2023-08-31 22:07:56,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:07:56,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 278 transitions. [2023-08-31 22:07:56,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.714285714285715) internal successors, (278), 7 states have internal predecessors, (278), 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 22:07:56,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 22:07:56,429 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 221.0) internal successors, (1768), 8 states have internal predecessors, (1768), 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 22:07:56,429 INFO L175 Difference]: Start difference. First operand has 47 places, 25 transitions, 162 flow. Second operand 7 states and 278 transitions. [2023-08-31 22:07:56,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 28 transitions, 211 flow [2023-08-31 22:07:56,429 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 28 transitions, 197 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-08-31 22:07:56,430 INFO L231 Difference]: Finished difference. Result has 47 places, 23 transitions, 145 flow [2023-08-31 22:07:56,430 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=145, PETRI_PLACES=47, PETRI_TRANSITIONS=23} [2023-08-31 22:07:56,430 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 11 predicate places. [2023-08-31 22:07:56,430 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 23 transitions, 145 flow [2023-08-31 22:07:56,431 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 37.80952380952381) internal successors, (794), 21 states have internal predecessors, (794), 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 22:07:56,431 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:07:56,431 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:07:56,449 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-31 22:07:56,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-08-31 22:07:56,632 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:07:56,632 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:07:56,632 INFO L85 PathProgramCache]: Analyzing trace with hash -1175254296, now seen corresponding path program 2 times [2023-08-31 22:07:56,632 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:07:56,632 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376167895] [2023-08-31 22:07:56,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:07:56,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:07:56,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:07:57,111 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:57,111 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:07:57,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376167895] [2023-08-31 22:07:57,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376167895] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:07:57,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1975528057] [2023-08-31 22:07:57,112 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:07:57,112 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:07:57,112 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:07:57,130 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:07:57,168 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-31 22:07:57,224 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:07:57,224 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:07:57,225 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 35 conjunts are in the unsatisfiable core [2023-08-31 22:07:57,228 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:07:57,239 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:57,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:57,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:57,243 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:07:57,277 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:07:57,277 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:07:57,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:07:57,332 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 22:07:57,491 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:57,491 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:07:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:07:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1975528057] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:07:57,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:07:57,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 26 [2023-08-31 22:07:57,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712839092] [2023-08-31 22:07:57,685 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:07:57,685 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-31 22:07:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:07:57,685 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-31 22:07:57,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2023-08-31 22:08:00,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 221 [2023-08-31 22:08:00,414 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 23 transitions, 145 flow. Second operand has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 states have internal predecessors, (2142), 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 22:08:00,414 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:08:00,414 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 221 [2023-08-31 22:08:00,414 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:08:01,256 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2023-08-31 22:08:01,257 INFO L131 PetriNetUnfolder]: For 127/127 co-relation queries the response was YES. [2023-08-31 22:08:01,257 INFO L83 FinitePrefix]: Finished finitePrefix Result has 301 conditions, 74 events. 20/74 cut-off events. For 127/127 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 176 event pairs, 3 based on Foata normal form. 6/80 useless extension candidates. Maximal degree in co-relation 287. Up to 18 conditions per place. [2023-08-31 22:08:01,257 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 32 selfloop transitions, 16 changer transitions 0/48 dead transitions. [2023-08-31 22:08:01,257 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 48 transitions, 343 flow [2023-08-31 22:08:01,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-08-31 22:08:01,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-08-31 22:08:01,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 1251 transitions. [2023-08-31 22:08:01,263 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.353789592760181 [2023-08-31 22:08:01,263 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 1251 transitions. [2023-08-31 22:08:01,263 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 1251 transitions. [2023-08-31 22:08:01,264 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:08:01,264 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 1251 transitions. [2023-08-31 22:08:01,266 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 78.1875) internal successors, (1251), 16 states have internal predecessors, (1251), 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 22:08:01,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 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 22:08:01,270 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 221.0) internal successors, (3757), 17 states have internal predecessors, (3757), 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 22:08:01,270 INFO L175 Difference]: Start difference. First operand has 47 places, 23 transitions, 145 flow. Second operand 16 states and 1251 transitions. [2023-08-31 22:08:01,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 48 transitions, 343 flow [2023-08-31 22:08:01,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 48 transitions, 304 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-31 22:08:01,271 INFO L231 Difference]: Finished difference. Result has 57 places, 30 transitions, 214 flow [2023-08-31 22:08:01,271 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=214, PETRI_PLACES=57, PETRI_TRANSITIONS=30} [2023-08-31 22:08:01,272 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:08:01,272 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 30 transitions, 214 flow [2023-08-31 22:08:01,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 76.5) internal successors, (2142), 28 states have internal predecessors, (2142), 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 22:08:01,273 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:08:01,273 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:08:01,278 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-31 22:08:01,477 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:01,477 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:08:01,477 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:08:01,477 INFO L85 PathProgramCache]: Analyzing trace with hash -1079700314, now seen corresponding path program 2 times [2023-08-31 22:08:01,477 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:08:01,477 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2030361017] [2023-08-31 22:08:01,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:08:01,478 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:08:01,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:08:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:08:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2030361017] [2023-08-31 22:08:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2030361017] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:08:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [678174375] [2023-08-31 22:08:01,768 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:08:01,768 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:08:01,768 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:08:01,777 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:08:01,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-31 22:08:01,889 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:08:01,889 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:08:01,891 INFO L263 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 46 conjunts are in the unsatisfiable core [2023-08-31 22:08:01,892 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:08:01,911 INFO L321 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-08-31 22:08:01,912 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-08-31 22:08:01,916 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:01,963 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:08:02,034 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:08:02,035 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2023-08-31 22:08:02,071 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:08:02,072 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-31 22:08:02,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:02,119 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:08:02,119 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-31 22:08:02,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:08:02,163 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:08:02,163 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 28 [2023-08-31 22:08:02,189 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:02,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:08:19,379 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 2 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:08:19,380 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [678174375] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:08:19,380 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:08:19,380 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 7] total 23 [2023-08-31 22:08:19,380 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210063214] [2023-08-31 22:08:19,380 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:08:19,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-08-31 22:08:19,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:08:19,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-08-31 22:08:19,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=459, Unknown=8, NotChecked=0, Total=552 [2023-08-31 22:08:21,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:23,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:25,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:27,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:29,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:31,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:33,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:35,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:37,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:40,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:42,016 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:44,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:46,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:48,104 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:50,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:52,125 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:54,138 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:56,151 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:08:58,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:00,416 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:02,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:04,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:06,550 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:08,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:10,672 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:12,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:14,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:16,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:18,813 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:20,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:22,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:24,894 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:26,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:28,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:31,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:33,350 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:35,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:37,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:39,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:41,539 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:43,605 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:45,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:47,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:50,277 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:52,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:54,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:56,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:09:58,563 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:00,590 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:02,690 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:04,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:06,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:08,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:08,884 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 221 [2023-08-31 22:10:08,885 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 30 transitions, 214 flow. Second operand has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 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 22:10:08,885 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:08,885 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 221 [2023-08-31 22:10:08,885 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:09,247 INFO L130 PetriNetUnfolder]: 19/64 cut-off events. [2023-08-31 22:10:09,248 INFO L131 PetriNetUnfolder]: For 76/76 co-relation queries the response was YES. [2023-08-31 22:10:09,248 INFO L83 FinitePrefix]: Finished finitePrefix Result has 285 conditions, 64 events. 19/64 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 124 event pairs, 1 based on Foata normal form. 6/70 useless extension candidates. Maximal degree in co-relation 271. Up to 38 conditions per place. [2023-08-31 22:10:09,248 INFO L137 encePairwiseOnDemand]: 215/221 looper letters, 22 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2023-08-31 22:10:09,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 32 transitions, 273 flow [2023-08-31 22:10:09,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:10:09,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:10:09,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 358 transitions. [2023-08-31 22:10:09,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17998994469582705 [2023-08-31 22:10:09,251 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 358 transitions. [2023-08-31 22:10:09,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 358 transitions. [2023-08-31 22:10:09,251 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:09,251 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 358 transitions. [2023-08-31 22:10:09,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.77777777777778) internal successors, (358), 9 states have internal predecessors, (358), 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 22:10:09,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 22:10:09,253 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 22:10:09,253 INFO L175 Difference]: Start difference. First operand has 57 places, 30 transitions, 214 flow. Second operand 9 states and 358 transitions. [2023-08-31 22:10:09,253 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 32 transitions, 273 flow [2023-08-31 22:10:09,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 32 transitions, 246 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-31 22:10:09,255 INFO L231 Difference]: Finished difference. Result has 55 places, 27 transitions, 192 flow [2023-08-31 22:10:09,255 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=192, PETRI_PLACES=55, PETRI_TRANSITIONS=27} [2023-08-31 22:10:09,255 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-31 22:10:09,255 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 27 transitions, 192 flow [2023-08-31 22:10:09,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 38.75) internal successors, (930), 24 states have internal predecessors, (930), 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 22:10:09,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:09,255 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:09,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:09,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:09,456 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:09,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:09,456 INFO L85 PathProgramCache]: Analyzing trace with hash 888896212, now seen corresponding path program 2 times [2023-08-31 22:10:09,457 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:09,457 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1025979438] [2023-08-31 22:10:09,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:09,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:09,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:09,783 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:09,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:10:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1025979438] [2023-08-31 22:10:09,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1025979438] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:10:09,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2107359500] [2023-08-31 22:10:09,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:10:09,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:09,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:09,785 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:10:09,788 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-31 22:10:09,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:10:09,872 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:10:09,873 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 22:10:09,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:09,911 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:10:09,911 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:10:09,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:09,991 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:09,996 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:10:09,996 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:10:10,029 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:10,083 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:10,107 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:10,138 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:10,168 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:10,192 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:10,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:10,448 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:10,448 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2107359500] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:10,449 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:10,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 24 [2023-08-31 22:10:10,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995636709] [2023-08-31 22:10:10,449 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:10,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-08-31 22:10:10,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:10,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-08-31 22:10:10,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=521, Unknown=13, NotChecked=0, Total=600 [2023-08-31 22:10:10,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:10:10,756 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 27 transitions, 192 flow. Second operand has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 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 22:10:10,756 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:10,756 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:10:10,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:11,167 INFO L130 PetriNetUnfolder]: 18/59 cut-off events. [2023-08-31 22:10:11,167 INFO L131 PetriNetUnfolder]: For 109/109 co-relation queries the response was YES. [2023-08-31 22:10:11,167 INFO L83 FinitePrefix]: Finished finitePrefix Result has 253 conditions, 59 events. 18/59 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 95 event pairs, 2 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 239. Up to 32 conditions per place. [2023-08-31 22:10:11,167 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 23 selfloop transitions, 9 changer transitions 0/32 dead transitions. [2023-08-31 22:10:11,167 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 32 transitions, 260 flow [2023-08-31 22:10:11,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 22:10:11,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 22:10:11,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 316 transitions. [2023-08-31 22:10:11,168 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17873303167420815 [2023-08-31 22:10:11,169 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 316 transitions. [2023-08-31 22:10:11,169 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 316 transitions. [2023-08-31 22:10:11,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:11,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 316 transitions. [2023-08-31 22:10:11,169 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 39.5) internal successors, (316), 8 states have internal predecessors, (316), 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 22:10:11,171 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 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 22:10:11,171 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 221.0) internal successors, (1989), 9 states have internal predecessors, (1989), 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 22:10:11,171 INFO L175 Difference]: Start difference. First operand has 55 places, 27 transitions, 192 flow. Second operand 8 states and 316 transitions. [2023-08-31 22:10:11,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 32 transitions, 260 flow [2023-08-31 22:10:11,172 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 32 transitions, 237 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-08-31 22:10:11,172 INFO L231 Difference]: Finished difference. Result has 54 places, 26 transitions, 186 flow [2023-08-31 22:10:11,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=186, PETRI_PLACES=54, PETRI_TRANSITIONS=26} [2023-08-31 22:10:11,173 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-08-31 22:10:11,173 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 26 transitions, 186 flow [2023-08-31 22:10:11,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 37.76) internal successors, (944), 25 states have internal predecessors, (944), 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 22:10:11,173 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:11,173 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:11,178 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-08-31 22:10:11,378 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-08-31 22:10:11,378 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:11,378 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:11,378 INFO L85 PathProgramCache]: Analyzing trace with hash 574975110, now seen corresponding path program 3 times [2023-08-31 22:10:11,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:11,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642700326] [2023-08-31 22:10:11,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:11,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:11,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:11,969 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:11,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:10:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642700326] [2023-08-31 22:10:11,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642700326] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:10:11,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789394294] [2023-08-31 22:10:11,969 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:10:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:11,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:11,970 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:10:11,997 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-08-31 22:10:12,094 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2023-08-31 22:10:12,094 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:10:12,095 INFO L263 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 43 conjunts are in the unsatisfiable core [2023-08-31 22:10:12,100 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:12,134 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:10:12,134 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:10:12,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,208 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:12,215 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:10:12,215 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 14 [2023-08-31 22:10:12,245 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,297 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,345 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,423 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,465 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:12,503 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:12,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:12,558 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_526) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-31 22:10:12,595 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_526 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_526) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-31 22:10:12,745 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2023-08-31 22:10:12,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789394294] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:12,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:12,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 10] total 27 [2023-08-31 22:10:12,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611272958] [2023-08-31 22:10:12,745 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:12,746 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-08-31 22:10:12,746 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:12,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-08-31 22:10:12,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=575, Unknown=21, NotChecked=98, Total=756 [2023-08-31 22:10:12,860 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:10:12,861 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 26 transitions, 186 flow. Second operand has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 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 22:10:12,861 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:12,861 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:10:12,861 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:13,437 INFO L130 PetriNetUnfolder]: 17/54 cut-off events. [2023-08-31 22:10:13,438 INFO L131 PetriNetUnfolder]: For 115/115 co-relation queries the response was YES. [2023-08-31 22:10:13,438 INFO L83 FinitePrefix]: Finished finitePrefix Result has 233 conditions, 54 events. 17/54 cut-off events. For 115/115 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 73 event pairs, 2 based on Foata normal form. 2/56 useless extension candidates. Maximal degree in co-relation 219. Up to 24 conditions per place. [2023-08-31 22:10:13,439 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 22 selfloop transitions, 10 changer transitions 0/32 dead transitions. [2023-08-31 22:10:13,439 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 32 transitions, 252 flow [2023-08-31 22:10:13,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:10:13,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:10:13,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 354 transitions. [2023-08-31 22:10:13,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.1779788838612368 [2023-08-31 22:10:13,456 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 354 transitions. [2023-08-31 22:10:13,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 354 transitions. [2023-08-31 22:10:13,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:13,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 354 transitions. [2023-08-31 22:10:13,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 39.333333333333336) internal successors, (354), 9 states have internal predecessors, (354), 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 22:10:13,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 22:10:13,458 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 221.0) internal successors, (2210), 10 states have internal predecessors, (2210), 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 22:10:13,458 INFO L175 Difference]: Start difference. First operand has 54 places, 26 transitions, 186 flow. Second operand 9 states and 354 transitions. [2023-08-31 22:10:13,458 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 32 transitions, 252 flow [2023-08-31 22:10:13,459 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 32 transitions, 232 flow, removed 2 selfloop flow, removed 7 redundant places. [2023-08-31 22:10:13,460 INFO L231 Difference]: Finished difference. Result has 55 places, 25 transitions, 181 flow [2023-08-31 22:10:13,460 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=14, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=181, PETRI_PLACES=55, PETRI_TRANSITIONS=25} [2023-08-31 22:10:13,460 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 19 predicate places. [2023-08-31 22:10:13,460 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 25 transitions, 181 flow [2023-08-31 22:10:13,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 37.67857142857143) internal successors, (1055), 28 states have internal predecessors, (1055), 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 22:10:13,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:13,460 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:13,481 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:13,665 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:13,666 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:13,666 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:13,666 INFO L85 PathProgramCache]: Analyzing trace with hash 575804722, now seen corresponding path program 3 times [2023-08-31 22:10:13,666 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:13,666 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432737737] [2023-08-31 22:10:13,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:13,667 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:13,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:14,325 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:14,325 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:10:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432737737] [2023-08-31 22:10:14,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432737737] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:10:14,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1530287348] [2023-08-31 22:10:14,325 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:10:14,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:14,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:14,327 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:10:14,354 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-08-31 22:10:14,427 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-31 22:10:14,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:10:14,429 INFO L263 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 65 conjunts are in the unsatisfiable core [2023-08-31 22:10:14,433 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:14,443 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:14,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:14,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:14,446 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:10:14,475 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:10:14,475 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:10:14,485 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,581 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:14,581 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:10:14,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:14,602 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-31 22:10:14,603 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 21 [2023-08-31 22:10:14,644 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,712 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,747 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,778 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,813 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,847 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,884 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,922 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:14,947 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 8 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:14,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:15,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1530287348] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:15,466 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:15,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 12] total 36 [2023-08-31 22:10:15,466 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726489144] [2023-08-31 22:10:15,466 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:15,466 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2023-08-31 22:10:15,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:15,467 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2023-08-31 22:10:15,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1179, Unknown=20, NotChecked=0, Total=1332 [2023-08-31 22:10:17,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:10:17,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 25 transitions, 181 flow. Second operand has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 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 22:10:17,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:17,399 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:10:17,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:18,304 INFO L130 PetriNetUnfolder]: 11/44 cut-off events. [2023-08-31 22:10:18,304 INFO L131 PetriNetUnfolder]: For 67/67 co-relation queries the response was YES. [2023-08-31 22:10:18,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 192 conditions, 44 events. 11/44 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 47 event pairs, 1 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 177. Up to 11 conditions per place. [2023-08-31 22:10:18,304 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 19 selfloop transitions, 11 changer transitions 0/30 dead transitions. [2023-08-31 22:10:18,304 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 30 transitions, 219 flow [2023-08-31 22:10:18,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 22:10:18,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 22:10:18,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 499 transitions. [2023-08-31 22:10:18,305 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.173686042464323 [2023-08-31 22:10:18,305 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 499 transitions. [2023-08-31 22:10:18,305 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 499 transitions. [2023-08-31 22:10:18,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:18,305 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 499 transitions. [2023-08-31 22:10:18,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 38.38461538461539) internal successors, (499), 13 states have internal predecessors, (499), 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 22:10:18,308 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 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 22:10:18,309 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 221.0) internal successors, (3094), 14 states have internal predecessors, (3094), 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 22:10:18,309 INFO L175 Difference]: Start difference. First operand has 55 places, 25 transitions, 181 flow. Second operand 13 states and 499 transitions. [2023-08-31 22:10:18,309 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 30 transitions, 219 flow [2023-08-31 22:10:18,310 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 30 transitions, 173 flow, removed 3 selfloop flow, removed 17 redundant places. [2023-08-31 22:10:18,310 INFO L231 Difference]: Finished difference. Result has 49 places, 21 transitions, 116 flow [2023-08-31 22:10:18,310 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=10, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=116, PETRI_PLACES=49, PETRI_TRANSITIONS=21} [2023-08-31 22:10:18,311 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 13 predicate places. [2023-08-31 22:10:18,311 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 21 transitions, 116 flow [2023-08-31 22:10:18,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 37.351351351351354) internal successors, (1382), 37 states have internal predecessors, (1382), 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 22:10:18,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:18,312 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:18,319 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:18,517 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-08-31 22:10:18,517 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:18,517 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:18,517 INFO L85 PathProgramCache]: Analyzing trace with hash -473485548, now seen corresponding path program 4 times [2023-08-31 22:10:18,517 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:18,517 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049904463] [2023-08-31 22:10:18,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:18,518 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:18,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:19,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-31 22:10:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049904463] [2023-08-31 22:10:19,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049904463] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-31 22:10:19,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473704065] [2023-08-31 22:10:19,128 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 22:10:19,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-31 22:10:19,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:19,129 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-31 22:10:19,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-08-31 22:10:19,241 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 22:10:19,241 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:10:19,243 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 48 conjunts are in the unsatisfiable core [2023-08-31 22:10:19,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:19,275 INFO L321 Elim1Store]: treesize reduction 60, result has 24.1 percent of original size [2023-08-31 22:10:19,275 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 37 [2023-08-31 22:10:19,281 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,342 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-08-31 22:10:19,342 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-08-31 22:10:19,371 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,435 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,463 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,605 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2023-08-31 22:10:19,633 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:19,633 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:19,695 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 2 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-31 22:10:19,698 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 3 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-31 22:10:19,701 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| 4)))) is different from false [2023-08-31 22:10:19,705 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_660 (Array Int Int))) (< 0 (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_660) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (+ |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| 5 |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)))) is different from false [2023-08-31 22:10:21,913 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-08-31 22:10:21,913 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473704065] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:21,914 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-31 22:10:21,914 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 11] total 30 [2023-08-31 22:10:21,914 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787628124] [2023-08-31 22:10:21,914 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:21,914 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-08-31 22:10:21,914 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-31 22:10:21,914 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-08-31 22:10:21,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=636, Unknown=14, NotChecked=212, Total=930 [2023-08-31 22:10:21,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 221 [2023-08-31 22:10:21,916 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 21 transitions, 116 flow. Second operand has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 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 22:10:21,916 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:21,916 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 221 [2023-08-31 22:10:21,916 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:22,835 INFO L130 PetriNetUnfolder]: 10/39 cut-off events. [2023-08-31 22:10:22,835 INFO L131 PetriNetUnfolder]: For 29/29 co-relation queries the response was YES. [2023-08-31 22:10:22,835 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 39 events. 10/39 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 32 event pairs, 1 based on Foata normal form. 2/41 useless extension candidates. Maximal degree in co-relation 132. Up to 10 conditions per place. [2023-08-31 22:10:22,835 INFO L137 encePairwiseOnDemand]: 217/221 looper letters, 18 selfloop transitions, 10 changer transitions 0/28 dead transitions. [2023-08-31 22:10:22,835 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 28 transitions, 171 flow [2023-08-31 22:10:22,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-08-31 22:10:22,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-08-31 22:10:22,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 425 transitions. [2023-08-31 22:10:22,837 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.17482517482517482 [2023-08-31 22:10:22,837 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 425 transitions. [2023-08-31 22:10:22,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 425 transitions. [2023-08-31 22:10:22,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:22,837 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 425 transitions. [2023-08-31 22:10:22,837 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 38.63636363636363) internal successors, (425), 11 states have internal predecessors, (425), 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 22:10:22,839 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 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 22:10:22,839 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 221.0) internal successors, (2652), 12 states have internal predecessors, (2652), 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 22:10:22,839 INFO L175 Difference]: Start difference. First operand has 49 places, 21 transitions, 116 flow. Second operand 11 states and 425 transitions. [2023-08-31 22:10:22,839 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 28 transitions, 171 flow [2023-08-31 22:10:22,839 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 28 transitions, 144 flow, removed 1 selfloop flow, removed 12 redundant places. [2023-08-31 22:10:22,840 INFO L231 Difference]: Finished difference. Result has 45 places, 19 transitions, 90 flow [2023-08-31 22:10:22,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=221, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=90, PETRI_PLACES=45, PETRI_TRANSITIONS=19} [2023-08-31 22:10:22,841 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 9 predicate places. [2023-08-31 22:10:22,841 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 19 transitions, 90 flow [2023-08-31 22:10:22,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.61290322580645) internal successors, (1166), 31 states have internal predecessors, (1166), 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 22:10:22,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:22,841 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:22,848 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:23,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-08-31 22:10:23,046 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:23,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:23,047 INFO L85 PathProgramCache]: Analyzing trace with hash -1793283018, now seen corresponding path program 5 times [2023-08-31 22:10:23,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-31 22:10:23,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572161897] [2023-08-31 22:10:23,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:23,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-31 22:10:23,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:10:23,062 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 22:10:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:10:23,095 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-31 22:10:23,095 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 22:10:23,096 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-31 22:10:23,097 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-31 22:10:23,098 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-31 22:10:23,099 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-31 22:10:23,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-31 22:10:23,100 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-31 22:10:23,100 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-08-31 22:10:23,100 INFO L445 BasicCegarLoop]: Path program histogram: [5, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:23,115 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 22:10:23,115 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 22:10:23,123 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,126 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,127 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,127 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,127 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,128 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,128 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,128 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,129 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,129 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,129 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,132 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,132 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,132 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,132 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,132 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,133 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,133 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,133 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,133 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,136 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,136 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,136 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,137 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,138 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,138 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,138 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,138 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,140 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,141 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,142 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:10:23,143 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:10:23,153 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 10:10:23 BasicIcfg [2023-08-31 22:10:23,157 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 22:10:23,157 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 22:10:23,157 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 22:10:23,157 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 22:10:23,158 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:07:37" (3/4) ... [2023-08-31 22:10:23,159 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 22:10:23,159 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 22:10:23,159 INFO L158 Benchmark]: Toolchain (without parser) took 166870.22ms. Allocated memory was 67.1MB in the beginning and 207.6MB in the end (delta: 140.5MB). Free memory was 43.0MB in the beginning and 94.6MB in the end (delta: -51.7MB). Peak memory consumption was 90.4MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,160 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:10:23,160 INFO L158 Benchmark]: CACSL2BoogieTranslator took 531.34ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 42.8MB in the beginning and 48.0MB in the end (delta: -5.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,160 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.20ms. Allocated memory is still 88.1MB. Free memory was 47.6MB in the beginning and 45.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,161 INFO L158 Benchmark]: Boogie Preprocessor took 36.05ms. Allocated memory is still 88.1MB. Free memory was 45.1MB in the beginning and 43.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,161 INFO L158 Benchmark]: RCFGBuilder took 426.16ms. Allocated memory is still 88.1MB. Free memory was 43.8MB in the beginning and 56.6MB in the end (delta: -12.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,161 INFO L158 Benchmark]: TraceAbstraction took 165816.63ms. Allocated memory was 88.1MB in the beginning and 207.6MB in the end (delta: 119.5MB). Free memory was 55.6MB in the beginning and 94.6MB in the end (delta: -39.0MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. [2023-08-31 22:10:23,161 INFO L158 Benchmark]: Witness Printer took 2.15ms. Allocated memory is still 207.6MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:10:23,163 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 67.1MB. Free memory was 44.5MB in the beginning and 44.4MB in the end (delta: 49.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 531.34ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 42.8MB in the beginning and 48.0MB in the end (delta: -5.2MB). Peak memory consumption was 17.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.20ms. Allocated memory is still 88.1MB. Free memory was 47.6MB in the beginning and 45.1MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.05ms. Allocated memory is still 88.1MB. Free memory was 45.1MB in the beginning and 43.8MB in the end (delta: 1.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 426.16ms. Allocated memory is still 88.1MB. Free memory was 43.8MB in the beginning and 56.6MB in the end (delta: -12.8MB). Peak memory consumption was 11.1MB. Max. memory is 16.1GB. * TraceAbstraction took 165816.63ms. Allocated memory was 88.1MB in the beginning and 207.6MB in the end (delta: 119.5MB). Free memory was 55.6MB in the beginning and 94.6MB in the end (delta: -39.0MB). Peak memory consumption was 78.9MB. Max. memory is 16.1GB. * Witness Printer took 2.15ms. Allocated memory is still 207.6MB. Free memory is still 94.6MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 3.2s, 103 PlacesBefore, 36 PlacesAfterwards, 100 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 62 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 115 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 355, independent: 330, independent conditional: 0, independent unconditional: 330, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 183, independent: 172, independent conditional: 0, independent unconditional: 172, dependent: 11, dependent conditional: 0, dependent unconditional: 11, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 355, independent: 158, independent conditional: 0, independent unconditional: 158, dependent: 14, dependent conditional: 0, dependent unconditional: 14, unknown: 183, unknown conditional: 0, unknown unconditional: 183] , Statistics on independence cache: Total cache size (in pairs): 12, Positive cache size: 10, Positive conditional cache size: 0, Positive unconditional cache size: 10, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1119. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=-2, t1={15:0}, t2={16:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=-2, arg={0:0}, t1={15:0}, t2={16:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=-2, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16:0}, v={9:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=-1, t1={15:0}, t2={16:0}, v={9:0}] [L1125] 0 \read(t2) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16:0}, v={9:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=-1, \result={0:0}, arg={0:0}, arg={0:0}, t1={15:0}, t2={16:0}, v={9:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 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: -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: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: 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: 1124]: 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 5 procedures, 138 locations, 26 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: 165.6s, OverallIterations: 25, TraceHistogramMax: 8, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 129.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 3.2s, HoareTripleCheckerStatistics: 231 mSolverCounterUnknown, 5405 SdHoareTripleChecker+Valid, 125.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4317 mSDsluCounter, 8059 SdHoareTripleChecker+Invalid, 123.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 414 IncrementalHoareTripleChecker+Unchecked, 7877 mSDsCounter, 450 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 18774 IncrementalHoareTripleChecker+Invalid, 19869 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 450 mSolverCounterUnsat, 182 mSDtfsCounter, 18774 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 231 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 516 GetRequests, 157 SyntacticMatches, 10 SemanticMatches, 349 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 1205 ImplicationChecksByTransitivity, 26.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=214occurred in iteration=19, InterpolantAutomatonStates: 154, 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.5s SatisfiabilityAnalysisTime, 29.1s InterpolantComputationTime, 429 NumberOfCodeBlocks, 424 NumberOfCodeBlocksAsserted, 47 NumberOfCheckSat, 509 ConstructedInterpolants, 111 QuantifiedInterpolants, 8726 SizeOfPredicates, 77 NumberOfNonLiveVariables, 2604 ConjunctsInSsa, 418 ConjunctsInUnsatCore, 45 InterpolantComputations, 14 PerfectInterpolantSequences, 33/357 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 22:10:23,208 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 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/bigshot_s2.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 fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb --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 22:10:24,800 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-31 22:10:24,802 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-31 22:10:24,836 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-31 22:10:24,836 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-31 22:10:24,839 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-31 22:10:24,840 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-31 22:10:24,842 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-31 22:10:24,843 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-31 22:10:24,848 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-31 22:10:24,849 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-31 22:10:24,851 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-31 22:10:24,851 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-31 22:10:24,853 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-31 22:10:24,854 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-31 22:10:24,857 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-31 22:10:24,859 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-31 22:10:24,860 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-31 22:10:24,861 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-31 22:10:24,864 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-31 22:10:24,867 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-31 22:10:24,873 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-31 22:10:24,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-31 22:10:24,875 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-31 22:10:24,877 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-31 22:10:24,880 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-31 22:10:24,880 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-31 22:10:24,881 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-31 22:10:24,882 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-31 22:10:24,882 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-31 22:10:24,883 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-31 22:10:24,883 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-31 22:10:24,884 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-31 22:10:24,885 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-31 22:10:24,885 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-31 22:10:24,886 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-31 22:10:24,887 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-31 22:10:24,887 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-31 22:10:24,887 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-31 22:10:24,888 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-31 22:10:24,888 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-31 22:10:24,889 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-31 22:10:24,908 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-31 22:10:24,916 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-31 22:10:24,917 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-31 22:10:24,917 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-31 22:10:24,917 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-31 22:10:24,917 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-31 22:10:24,918 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-31 22:10:24,918 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-31 22:10:24,918 INFO L138 SettingsManager]: * Use SBE=true [2023-08-31 22:10:24,918 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-31 22:10:24,918 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-31 22:10:24,919 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-31 22:10:24,920 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-31 22:10:24,921 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-31 22:10:24,921 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-31 22:10:24,921 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-31 22:10:24,921 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:10:24,921 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-31 22:10:24,921 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-31 22:10:24,921 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-31 22:10:24,922 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-31 22:10:24,922 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 -> fa644cc26c2bb4f900e6af52233648196eb4dff503d36a50559ddcf2a4270ffb 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 22:10:25,178 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-31 22:10:25,198 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-31 22:10:25,201 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-31 22:10:25,202 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-31 22:10:25,202 INFO L275 PluginConnector]: CDTParser initialized [2023-08-31 22:10:25,203 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-31 22:10:26,190 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-31 22:10:26,471 INFO L351 CDTParser]: Found 1 translation units. [2023-08-31 22:10:26,475 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread/bigshot_s2.i [2023-08-31 22:10:26,491 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f9d9b03/eb2ea496b5c1451c9cbae009bd44603d/FLAG958de878a [2023-08-31 22:10:26,506 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/77f9d9b03/eb2ea496b5c1451c9cbae009bd44603d [2023-08-31 22:10:26,508 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-31 22:10:26,509 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-31 22:10:26,513 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-31 22:10:26,513 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-31 22:10:26,527 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-31 22:10:26,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:10:26" (1/1) ... [2023-08-31 22:10:26,528 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1dbccbb3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:26, skipping insertion in model container [2023-08-31 22:10:26,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 31.08 10:10:26" (1/1) ... [2023-08-31 22:10:26,532 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-31 22:10:26,572 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-31 22:10:26,934 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/bigshot_s2.i[55203,55216] [2023-08-31 22:10:26,951 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:10:26,965 INFO L203 MainTranslator]: Completed pre-run [2023-08-31 22:10:26,998 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/bigshot_s2.i[55203,55216] [2023-08-31 22:10:27,010 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-31 22:10:27,080 INFO L208 MainTranslator]: Completed translation [2023-08-31 22:10:27,080 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27 WrapperNode [2023-08-31 22:10:27,080 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-31 22:10:27,081 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-31 22:10:27,081 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-31 22:10:27,081 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-31 22:10:27,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 10:10:27" (1/1) ... [2023-08-31 22:10:27,112 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,139 INFO L138 Inliner]: procedures = 327, calls = 33, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 76 [2023-08-31 22:10:27,139 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-31 22:10:27,140 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-31 22:10:27,140 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-31 22:10:27,140 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-31 22:10:27,146 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,146 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,151 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,152 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,156 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,160 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-31 22:10:27,164 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-31 22:10:27,168 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-31 22:10:27,168 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-31 22:10:27,168 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (1/1) ... [2023-08-31 22:10:27,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-31 22:10:27,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-31 22:10:27,205 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 22:10:27,207 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 22:10:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE1 [2023-08-31 22:10:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-31 22:10:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-31 22:10:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-31 22:10:27,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-31 22:10:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-31 22:10:27,235 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure write~unchecked~intINTTYPE1 [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-31 22:10:27,235 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-31 22:10:27,236 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-31 22:10:27,236 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 22:10:27,369 INFO L236 CfgBuilder]: Building ICFG [2023-08-31 22:10:27,371 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-31 22:10:27,598 INFO L277 CfgBuilder]: Performing block encoding [2023-08-31 22:10:27,602 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-31 22:10:27,603 INFO L302 CfgBuilder]: Removed 1 assume(true) statements. [2023-08-31 22:10:27,604 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:27 BoogieIcfgContainer [2023-08-31 22:10:27,605 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-31 22:10:27,607 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-31 22:10:27,607 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-31 22:10:27,609 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-31 22:10:27,609 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 31.08 10:10:26" (1/3) ... [2023-08-31 22:10:27,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363aa226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:10:27, skipping insertion in model container [2023-08-31 22:10:27,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 31.08 10:10:27" (2/3) ... [2023-08-31 22:10:27,610 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@363aa226 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 31.08 10:10:27, skipping insertion in model container [2023-08-31 22:10:27,610 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:27" (3/3) ... [2023-08-31 22:10:27,611 INFO L112 eAbstractionObserver]: Analyzing ICFG bigshot_s2.i [2023-08-31 22:10:27,621 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-31 22:10:27,621 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-31 22:10:27,622 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-31 22:10:27,723 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-08-31 22:10:27,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 110 places, 107 transitions, 230 flow [2023-08-31 22:10:27,787 INFO L130 PetriNetUnfolder]: 4/105 cut-off events. [2023-08-31 22:10:27,787 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:27,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 114 conditions, 105 events. 4/105 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 125 event pairs, 0 based on Foata normal form. 0/83 useless extension candidates. Maximal degree in co-relation 67. Up to 2 conditions per place. [2023-08-31 22:10:27,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 110 places, 107 transitions, 230 flow [2023-08-31 22:10:27,793 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 104 places, 101 transitions, 214 flow [2023-08-31 22:10:27,795 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-31 22:10:27,804 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-31 22:10:27,806 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 104 places, 101 transitions, 214 flow [2023-08-31 22:10:27,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 104 places, 101 transitions, 214 flow [2023-08-31 22:10:27,827 INFO L130 PetriNetUnfolder]: 4/101 cut-off events. [2023-08-31 22:10:27,827 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:27,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 110 conditions, 101 events. 4/101 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 124 event pairs, 0 based on Foata normal form. 0/80 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-08-31 22:10:27,829 INFO L119 LiptonReduction]: Number of co-enabled transitions 340 [2023-08-31 22:10:34,048 INFO L134 LiptonReduction]: Checked pairs total: 458 [2023-08-31 22:10:34,048 INFO L136 LiptonReduction]: Total number of compositions: 112 [2023-08-31 22:10:34,064 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-31 22:10:34,069 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;@4354b47b, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-31 22:10:34,069 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-08-31 22:10:34,070 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-31 22:10:34,070 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:34,070 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:34,071 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-31 22:10:34,071 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:34,074 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:34,075 INFO L85 PathProgramCache]: Analyzing trace with hash 410, now seen corresponding path program 1 times [2023-08-31 22:10:34,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:34,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [364392501] [2023-08-31 22:10:34,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:34,084 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 22:10:34,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:34,087 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 22:10:34,089 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 22:10:34,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:34,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 3 conjuncts, 1 conjunts are in the unsatisfiable core [2023-08-31 22:10:34,133 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:34,135 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 22:10:34,136 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:34,136 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:34,136 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [364392501] [2023-08-31 22:10:34,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [364392501] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:34,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:34,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-31 22:10:34,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [189733948] [2023-08-31 22:10:34,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:34,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-31 22:10:34,145 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:34,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-31 22:10:34,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-31 22:10:34,157 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 100 out of 219 [2023-08-31 22:10:34,159 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 74 flow. Second operand has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 22:10:34,159 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:34,159 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 100 of 219 [2023-08-31 22:10:34,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:34,235 INFO L130 PetriNetUnfolder]: 26/72 cut-off events. [2023-08-31 22:10:34,235 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2023-08-31 22:10:34,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 150 conditions, 72 events. 26/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 212 event pairs, 18 based on Foata normal form. 0/31 useless extension candidates. Maximal degree in co-relation 117. Up to 69 conditions per place. [2023-08-31 22:10:34,237 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 26 selfloop transitions, 0 changer transitions 0/27 dead transitions. [2023-08-31 22:10:34,237 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 27 transitions, 118 flow [2023-08-31 22:10:34,238 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-31 22:10:34,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-31 22:10:34,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 230 transitions. [2023-08-31 22:10:34,245 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5251141552511416 [2023-08-31 22:10:34,246 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 230 transitions. [2023-08-31 22:10:34,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 230 transitions. [2023-08-31 22:10:34,247 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:34,248 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 230 transitions. [2023-08-31 22:10:34,250 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 115.0) internal successors, (230), 2 states have internal predecessors, (230), 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 22:10:34,268 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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 22:10:34,268 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 219.0) internal successors, (657), 3 states have internal predecessors, (657), 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 22:10:34,269 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 74 flow. Second operand 2 states and 230 transitions. [2023-08-31 22:10:34,270 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 27 transitions, 118 flow [2023-08-31 22:10:34,271 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:10:34,272 INFO L231 Difference]: Finished difference. Result has 29 places, 27 transitions, 58 flow [2023-08-31 22:10:34,273 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=58, PETRI_PLACES=29, PETRI_TRANSITIONS=27} [2023-08-31 22:10:34,275 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -7 predicate places. [2023-08-31 22:10:34,275 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 27 transitions, 58 flow [2023-08-31 22:10:34,275 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 100.5) internal successors, (201), 2 states have internal predecessors, (201), 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 22:10:34,275 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:34,276 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:10:34,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 (2)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:34,482 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 22:10:34,482 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:34,482 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:34,482 INFO L85 PathProgramCache]: Analyzing trace with hash 403585, now seen corresponding path program 1 times [2023-08-31 22:10:34,483 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:34,483 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945326634] [2023-08-31 22:10:34,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:34,483 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 22:10:34,483 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:34,489 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 22:10:34,491 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 22:10:34,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:34,541 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 22:10:34,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:34,581 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:10:34,582 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:10:34,594 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 22:10:34,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:34,595 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:34,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945326634] [2023-08-31 22:10:34,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945326634] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:34,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:34,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:34,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402893368] [2023-08-31 22:10:34,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:34,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:34,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:34,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:34,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:34,657 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-31 22:10:34,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 27 transitions, 58 flow. Second operand has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 22:10:34,658 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:34,658 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-31 22:10:34,658 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:34,712 INFO L130 PetriNetUnfolder]: 25/69 cut-off events. [2023-08-31 22:10:34,712 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:34,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 139 conditions, 69 events. 25/69 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 202 event pairs, 17 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 136. Up to 64 conditions per place. [2023-08-31 22:10:34,713 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 23 selfloop transitions, 2 changer transitions 0/26 dead transitions. [2023-08-31 22:10:34,713 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 26 transitions, 106 flow [2023-08-31 22:10:34,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:34,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:34,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 299 transitions. [2023-08-31 22:10:34,716 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4550989345509893 [2023-08-31 22:10:34,716 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 299 transitions. [2023-08-31 22:10:34,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 299 transitions. [2023-08-31 22:10:34,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:34,717 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 299 transitions. [2023-08-31 22:10:34,718 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.66666666666667) internal successors, (299), 3 states have internal predecessors, (299), 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 22:10:34,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:34,719 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:34,720 INFO L175 Difference]: Start difference. First operand has 29 places, 27 transitions, 58 flow. Second operand 3 states and 299 transitions. [2023-08-31 22:10:34,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 26 transitions, 106 flow [2023-08-31 22:10:34,720 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-31 22:10:34,720 INFO L231 Difference]: Finished difference. Result has 30 places, 26 transitions, 60 flow [2023-08-31 22:10:34,721 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=26} [2023-08-31 22:10:34,721 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:10:34,721 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 26 transitions, 60 flow [2023-08-31 22:10:34,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 92.0) internal successors, (276), 3 states have internal predecessors, (276), 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 22:10:34,722 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:34,722 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-31 22:10:34,739 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 (3)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:34,928 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 22:10:34,929 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:34,929 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:34,929 INFO L85 PathProgramCache]: Analyzing trace with hash 403586, now seen corresponding path program 1 times [2023-08-31 22:10:34,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:34,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1735475079] [2023-08-31 22:10:34,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:34,930 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 22:10:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:34,931 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 22:10:34,933 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 22:10:34,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:34,990 INFO L263 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-31 22:10:34,991 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:35,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:35,004 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-31 22:10:35,022 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-31 22:10:35,036 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 22:10:35,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:35,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:35,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1735475079] [2023-08-31 22:10:35,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1735475079] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:35,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:35,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:35,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074691108] [2023-08-31 22:10:35,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:35,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:35,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:35,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:35,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:35,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 94 out of 219 [2023-08-31 22:10:35,109 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 26 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 22:10:35,109 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:35,109 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 94 of 219 [2023-08-31 22:10:35,109 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:35,175 INFO L130 PetriNetUnfolder]: 24/67 cut-off events. [2023-08-31 22:10:35,176 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:35,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 138 conditions, 67 events. 24/67 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 198 event pairs, 15 based on Foata normal form. 0/30 useless extension candidates. Maximal degree in co-relation 134. Up to 61 conditions per place. [2023-08-31 22:10:35,176 INFO L137 encePairwiseOnDemand]: 216/219 looper letters, 24 selfloop transitions, 2 changer transitions 0/27 dead transitions. [2023-08-31 22:10:35,176 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 27 transitions, 114 flow [2023-08-31 22:10:35,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:35,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-31 22:10:35,178 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-31 22:10:35,178 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-31 22:10:35,178 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-31 22:10:35,178 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:35,179 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-31 22:10:35,179 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 22:10:35,181 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:35,181 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:35,181 INFO L175 Difference]: Start difference. First operand has 30 places, 26 transitions, 60 flow. Second operand 3 states and 309 transitions. [2023-08-31 22:10:35,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 27 transitions, 114 flow [2023-08-31 22:10:35,181 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 27 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:35,182 INFO L231 Difference]: Finished difference. Result has 31 places, 26 transitions, 64 flow [2023-08-31 22:10:35,182 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=56, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=64, PETRI_PLACES=31, PETRI_TRANSITIONS=26} [2023-08-31 22:10:35,182 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -5 predicate places. [2023-08-31 22:10:35,183 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 26 transitions, 64 flow [2023-08-31 22:10:35,183 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 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 22:10:35,183 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:35,183 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-31 22:10:35,193 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 22:10:35,389 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 22:10:35,390 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:35,390 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:35,390 INFO L85 PathProgramCache]: Analyzing trace with hash 12512186, now seen corresponding path program 1 times [2023-08-31 22:10:35,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:35,391 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2103780143] [2023-08-31 22:10:35,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:35,391 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 22:10:35,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:35,392 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 22:10:35,394 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 22:10:35,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:35,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 61 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-31 22:10:35,469 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:35,489 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:35,491 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 11 [2023-08-31 22:10:35,495 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2023-08-31 22:10:35,528 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:35,528 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:10:35,563 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 22:10:35,564 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:35,564 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:35,564 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2103780143] [2023-08-31 22:10:35,564 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2103780143] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:35,564 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:35,564 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:10:35,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2064877895] [2023-08-31 22:10:35,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:35,565 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:35,565 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:35,566 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:35,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:35,805 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-31 22:10:35,806 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 26 transitions, 64 flow. Second operand has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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 22:10:35,806 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:35,806 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-31 22:10:35,806 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:35,924 INFO L130 PetriNetUnfolder]: 24/66 cut-off events. [2023-08-31 22:10:35,924 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:10:35,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 140 conditions, 66 events. 24/66 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 194 event pairs, 15 based on Foata normal form. 1/30 useless extension candidates. Maximal degree in co-relation 135. Up to 58 conditions per place. [2023-08-31 22:10:35,924 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 3 changer transitions 0/26 dead transitions. [2023-08-31 22:10:35,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 33 places, 26 transitions, 112 flow [2023-08-31 22:10:35,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:35,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:35,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 394 transitions. [2023-08-31 22:10:35,926 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4497716894977169 [2023-08-31 22:10:35,926 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 394 transitions. [2023-08-31 22:10:35,926 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 394 transitions. [2023-08-31 22:10:35,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:35,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 394 transitions. [2023-08-31 22:10:35,928 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 98.5) internal successors, (394), 4 states have internal predecessors, (394), 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 22:10:35,929 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:35,930 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:35,930 INFO L175 Difference]: Start difference. First operand has 31 places, 26 transitions, 64 flow. Second operand 4 states and 394 transitions. [2023-08-31 22:10:35,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 33 places, 26 transitions, 112 flow [2023-08-31 22:10:35,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 26 transitions, 106 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:35,931 INFO L231 Difference]: Finished difference. Result has 30 places, 25 transitions, 60 flow [2023-08-31 22:10:35,931 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=54, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=60, PETRI_PLACES=30, PETRI_TRANSITIONS=25} [2023-08-31 22:10:35,931 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:10:35,932 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 25 transitions, 60 flow [2023-08-31 22:10:35,932 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.0) internal successors, (372), 4 states have internal predecessors, (372), 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 22:10:35,932 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:35,932 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:10:35,952 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 22:10:36,139 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 22:10:36,139 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:36,139 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash -861376330, now seen corresponding path program 1 times [2023-08-31 22:10:36,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1460659468] [2023-08-31 22:10:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:36,141 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 22:10:36,141 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:36,144 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 22:10:36,146 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 22:10:36,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:36,192 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-31 22:10:36,192 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:36,204 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:36,205 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-31 22:10:36,229 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-31 22:10:36,230 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2023-08-31 22:10:36,239 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 22:10:36,239 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:36,239 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:36,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1460659468] [2023-08-31 22:10:36,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1460659468] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:36,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:36,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-31 22:10:36,240 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197911558] [2023-08-31 22:10:36,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:36,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:10:36,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:36,241 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:10:36,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:10:36,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-31 22:10:36,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 25 transitions, 60 flow. Second operand has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 22:10:36,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:36,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-31 22:10:36,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:36,353 INFO L130 PetriNetUnfolder]: 17/51 cut-off events. [2023-08-31 22:10:36,353 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:10:36,353 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 51 events. 17/51 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 134 event pairs, 11 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 105. Up to 47 conditions per place. [2023-08-31 22:10:36,354 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 20 selfloop transitions, 2 changer transitions 0/23 dead transitions. [2023-08-31 22:10:36,354 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 30 places, 23 transitions, 100 flow [2023-08-31 22:10:36,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:36,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:36,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-08-31 22:10:36,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-31 22:10:36,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-08-31 22:10:36,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-08-31 22:10:36,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:36,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-08-31 22:10:36,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 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 22:10:36,357 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:36,357 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:36,357 INFO L175 Difference]: Start difference. First operand has 30 places, 25 transitions, 60 flow. Second operand 3 states and 297 transitions. [2023-08-31 22:10:36,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 30 places, 23 transitions, 100 flow [2023-08-31 22:10:36,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 27 places, 23 transitions, 94 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:36,366 INFO L231 Difference]: Finished difference. Result has 27 places, 23 transitions, 54 flow [2023-08-31 22:10:36,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=50, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=54, PETRI_PLACES=27, PETRI_TRANSITIONS=23} [2023-08-31 22:10:36,367 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:10:36,367 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 23 transitions, 54 flow [2023-08-31 22:10:36,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.0) internal successors, (279), 3 states have internal predecessors, (279), 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 22:10:36,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:36,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-08-31 22:10:36,389 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 (6)] Ended with exit code 0 [2023-08-31 22:10:36,575 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 22:10:36,577 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:36,579 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:36,579 INFO L85 PathProgramCache]: Analyzing trace with hash -861376329, now seen corresponding path program 1 times [2023-08-31 22:10:36,579 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:36,579 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1609406852] [2023-08-31 22:10:36,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:36,580 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 22:10:36,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:36,581 INFO L229 MonitoredProcess]: Starting monitored process 7 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 22:10:36,582 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 (7)] Waiting until timeout for monitored process [2023-08-31 22:10:36,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:36,661 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:10:36,664 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:36,689 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:36,690 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 19 [2023-08-31 22:10:36,704 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:10:36,705 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:10:36,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:36,753 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 22:10:36,761 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-08-31 22:10:36,761 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-08-31 22:10:36,782 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 22:10:36,783 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:36,783 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:36,783 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1609406852] [2023-08-31 22:10:36,787 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1609406852] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:36,787 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:36,787 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-31 22:10:36,787 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250335584] [2023-08-31 22:10:36,787 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:36,788 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:36,789 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:36,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:36,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:36,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-31 22:10:36,929 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 23 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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 22:10:36,929 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:36,929 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-31 22:10:36,930 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:36,988 INFO L130 PetriNetUnfolder]: 10/36 cut-off events. [2023-08-31 22:10:36,988 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:36,989 INFO L83 FinitePrefix]: Finished finitePrefix Result has 78 conditions, 36 events. 10/36 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 66 event pairs, 6 based on Foata normal form. 0/24 useless extension candidates. Maximal degree in co-relation 74. Up to 33 conditions per place. [2023-08-31 22:10:36,989 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 18 selfloop transitions, 2 changer transitions 0/21 dead transitions. [2023-08-31 22:10:36,989 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 21 transitions, 90 flow [2023-08-31 22:10:36,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:10:36,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:10:36,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2023-08-31 22:10:36,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4353120243531202 [2023-08-31 22:10:36,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 286 transitions. [2023-08-31 22:10:36,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 286 transitions. [2023-08-31 22:10:36,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:36,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 286 transitions. [2023-08-31 22:10:36,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 95.33333333333333) internal successors, (286), 3 states have internal predecessors, (286), 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 22:10:36,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:36,992 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:10:36,992 INFO L175 Difference]: Start difference. First operand has 27 places, 23 transitions, 54 flow. Second operand 3 states and 286 transitions. [2023-08-31 22:10:36,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 21 transitions, 90 flow [2023-08-31 22:10:36,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 21 transitions, 86 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:36,993 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 50 flow [2023-08-31 22:10:36,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=46, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=21, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=50, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:10:36,994 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:10:36,994 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 50 flow [2023-08-31 22:10:36,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 89.5) internal successors, (358), 4 states have internal predecessors, (358), 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 22:10:36,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:36,995 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:37,002 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 (7)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:37,202 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /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 22:10:37,203 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:37,203 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:37,203 INFO L85 PathProgramCache]: Analyzing trace with hash 305735059, now seen corresponding path program 1 times [2023-08-31 22:10:37,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:37,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [991922030] [2023-08-31 22:10:37,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:37,204 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 22:10:37,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:37,206 INFO L229 MonitoredProcess]: Starting monitored process 8 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 22:10:37,208 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 (8)] Waiting until timeout for monitored process [2023-08-31 22:10:37,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:37,279 INFO L263 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:10:37,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:37,312 INFO L321 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2023-08-31 22:10:37,312 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 4 case distinctions, treesize of input 22 treesize of output 42 [2023-08-31 22:10:37,340 INFO L321 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-08-31 22:10:37,340 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 28 [2023-08-31 22:10:37,422 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 22:10:37,422 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:37,422 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:37,422 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [991922030] [2023-08-31 22:10:37,422 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [991922030] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:37,422 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:37,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:10:37,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1577412531] [2023-08-31 22:10:37,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:37,423 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:10:37,423 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:37,423 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:10:37,424 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:10:37,566 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 219 [2023-08-31 22:10:37,567 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 50 flow. Second operand has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 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 22:10:37,567 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:37,567 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 219 [2023-08-31 22:10:37,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:37,646 INFO L130 PetriNetUnfolder]: 10/40 cut-off events. [2023-08-31 22:10:37,646 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-31 22:10:37,646 INFO L83 FinitePrefix]: Finished finitePrefix Result has 89 conditions, 40 events. 10/40 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 87 event pairs, 2 based on Foata normal form. 0/26 useless extension candidates. Maximal degree in co-relation 85. Up to 21 conditions per place. [2023-08-31 22:10:37,646 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 22 selfloop transitions, 4 changer transitions 0/26 dead transitions. [2023-08-31 22:10:37,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 26 transitions, 115 flow [2023-08-31 22:10:37,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:37,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:37,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 343 transitions. [2023-08-31 22:10:37,648 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3915525114155251 [2023-08-31 22:10:37,648 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 343 transitions. [2023-08-31 22:10:37,648 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 343 transitions. [2023-08-31 22:10:37,648 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:37,648 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 343 transitions. [2023-08-31 22:10:37,649 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 85.75) internal successors, (343), 4 states have internal predecessors, (343), 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 22:10:37,649 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:37,650 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:37,650 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 50 flow. Second operand 4 states and 343 transitions. [2023-08-31 22:10:37,650 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 26 transitions, 115 flow [2023-08-31 22:10:37,650 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 25 places, 26 transitions, 109 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:37,650 INFO L231 Difference]: Finished difference. Result has 25 places, 21 transitions, 54 flow [2023-08-31 22:10:37,650 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=44, PETRI_DIFFERENCE_MINUEND_PLACES=22, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=54, PETRI_PLACES=25, PETRI_TRANSITIONS=21} [2023-08-31 22:10:37,651 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -11 predicate places. [2023-08-31 22:10:37,651 INFO L495 AbstractCegarLoop]: Abstraction has has 25 places, 21 transitions, 54 flow [2023-08-31 22:10:37,651 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.5) internal successors, (483), 6 states have internal predecessors, (483), 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 22:10:37,651 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:37,651 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:37,658 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 (8)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:37,857 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /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 22:10:37,857 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:37,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:37,857 INFO L85 PathProgramCache]: Analyzing trace with hash 305735143, now seen corresponding path program 1 times [2023-08-31 22:10:37,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:37,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1902882027] [2023-08-31 22:10:37,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:37,858 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 22:10:37,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:37,859 INFO L229 MonitoredProcess]: Starting monitored process 9 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 22:10:37,863 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 (9)] Waiting until timeout for monitored process [2023-08-31 22:10:37,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:37,914 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-31 22:10:37,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:37,918 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:10:37,950 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 22:10:37,950 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:37,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:37,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1902882027] [2023-08-31 22:10:37,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1902882027] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:37,950 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:37,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:37,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [304468124] [2023-08-31 22:10:37,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:37,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:37,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:37,951 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:37,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:38,050 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-31 22:10:38,051 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 25 places, 21 transitions, 54 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 22:10:38,051 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:38,051 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-31 22:10:38,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:38,132 INFO L130 PetriNetUnfolder]: 14/54 cut-off events. [2023-08-31 22:10:38,132 INFO L131 PetriNetUnfolder]: For 1/1 co-relation queries the response was YES. [2023-08-31 22:10:38,132 INFO L83 FinitePrefix]: Finished finitePrefix Result has 120 conditions, 54 events. 14/54 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 147 event pairs, 6 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 116. Up to 35 conditions per place. [2023-08-31 22:10:38,132 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 27 selfloop transitions, 3 changer transitions 0/30 dead transitions. [2023-08-31 22:10:38,132 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 27 places, 30 transitions, 135 flow [2023-08-31 22:10:38,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:38,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:38,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 396 transitions. [2023-08-31 22:10:38,134 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4520547945205479 [2023-08-31 22:10:38,134 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 396 transitions. [2023-08-31 22:10:38,134 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 396 transitions. [2023-08-31 22:10:38,134 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:38,134 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 396 transitions. [2023-08-31 22:10:38,135 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 99.0) internal successors, (396), 4 states have internal predecessors, (396), 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 22:10:38,136 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:38,136 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:38,136 INFO L175 Difference]: Start difference. First operand has 25 places, 21 transitions, 54 flow. Second operand 4 states and 396 transitions. [2023-08-31 22:10:38,136 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 27 places, 30 transitions, 135 flow [2023-08-31 22:10:38,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 30 transitions, 131 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:10:38,137 INFO L231 Difference]: Finished difference. Result has 27 places, 21 transitions, 63 flow [2023-08-31 22:10:38,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=49, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=27, PETRI_TRANSITIONS=21} [2023-08-31 22:10:38,137 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -9 predicate places. [2023-08-31 22:10:38,137 INFO L495 AbstractCegarLoop]: Abstraction has has 27 places, 21 transitions, 63 flow [2023-08-31 22:10:38,137 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 22:10:38,137 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:38,137 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:38,145 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 (9)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:38,344 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /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 22:10:38,344 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:38,345 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:38,345 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582902, now seen corresponding path program 1 times [2023-08-31 22:10:38,345 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:38,345 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [11195363] [2023-08-31 22:10:38,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:38,345 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 22:10:38,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:38,346 INFO L229 MonitoredProcess]: Starting monitored process 10 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 22:10:38,348 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 (10)] Waiting until timeout for monitored process [2023-08-31 22:10:38,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:38,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-31 22:10:38,397 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:38,400 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-08-31 22:10:38,412 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 22:10:38,412 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:38,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:38,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [11195363] [2023-08-31 22:10:38,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [11195363] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:38,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:38,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:38,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [931600038] [2023-08-31 22:10:38,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:38,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-31 22:10:38,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:38,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-31 22:10:38,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-31 22:10:38,520 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-31 22:10:38,521 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 27 places, 21 transitions, 63 flow. Second operand has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 22:10:38,521 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:38,521 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-31 22:10:38,521 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:38,581 INFO L130 PetriNetUnfolder]: 12/45 cut-off events. [2023-08-31 22:10:38,581 INFO L131 PetriNetUnfolder]: For 10/10 co-relation queries the response was YES. [2023-08-31 22:10:38,581 INFO L83 FinitePrefix]: Finished finitePrefix Result has 112 conditions, 45 events. 12/45 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 112 event pairs, 1 based on Foata normal form. 0/39 useless extension candidates. Maximal degree in co-relation 107. Up to 27 conditions per place. [2023-08-31 22:10:38,581 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 19 selfloop transitions, 4 changer transitions 0/23 dead transitions. [2023-08-31 22:10:38,581 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 28 places, 23 transitions, 114 flow [2023-08-31 22:10:38,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:10:38,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:10:38,583 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 389 transitions. [2023-08-31 22:10:38,583 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4440639269406393 [2023-08-31 22:10:38,583 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 389 transitions. [2023-08-31 22:10:38,583 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 389 transitions. [2023-08-31 22:10:38,583 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:38,583 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 389 transitions. [2023-08-31 22:10:38,584 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 97.25) internal successors, (389), 4 states have internal predecessors, (389), 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 22:10:38,585 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:38,585 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:10:38,585 INFO L175 Difference]: Start difference. First operand has 27 places, 21 transitions, 63 flow. Second operand 4 states and 389 transitions. [2023-08-31 22:10:38,585 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 28 places, 23 transitions, 114 flow [2023-08-31 22:10:38,585 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 26 places, 23 transitions, 110 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-31 22:10:38,585 INFO L231 Difference]: Finished difference. Result has 26 places, 19 transitions, 63 flow [2023-08-31 22:10:38,586 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=63, PETRI_PLACES=26, PETRI_TRANSITIONS=19} [2023-08-31 22:10:38,586 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -10 predicate places. [2023-08-31 22:10:38,586 INFO L495 AbstractCegarLoop]: Abstraction has has 26 places, 19 transitions, 63 flow [2023-08-31 22:10:38,586 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 93.25) internal successors, (373), 4 states have internal predecessors, (373), 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 22:10:38,586 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:38,586 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:38,595 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 (10)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:38,795 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /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 22:10:38,796 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:38,796 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:38,796 INFO L85 PathProgramCache]: Analyzing trace with hash 1167582855, now seen corresponding path program 1 times [2023-08-31 22:10:38,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:38,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1270694548] [2023-08-31 22:10:38,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:38,797 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 22:10:38,797 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:38,798 INFO L229 MonitoredProcess]: Starting monitored process 11 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 22:10:38,799 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 (11)] Waiting until timeout for monitored process [2023-08-31 22:10:38,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:38,855 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 22:10:38,856 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:38,901 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-31 22:10:38,901 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 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-31 22:10:38,938 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-31 22:10:38,938 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-31 22:10:39,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:39,055 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-31 22:10:39,055 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-31 22:10:39,092 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-31 22:10:39,092 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-31 22:10:39,253 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 22:10:39,254 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:10:39,254 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:39,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1270694548] [2023-08-31 22:10:39,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1270694548] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:10:39,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:10:39,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:10:39,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [418636587] [2023-08-31 22:10:39,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:10:39,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:10:39,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:39,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:10:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:10:39,658 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 91 out of 219 [2023-08-31 22:10:39,658 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 26 places, 19 transitions, 63 flow. Second operand has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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 22:10:39,659 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:39,659 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 91 of 219 [2023-08-31 22:10:39,659 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:39,849 INFO L130 PetriNetUnfolder]: 11/42 cut-off events. [2023-08-31 22:10:39,849 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-31 22:10:39,849 INFO L83 FinitePrefix]: Finished finitePrefix Result has 109 conditions, 42 events. 11/42 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 100 event pairs, 5 based on Foata normal form. 0/38 useless extension candidates. Maximal degree in co-relation 104. Up to 28 conditions per place. [2023-08-31 22:10:39,849 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 18 selfloop transitions, 7 changer transitions 0/25 dead transitions. [2023-08-31 22:10:39,849 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 32 places, 25 transitions, 129 flow [2023-08-31 22:10:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:10:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:10:39,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 662 transitions. [2023-08-31 22:10:39,852 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4318330071754729 [2023-08-31 22:10:39,852 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 662 transitions. [2023-08-31 22:10:39,852 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 662 transitions. [2023-08-31 22:10:39,852 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:39,852 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 662 transitions. [2023-08-31 22:10:39,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.57142857142857) internal successors, (662), 7 states have internal predecessors, (662), 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 22:10:39,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 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 22:10:39,855 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 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 22:10:39,855 INFO L175 Difference]: Start difference. First operand has 26 places, 19 transitions, 63 flow. Second operand 7 states and 662 transitions. [2023-08-31 22:10:39,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 32 places, 25 transitions, 129 flow [2023-08-31 22:10:39,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 29 places, 25 transitions, 119 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:39,855 INFO L231 Difference]: Finished difference. Result has 30 places, 20 transitions, 77 flow [2023-08-31 22:10:39,856 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=55, PETRI_DIFFERENCE_MINUEND_PLACES=23, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=19, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=13, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=77, PETRI_PLACES=30, PETRI_TRANSITIONS=20} [2023-08-31 22:10:39,856 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, -6 predicate places. [2023-08-31 22:10:39,856 INFO L495 AbstractCegarLoop]: Abstraction has has 30 places, 20 transitions, 77 flow [2023-08-31 22:10:39,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 92.8) internal successors, (464), 5 states have internal predecessors, (464), 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 22:10:39,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:39,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:39,866 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 (11)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:40,065 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /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 22:10:40,065 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:40,066 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:40,066 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333102, now seen corresponding path program 1 times [2023-08-31 22:10:40,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:40,066 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1200555876] [2023-08-31 22:10:40,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:40,066 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 22:10:40,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:40,067 INFO L229 MonitoredProcess]: Starting monitored process 12 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 22:10:40,069 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 (12)] Waiting until timeout for monitored process [2023-08-31 22:10:40,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:40,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-31 22:10:40,151 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:40,157 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:10:40,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:40,198 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:40,261 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:40,261 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:40,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1200555876] [2023-08-31 22:10:40,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1200555876] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:40,261 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:10:40,262 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-08-31 22:10:40,262 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799787316] [2023-08-31 22:10:40,262 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:40,262 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-08-31 22:10:40,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:40,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-08-31 22:10:40,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-08-31 22:10:40,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 88 out of 219 [2023-08-31 22:10:40,783 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 30 places, 20 transitions, 77 flow. Second operand has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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 22:10:40,783 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:10:40,783 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 88 of 219 [2023-08-31 22:10:40,783 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:10:40,977 INFO L130 PetriNetUnfolder]: 20/74 cut-off events. [2023-08-31 22:10:40,977 INFO L131 PetriNetUnfolder]: For 24/24 co-relation queries the response was YES. [2023-08-31 22:10:40,977 INFO L83 FinitePrefix]: Finished finitePrefix Result has 197 conditions, 74 events. 20/74 cut-off events. For 24/24 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 243 event pairs, 4 based on Foata normal form. 0/72 useless extension candidates. Maximal degree in co-relation 191. Up to 24 conditions per place. [2023-08-31 22:10:40,978 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 38 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-31 22:10:40,978 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 45 transitions, 239 flow [2023-08-31 22:10:40,979 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-31 22:10:40,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-31 22:10:40,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 664 transitions. [2023-08-31 22:10:40,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43313763861709065 [2023-08-31 22:10:40,980 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 664 transitions. [2023-08-31 22:10:40,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 664 transitions. [2023-08-31 22:10:40,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:10:40,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 664 transitions. [2023-08-31 22:10:40,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 94.85714285714286) internal successors, (664), 7 states have internal predecessors, (664), 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 22:10:40,983 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 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 22:10:40,983 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 219.0) internal successors, (1752), 8 states have internal predecessors, (1752), 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 22:10:40,983 INFO L175 Difference]: Start difference. First operand has 30 places, 20 transitions, 77 flow. Second operand 7 states and 664 transitions. [2023-08-31 22:10:40,983 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 45 transitions, 239 flow [2023-08-31 22:10:40,984 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 33 places, 45 transitions, 234 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:10:40,984 INFO L231 Difference]: Finished difference. Result has 37 places, 24 transitions, 121 flow [2023-08-31 22:10:40,984 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=27, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=20, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=121, PETRI_PLACES=37, PETRI_TRANSITIONS=24} [2023-08-31 22:10:40,986 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 1 predicate places. [2023-08-31 22:10:40,986 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 24 transitions, 121 flow [2023-08-31 22:10:40,986 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 90.125) internal successors, (721), 8 states have internal predecessors, (721), 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 22:10:40,987 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:10:40,987 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:10:40,996 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 (12)] Forceful destruction successful, exit code 0 [2023-08-31 22:10:41,194 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /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 22:10:41,194 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:10:41,194 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:10:41,194 INFO L85 PathProgramCache]: Analyzing trace with hash 1835333054, now seen corresponding path program 1 times [2023-08-31 22:10:41,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:10:41,194 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1247169543] [2023-08-31 22:10:41,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:10:41,195 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 22:10:41,195 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:10:41,196 INFO L229 MonitoredProcess]: Starting monitored process 13 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 22:10:41,198 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 (13)] Waiting until timeout for monitored process [2023-08-31 22:10:41,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:10:41,263 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-31 22:10:41,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:10:41,308 INFO L321 Elim1Store]: treesize reduction 52, result has 30.7 percent of original size [2023-08-31 22:10:41,308 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 4 case distinctions, treesize of input 22 treesize of output 38 [2023-08-31 22:10:41,334 INFO L321 Elim1Store]: treesize reduction 20, result has 48.7 percent of original size [2023-08-31 22:10:41,334 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 2 case distinctions, treesize of input 15 treesize of output 27 [2023-08-31 22:10:41,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:10:41,425 INFO L321 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2023-08-31 22:10:41,426 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 38 [2023-08-31 22:10:41,451 INFO L321 Elim1Store]: treesize reduction 6, result has 80.6 percent of original size [2023-08-31 22:10:41,451 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 53 [2023-08-31 22:10:41,644 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:41,645 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:10:41,750 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:10:41,750 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:10:41,750 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1247169543] [2023-08-31 22:10:41,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1247169543] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:10:41,750 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:10:41,750 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-08-31 22:10:41,750 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1195248671] [2023-08-31 22:10:41,750 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:10:41,751 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-08-31 22:10:41,751 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:10:41,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-08-31 22:10:41,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-08-31 22:10:43,836 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:45,863 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:47,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:50,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:52,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:55,053 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:57,071 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:10:59,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:01,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:03,286 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:05,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:07,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:09,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:11,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:13,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:15,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:15,780 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 65 out of 219 [2023-08-31 22:11:15,781 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 24 transitions, 121 flow. Second operand has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 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 22:11:15,781 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:15,781 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 65 of 219 [2023-08-31 22:11:15,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:16,409 INFO L130 PetriNetUnfolder]: 17/65 cut-off events. [2023-08-31 22:11:16,410 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-31 22:11:16,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 214 conditions, 65 events. 17/65 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 187 event pairs, 3 based on Foata normal form. 6/71 useless extension candidates. Maximal degree in co-relation 204. Up to 20 conditions per place. [2023-08-31 22:11:16,410 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 28 selfloop transitions, 14 changer transitions 0/42 dead transitions. [2023-08-31 22:11:16,410 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 42 transitions, 257 flow [2023-08-31 22:11:16,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-08-31 22:11:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-08-31 22:11:16,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 890 transitions. [2023-08-31 22:11:16,413 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3126097646645592 [2023-08-31 22:11:16,413 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 890 transitions. [2023-08-31 22:11:16,413 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 890 transitions. [2023-08-31 22:11:16,413 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:16,413 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 890 transitions. [2023-08-31 22:11:16,415 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 68.46153846153847) internal successors, (890), 13 states have internal predecessors, (890), 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 22:11:16,425 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 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 22:11:16,426 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 219.0) internal successors, (3066), 14 states have internal predecessors, (3066), 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 22:11:16,426 INFO L175 Difference]: Start difference. First operand has 37 places, 24 transitions, 121 flow. Second operand 13 states and 890 transitions. [2023-08-31 22:11:16,426 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 42 transitions, 257 flow [2023-08-31 22:11:16,430 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 42 transitions, 248 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-08-31 22:11:16,431 INFO L231 Difference]: Finished difference. Result has 50 places, 26 transitions, 167 flow [2023-08-31 22:11:16,432 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=167, PETRI_PLACES=50, PETRI_TRANSITIONS=26} [2023-08-31 22:11:16,433 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 14 predicate places. [2023-08-31 22:11:16,433 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 26 transitions, 167 flow [2023-08-31 22:11:16,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 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 22:11:16,433 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:16,434 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:16,450 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 (13)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:16,640 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /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 22:11:16,641 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:16,641 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:16,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1060197226, now seen corresponding path program 1 times [2023-08-31 22:11:16,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:16,642 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [321479736] [2023-08-31 22:11:16,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:16,642 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 22:11:16,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:16,643 INFO L229 MonitoredProcess]: Starting monitored process 14 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 22:11:16,645 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 (14)] Waiting until timeout for monitored process [2023-08-31 22:11:16,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:16,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-31 22:11:16,703 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:16,711 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 22:11:16,711 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:16,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:16,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [321479736] [2023-08-31 22:11:16,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [321479736] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:16,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:16,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:11:16,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261104287] [2023-08-31 22:11:16,711 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:16,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-31 22:11:16,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:16,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-31 22:11:16,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-31 22:11:16,727 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 219 [2023-08-31 22:11:16,727 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 26 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:11:16,727 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:16,727 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 219 [2023-08-31 22:11:16,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:16,773 INFO L130 PetriNetUnfolder]: 16/59 cut-off events. [2023-08-31 22:11:16,773 INFO L131 PetriNetUnfolder]: For 70/70 co-relation queries the response was YES. [2023-08-31 22:11:16,773 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 59 events. 16/59 cut-off events. For 70/70 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 146 event pairs, 11 based on Foata normal form. 2/61 useless extension candidates. Maximal degree in co-relation 219. Up to 56 conditions per place. [2023-08-31 22:11:16,774 INFO L137 encePairwiseOnDemand]: 217/219 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-31 22:11:16,774 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 25 transitions, 210 flow [2023-08-31 22:11:16,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-31 22:11:16,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-31 22:11:16,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2023-08-31 22:11:16,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703196347031963 [2023-08-31 22:11:16,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 309 transitions. [2023-08-31 22:11:16,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 309 transitions. [2023-08-31 22:11:16,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:16,775 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 309 transitions. [2023-08-31 22:11:16,775 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 103.0) internal successors, (309), 3 states have internal predecessors, (309), 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 22:11:16,776 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:11:16,776 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 219.0) internal successors, (876), 4 states have internal predecessors, (876), 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 22:11:16,776 INFO L175 Difference]: Start difference. First operand has 50 places, 26 transitions, 167 flow. Second operand 3 states and 309 transitions. [2023-08-31 22:11:16,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 25 transitions, 210 flow [2023-08-31 22:11:16,777 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 25 transitions, 174 flow, removed 3 selfloop flow, removed 11 redundant places. [2023-08-31 22:11:16,777 INFO L231 Difference]: Finished difference. Result has 40 places, 24 transitions, 124 flow [2023-08-31 22:11:16,777 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=24, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=23, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=40, PETRI_TRANSITIONS=24} [2023-08-31 22:11:16,778 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 4 predicate places. [2023-08-31 22:11:16,778 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 24 transitions, 124 flow [2023-08-31 22:11:16,778 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 100.66666666666667) internal successors, (302), 3 states have internal predecessors, (302), 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 22:11:16,778 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:16,778 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:16,799 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 (14)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:16,986 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /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 22:11:16,987 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:16,987 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:16,987 INFO L85 PathProgramCache]: Analyzing trace with hash -1493255456, now seen corresponding path program 1 times [2023-08-31 22:11:16,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:16,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1982924985] [2023-08-31 22:11:16,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:16,988 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 22:11:16,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:16,990 INFO L229 MonitoredProcess]: Starting monitored process 15 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 22:11:16,991 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 (15)] Waiting until timeout for monitored process [2023-08-31 22:11:17,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:17,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2023-08-31 22:11:17,047 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:17,078 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2023-08-31 22:11:17,090 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 22:11:17,090 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:17,090 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:17,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1982924985] [2023-08-31 22:11:17,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1982924985] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:17,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:17,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-31 22:11:17,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1376982108] [2023-08-31 22:11:17,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:17,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:11:17,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:17,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:11:17,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:11:17,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 92 out of 219 [2023-08-31 22:11:17,199 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 24 transitions, 124 flow. Second operand has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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 22:11:17,199 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:17,199 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 92 of 219 [2023-08-31 22:11:17,199 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:17,272 INFO L130 PetriNetUnfolder]: 16/58 cut-off events. [2023-08-31 22:11:17,272 INFO L131 PetriNetUnfolder]: For 30/30 co-relation queries the response was YES. [2023-08-31 22:11:17,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 199 conditions, 58 events. 16/58 cut-off events. For 30/30 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 149 event pairs, 10 based on Foata normal form. 1/59 useless extension candidates. Maximal degree in co-relation 189. Up to 50 conditions per place. [2023-08-31 22:11:17,273 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 4 changer transitions 0/28 dead transitions. [2023-08-31 22:11:17,273 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 28 transitions, 187 flow [2023-08-31 22:11:17,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:11:17,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:11:17,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-31 22:11:17,274 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-31 22:11:17,274 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-31 22:11:17,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-31 22:11:17,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:17,274 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-31 22:11:17,275 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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 22:11:17,276 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 22:11:17,276 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 22:11:17,276 INFO L175 Difference]: Start difference. First operand has 40 places, 24 transitions, 124 flow. Second operand 5 states and 483 transitions. [2023-08-31 22:11:17,276 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 28 transitions, 187 flow [2023-08-31 22:11:17,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 28 transitions, 186 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-31 22:11:17,277 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 134 flow [2023-08-31 22:11:17,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-31 22:11:17,278 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:11:17,278 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 134 flow [2023-08-31 22:11:17,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 94.4) internal successors, (472), 5 states have internal predecessors, (472), 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 22:11:17,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:17,278 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:17,288 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 (15)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:17,478 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /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 22:11:17,478 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:17,479 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:17,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1485378134, now seen corresponding path program 1 times [2023-08-31 22:11:17,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:17,479 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [842944164] [2023-08-31 22:11:17,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:17,479 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 22:11:17,479 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:17,480 INFO L229 MonitoredProcess]: Starting monitored process 16 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 22:11:17,482 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 (16)] Waiting until timeout for monitored process [2023-08-31 22:11:17,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:17,558 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 15 conjunts are in the unsatisfiable core [2023-08-31 22:11:17,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:17,582 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:17,584 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:17,595 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-31 22:11:17,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-08-31 22:11:17,632 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:17,670 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 22:11:17,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:17,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:17,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [842944164] [2023-08-31 22:11:17,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [842944164] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:17,671 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:17,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-31 22:11:17,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493162423] [2023-08-31 22:11:17,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:17,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-31 22:11:17,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:17,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-31 22:11:17,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-31 22:11:17,862 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 219 [2023-08-31 22:11:17,863 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 134 flow. Second operand has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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 22:11:17,863 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:17,863 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 219 [2023-08-31 22:11:17,863 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:17,952 INFO L130 PetriNetUnfolder]: 15/53 cut-off events. [2023-08-31 22:11:17,952 INFO L131 PetriNetUnfolder]: For 47/47 co-relation queries the response was YES. [2023-08-31 22:11:17,952 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 53 events. 15/53 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 110 event pairs, 2 based on Foata normal form. 2/55 useless extension candidates. Maximal degree in co-relation 190. Up to 38 conditions per place. [2023-08-31 22:11:17,953 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 5 changer transitions 0/26 dead transitions. [2023-08-31 22:11:17,953 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 26 transitions, 189 flow [2023-08-31 22:11:17,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-31 22:11:17,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-31 22:11:17,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 378 transitions. [2023-08-31 22:11:17,954 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4315068493150685 [2023-08-31 22:11:17,954 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 378 transitions. [2023-08-31 22:11:17,954 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 378 transitions. [2023-08-31 22:11:17,954 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:17,954 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 378 transitions. [2023-08-31 22:11:17,955 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 94.5) internal successors, (378), 4 states have internal predecessors, (378), 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 22:11:17,956 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:11:17,956 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 219.0) internal successors, (1095), 5 states have internal predecessors, (1095), 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 22:11:17,956 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 134 flow. Second operand 4 states and 378 transitions. [2023-08-31 22:11:17,956 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 26 transitions, 189 flow [2023-08-31 22:11:17,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 26 transitions, 181 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:17,957 INFO L231 Difference]: Finished difference. Result has 42 places, 24 transitions, 142 flow [2023-08-31 22:11:17,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=119, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=23, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=142, PETRI_PLACES=42, PETRI_TRANSITIONS=24} [2023-08-31 22:11:17,957 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 6 predicate places. [2023-08-31 22:11:17,957 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 24 transitions, 142 flow [2023-08-31 22:11:17,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 91.0) internal successors, (546), 6 states have internal predecessors, (546), 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 22:11:17,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:17,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:17,966 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 (16)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:18,158 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /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 22:11:18,158 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:18,159 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:18,159 INFO L85 PathProgramCache]: Analyzing trace with hash 1197721165, now seen corresponding path program 1 times [2023-08-31 22:11:18,159 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:18,159 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197857419] [2023-08-31 22:11:18,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:18,159 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 22:11:18,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:18,180 INFO L229 MonitoredProcess]: Starting monitored process 17 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 22:11:18,181 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 (17)] Waiting until timeout for monitored process [2023-08-31 22:11:18,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:18,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 20 conjunts are in the unsatisfiable core [2023-08-31 22:11:18,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:18,351 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:18,353 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:18,358 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:18,416 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:11:18,416 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:11:18,454 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:18,508 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:18,528 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:18,529 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:20,710 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:20,710 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:20,710 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197857419] [2023-08-31 22:11:20,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197857419] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:20,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:20,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 11 [2023-08-31 22:11:20,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [828863124] [2023-08-31 22:11:20,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:20,711 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-08-31 22:11:20,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:20,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-08-31 22:11:20,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=95, Unknown=9, NotChecked=0, Total=132 [2023-08-31 22:11:22,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:11:25,058 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:27,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:29,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:31,203 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:33,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:33,316 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-31 22:11:33,317 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 24 transitions, 142 flow. Second operand has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 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 22:11:33,317 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:33,317 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-31 22:11:33,317 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:35,665 INFO L130 PetriNetUnfolder]: 14/47 cut-off events. [2023-08-31 22:11:35,665 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-31 22:11:35,665 INFO L83 FinitePrefix]: Finished finitePrefix Result has 191 conditions, 47 events. 14/47 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 79 event pairs, 2 based on Foata normal form. 2/49 useless extension candidates. Maximal degree in co-relation 179. Up to 15 conditions per place. [2023-08-31 22:11:35,665 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 19 selfloop transitions, 8 changer transitions 0/27 dead transitions. [2023-08-31 22:11:35,665 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 27 transitions, 197 flow [2023-08-31 22:11:35,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-31 22:11:35,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-31 22:11:35,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-08-31 22:11:35,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20624048706240486 [2023-08-31 22:11:35,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-08-31 22:11:35,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-08-31 22:11:35,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:35,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-08-31 22:11:35,668 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 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 22:11:35,669 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 22:11:35,669 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 219.0) internal successors, (1533), 7 states have internal predecessors, (1533), 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 22:11:35,669 INFO L175 Difference]: Start difference. First operand has 42 places, 24 transitions, 142 flow. Second operand 6 states and 271 transitions. [2023-08-31 22:11:35,669 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 27 transitions, 197 flow [2023-08-31 22:11:35,670 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 27 transitions, 187 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:35,670 INFO L231 Difference]: Finished difference. Result has 43 places, 23 transitions, 141 flow [2023-08-31 22:11:35,671 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=141, PETRI_PLACES=43, PETRI_TRANSITIONS=23} [2023-08-31 22:11:35,671 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 7 predicate places. [2023-08-31 22:11:35,672 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 23 transitions, 141 flow [2023-08-31 22:11:35,672 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 43.0) internal successors, (516), 12 states have internal predecessors, (516), 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 22:11:35,672 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:35,672 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:35,682 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 (17)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:35,879 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /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 22:11:35,879 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:35,879 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:35,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1720427431, now seen corresponding path program 2 times [2023-08-31 22:11:35,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:35,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317869784] [2023-08-31 22:11:35,880 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:35,880 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 22:11:35,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:35,881 INFO L229 MonitoredProcess]: Starting monitored process 18 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 22:11:35,883 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 (18)] Waiting until timeout for monitored process [2023-08-31 22:11:35,955 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-08-31 22:11:35,955 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:35,957 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 16 conjunts are in the unsatisfiable core [2023-08-31 22:11:35,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:35,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:35,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:35,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:35,977 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:11:35,993 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:11:35,993 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 22:11:36,088 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2023-08-31 22:11:36,089 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-31 22:11:36,089 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:36,089 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317869784] [2023-08-31 22:11:36,089 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317869784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-31 22:11:36,089 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-31 22:11:36,089 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-31 22:11:36,089 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1564924024] [2023-08-31 22:11:36,090 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-31 22:11:36,090 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-31 22:11:36,090 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:36,090 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-31 22:11:36,090 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-08-31 22:11:36,269 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 93 out of 219 [2023-08-31 22:11:36,270 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 23 transitions, 141 flow. Second operand has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 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 22:11:36,270 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:36,270 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 93 of 219 [2023-08-31 22:11:36,270 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:36,325 INFO L130 PetriNetUnfolder]: 13/44 cut-off events. [2023-08-31 22:11:36,325 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-31 22:11:36,326 INFO L83 FinitePrefix]: Finished finitePrefix Result has 187 conditions, 44 events. 13/44 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 66 event pairs, 0 based on Foata normal form. 2/46 useless extension candidates. Maximal degree in co-relation 175. Up to 34 conditions per place. [2023-08-31 22:11:36,326 INFO L137 encePairwiseOnDemand]: 215/219 looper letters, 21 selfloop transitions, 3 changer transitions 0/24 dead transitions. [2023-08-31 22:11:36,326 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 24 transitions, 186 flow [2023-08-31 22:11:36,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-31 22:11:36,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-31 22:11:36,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 483 transitions. [2023-08-31 22:11:36,328 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4410958904109589 [2023-08-31 22:11:36,328 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 483 transitions. [2023-08-31 22:11:36,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 483 transitions. [2023-08-31 22:11:36,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:36,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 483 transitions. [2023-08-31 22:11:36,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 96.6) internal successors, (483), 5 states have internal predecessors, (483), 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 22:11:36,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 22:11:36,330 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 219.0) internal successors, (1314), 6 states have internal predecessors, (1314), 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 22:11:36,330 INFO L175 Difference]: Start difference. First operand has 43 places, 23 transitions, 141 flow. Second operand 5 states and 483 transitions. [2023-08-31 22:11:36,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 24 transitions, 186 flow [2023-08-31 22:11:36,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 24 transitions, 159 flow, removed 4 selfloop flow, removed 7 redundant places. [2023-08-31 22:11:36,331 INFO L231 Difference]: Finished difference. Result has 39 places, 22 transitions, 113 flow [2023-08-31 22:11:36,331 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=39, PETRI_TRANSITIONS=22} [2023-08-31 22:11:36,331 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 3 predicate places. [2023-08-31 22:11:36,331 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 22 transitions, 113 flow [2023-08-31 22:11:36,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 95.0) internal successors, (475), 5 states have internal predecessors, (475), 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 22:11:36,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:36,331 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:36,339 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 (18)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:36,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /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 22:11:36,540 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:36,540 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:36,540 INFO L85 PathProgramCache]: Analyzing trace with hash 1476230215, now seen corresponding path program 2 times [2023-08-31 22:11:36,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:36,540 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [13329715] [2023-08-31 22:11:36,540 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:36,540 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 22:11:36,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:36,541 INFO L229 MonitoredProcess]: Starting monitored process 19 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 22:11:36,543 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 (19)] Waiting until timeout for monitored process [2023-08-31 22:11:36,631 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:11:36,631 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:36,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 129 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-31 22:11:36,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:36,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:36,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:36,649 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:36,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:11:36,677 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:36,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:36,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:36,738 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 22:11:36,852 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:36,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:37,092 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:37,092 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:37,092 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [13329715] [2023-08-31 22:11:37,092 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [13329715] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:37,092 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:37,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 14 [2023-08-31 22:11:37,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130066744] [2023-08-31 22:11:37,092 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:37,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:11:37,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:37,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:11:37,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=173, Unknown=0, NotChecked=0, Total=240 [2023-08-31 22:11:39,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:41,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:44,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:48,051 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:50,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:53,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:53,262 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 219 [2023-08-31 22:11:53,263 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 22 transitions, 113 flow. Second operand has 16 states, 16 states have (on average 71.625) internal successors, (1146), 16 states have internal predecessors, (1146), 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 22:11:53,263 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:53,263 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 219 [2023-08-31 22:11:53,263 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:53,935 INFO L130 PetriNetUnfolder]: 21/80 cut-off events. [2023-08-31 22:11:53,935 INFO L131 PetriNetUnfolder]: For 96/96 co-relation queries the response was YES. [2023-08-31 22:11:53,935 INFO L83 FinitePrefix]: Finished finitePrefix Result has 268 conditions, 80 events. 21/80 cut-off events. For 96/96 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 196 event pairs, 3 based on Foata normal form. 8/88 useless extension candidates. Maximal degree in co-relation 258. Up to 18 conditions per place. [2023-08-31 22:11:53,935 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 35 selfloop transitions, 17 changer transitions 0/52 dead transitions. [2023-08-31 22:11:53,935 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 326 flow [2023-08-31 22:11:53,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-31 22:11:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-31 22:11:53,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 1246 transitions. [2023-08-31 22:11:53,938 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33467633628793986 [2023-08-31 22:11:53,938 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 1246 transitions. [2023-08-31 22:11:53,938 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 1246 transitions. [2023-08-31 22:11:53,939 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:53,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 1246 transitions. [2023-08-31 22:11:53,940 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 73.29411764705883) internal successors, (1246), 17 states have internal predecessors, (1246), 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 22:11:53,943 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 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 22:11:53,944 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 219.0) internal successors, (3942), 18 states have internal predecessors, (3942), 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 22:11:53,944 INFO L175 Difference]: Start difference. First operand has 39 places, 22 transitions, 113 flow. Second operand 17 states and 1246 transitions. [2023-08-31 22:11:53,944 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 326 flow [2023-08-31 22:11:53,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 321 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-08-31 22:11:53,945 INFO L231 Difference]: Finished difference. Result has 57 places, 31 transitions, 218 flow [2023-08-31 22:11:53,945 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=22, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=218, PETRI_PLACES=57, PETRI_TRANSITIONS=31} [2023-08-31 22:11:53,945 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 21 predicate places. [2023-08-31 22:11:53,945 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 31 transitions, 218 flow [2023-08-31 22:11:53,946 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 71.625) internal successors, (1146), 16 states have internal predecessors, (1146), 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 22:11:53,946 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:53,946 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:53,971 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 (19)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:54,146 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /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 22:11:54,146 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:54,146 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:54,147 INFO L85 PathProgramCache]: Analyzing trace with hash -505724294, now seen corresponding path program 1 times [2023-08-31 22:11:54,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:54,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [847041669] [2023-08-31 22:11:54,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-31 22:11:54,147 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 22:11:54,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:54,148 INFO L229 MonitoredProcess]: Starting monitored process 20 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 22:11:54,151 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 (20)] Waiting until timeout for monitored process [2023-08-31 22:11:54,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-31 22:11:54,242 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-31 22:11:54,244 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:54,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:11:54,253 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:54,267 INFO L321 Elim1Store]: treesize reduction 22, result has 29.0 percent of original size [2023-08-31 22:11:54,268 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 22 treesize of output 24 [2023-08-31 22:11:54,304 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:54,368 INFO L321 Elim1Store]: treesize reduction 19, result has 26.9 percent of original size [2023-08-31 22:11:54,369 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 21 [2023-08-31 22:11:54,407 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:11:54,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 31 [2023-08-31 22:11:54,439 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-08-31 22:11:54,439 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 32 [2023-08-31 22:11:54,460 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:54,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:11:54,732 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:11:54,732 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:11:54,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [847041669] [2023-08-31 22:11:54,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [847041669] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:11:54,732 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:11:54,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-08-31 22:11:54,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321791609] [2023-08-31 22:11:54,732 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:11:54,733 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2023-08-31 22:11:54,733 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:11:54,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2023-08-31 22:11:54,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=151, Unknown=2, NotChecked=0, Total=210 [2023-08-31 22:11:56,263 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 54 out of 219 [2023-08-31 22:11:56,264 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 31 transitions, 218 flow. Second operand has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 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 22:11:56,264 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:11:56,264 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 54 of 219 [2023-08-31 22:11:56,264 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:11:58,966 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:11:59,410 INFO L130 PetriNetUnfolder]: 21/76 cut-off events. [2023-08-31 22:11:59,410 INFO L131 PetriNetUnfolder]: For 93/93 co-relation queries the response was YES. [2023-08-31 22:11:59,410 INFO L83 FinitePrefix]: Finished finitePrefix Result has 323 conditions, 76 events. 21/76 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 174 event pairs, 1 based on Foata normal form. 4/80 useless extension candidates. Maximal degree in co-relation 308. Up to 24 conditions per place. [2023-08-31 22:11:59,411 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 33 selfloop transitions, 14 changer transitions 0/47 dead transitions. [2023-08-31 22:11:59,411 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 47 transitions, 369 flow [2023-08-31 22:11:59,411 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-08-31 22:11:59,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-08-31 22:11:59,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 696 transitions. [2023-08-31 22:11:59,429 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2648401826484018 [2023-08-31 22:11:59,429 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 696 transitions. [2023-08-31 22:11:59,430 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 696 transitions. [2023-08-31 22:11:59,430 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:11:59,430 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 696 transitions. [2023-08-31 22:11:59,432 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 58.0) internal successors, (696), 12 states have internal predecessors, (696), 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 22:11:59,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 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 22:11:59,447 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 219.0) internal successors, (2847), 13 states have internal predecessors, (2847), 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 22:11:59,448 INFO L175 Difference]: Start difference. First operand has 57 places, 31 transitions, 218 flow. Second operand 12 states and 696 transitions. [2023-08-31 22:11:59,448 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 47 transitions, 369 flow [2023-08-31 22:11:59,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 47 transitions, 361 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-08-31 22:11:59,449 INFO L231 Difference]: Finished difference. Result has 69 places, 32 transitions, 270 flow [2023-08-31 22:11:59,450 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=270, PETRI_PLACES=69, PETRI_TRANSITIONS=32} [2023-08-31 22:11:59,450 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 33 predicate places. [2023-08-31 22:11:59,450 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 32 transitions, 270 flow [2023-08-31 22:11:59,450 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 55.86666666666667) internal successors, (838), 15 states have internal predecessors, (838), 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 22:11:59,450 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:11:59,451 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:11:59,477 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 (20)] Forceful destruction successful, exit code 0 [2023-08-31 22:11:59,661 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /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 22:11:59,661 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:11:59,661 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:11:59,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1525546672, now seen corresponding path program 2 times [2023-08-31 22:11:59,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:11:59,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1296167087] [2023-08-31 22:11:59,662 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-31 22:11:59,662 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 22:11:59,662 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:11:59,663 INFO L229 MonitoredProcess]: Starting monitored process 21 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 22:11:59,665 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 (21)] Waiting until timeout for monitored process [2023-08-31 22:11:59,774 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-31 22:11:59,774 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:11:59,777 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 25 conjunts are in the unsatisfiable core [2023-08-31 22:11:59,779 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:11:59,815 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:11:59,816 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:11:59,822 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:11:59,877 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:11:59,878 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:11:59,888 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:11:59,930 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:00,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:00,056 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:00,100 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:00,100 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:02,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:02,442 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:12:02,442 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1296167087] [2023-08-31 22:12:02,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1296167087] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:02,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:12:02,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 13 [2023-08-31 22:12:02,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557864001] [2023-08-31 22:12:02,442 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:02,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 22:12:02,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:12:02,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 22:12:02,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=146, Unknown=2, NotChecked=0, Total=182 [2023-08-31 22:12:05,009 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:07,126 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:09,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:12,005 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:14,081 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:14,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 57 out of 219 [2023-08-31 22:12:14,881 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 32 transitions, 270 flow. Second operand has 14 states, 14 states have (on average 58.857142857142854) internal successors, (824), 14 states have internal predecessors, (824), 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 22:12:14,881 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:12:14,881 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 57 of 219 [2023-08-31 22:12:14,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:12:19,428 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:19,544 INFO L130 PetriNetUnfolder]: 20/71 cut-off events. [2023-08-31 22:12:19,544 INFO L131 PetriNetUnfolder]: For 172/172 co-relation queries the response was YES. [2023-08-31 22:12:19,544 INFO L83 FinitePrefix]: Finished finitePrefix Result has 351 conditions, 71 events. 20/71 cut-off events. For 172/172 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 164 event pairs, 1 based on Foata normal form. 2/73 useless extension candidates. Maximal degree in co-relation 331. Up to 30 conditions per place. [2023-08-31 22:12:19,545 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 25 selfloop transitions, 13 changer transitions 0/38 dead transitions. [2023-08-31 22:12:19,545 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 38 transitions, 354 flow [2023-08-31 22:12:19,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:12:19,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:12:19,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 543 transitions. [2023-08-31 22:12:19,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2754946727549467 [2023-08-31 22:12:19,547 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 543 transitions. [2023-08-31 22:12:19,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 543 transitions. [2023-08-31 22:12:19,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:12:19,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 543 transitions. [2023-08-31 22:12:19,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 60.333333333333336) internal successors, (543), 9 states have internal predecessors, (543), 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 22:12:19,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:12:19,549 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:12:19,549 INFO L175 Difference]: Start difference. First operand has 69 places, 32 transitions, 270 flow. Second operand 9 states and 543 transitions. [2023-08-31 22:12:19,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 38 transitions, 354 flow [2023-08-31 22:12:19,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 38 transitions, 304 flow, removed 5 selfloop flow, removed 11 redundant places. [2023-08-31 22:12:19,551 INFO L231 Difference]: Finished difference. Result has 63 places, 31 transitions, 240 flow [2023-08-31 22:12:19,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=18, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=63, PETRI_TRANSITIONS=31} [2023-08-31 22:12:19,551 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 27 predicate places. [2023-08-31 22:12:19,551 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 31 transitions, 240 flow [2023-08-31 22:12:19,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 58.857142857142854) internal successors, (824), 14 states have internal predecessors, (824), 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 22:12:19,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:12:19,552 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:12:19,578 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 (21)] Forceful destruction successful, exit code 0 [2023-08-31 22:12:19,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /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 22:12:19,752 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:12:19,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:12:19,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1317354381, now seen corresponding path program 3 times [2023-08-31 22:12:19,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:12:19,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1581940198] [2023-08-31 22:12:19,753 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:12:19,753 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 22:12:19,753 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:12:19,754 INFO L229 MonitoredProcess]: Starting monitored process 22 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 22:12:19,756 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 (22)] Waiting until timeout for monitored process [2023-08-31 22:12:19,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2023-08-31 22:12:19,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:12:19,881 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 27 conjunts are in the unsatisfiable core [2023-08-31 22:12:19,882 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:12:19,919 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:12:19,919 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:12:19,926 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:19,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-08-31 22:12:20,012 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:12:20,012 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:12:20,048 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:20,117 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:20,155 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:20,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:12:20,255 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:20,255 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:12:22,668 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:12:22,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:12:22,669 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1581940198] [2023-08-31 22:12:22,669 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1581940198] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:12:22,669 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:12:22,669 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 15 [2023-08-31 22:12:22,669 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1463573620] [2023-08-31 22:12:22,669 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:12:22,669 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-31 22:12:22,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:12:22,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-31 22:12:22,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=199, Unknown=2, NotChecked=0, Total=240 [2023-08-31 22:12:24,745 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:26,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:28,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:31,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:33,064 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:35,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:37,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:39,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:41,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:43,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:45,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:47,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:50,035 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:52,124 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:12:54,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:56,196 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:12:58,230 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:00,265 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:02,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:04,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:06,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:13:08,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-08-31 22:13:08,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 219 [2023-08-31 22:13:08,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 31 transitions, 240 flow. Second operand has 16 states, 16 states have (on average 43.75) internal successors, (700), 16 states have internal predecessors, (700), 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 22:13:08,801 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:08,801 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 219 [2023-08-31 22:13:08,801 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:13,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:13:13,563 INFO L130 PetriNetUnfolder]: 19/66 cut-off events. [2023-08-31 22:13:13,563 INFO L131 PetriNetUnfolder]: For 131/131 co-relation queries the response was YES. [2023-08-31 22:13:13,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 304 conditions, 66 events. 19/66 cut-off events. For 131/131 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 129 event pairs, 1 based on Foata normal form. 2/68 useless extension candidates. Maximal degree in co-relation 286. Up to 25 conditions per place. [2023-08-31 22:13:13,564 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 24 selfloop transitions, 12 changer transitions 0/36 dead transitions. [2023-08-31 22:13:13,564 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 36 transitions, 311 flow [2023-08-31 22:13:13,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:13:13,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:13:13,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 407 transitions. [2023-08-31 22:13:13,565 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20649416539827498 [2023-08-31 22:13:13,565 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 407 transitions. [2023-08-31 22:13:13,565 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 407 transitions. [2023-08-31 22:13:13,566 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:13,566 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 407 transitions. [2023-08-31 22:13:13,566 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.22222222222222) internal successors, (407), 9 states have internal predecessors, (407), 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 22:13:13,567 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:13:13,567 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:13:13,568 INFO L175 Difference]: Start difference. First operand has 63 places, 31 transitions, 240 flow. Second operand 9 states and 407 transitions. [2023-08-31 22:13:13,568 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 36 transitions, 311 flow [2023-08-31 22:13:13,568 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 36 transitions, 277 flow, removed 5 selfloop flow, removed 9 redundant places. [2023-08-31 22:13:13,569 INFO L231 Difference]: Finished difference. Result has 60 places, 29 transitions, 215 flow [2023-08-31 22:13:13,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=191, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=17, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=215, PETRI_PLACES=60, PETRI_TRANSITIONS=29} [2023-08-31 22:13:13,569 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 24 predicate places. [2023-08-31 22:13:13,569 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 29 transitions, 215 flow [2023-08-31 22:13:13,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 43.75) internal successors, (700), 16 states have internal predecessors, (700), 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 22:13:13,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:13,570 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:13,584 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 (22)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:13,770 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /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 22:13:13,770 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:13,770 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:13,770 INFO L85 PathProgramCache]: Analyzing trace with hash -676044256, now seen corresponding path program 4 times [2023-08-31 22:13:13,770 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:13,770 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1574006664] [2023-08-31 22:13:13,770 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-08-31 22:13:13,771 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 22:13:13,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:13,771 INFO L229 MonitoredProcess]: Starting monitored process 23 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 22:13:13,776 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 (23)] Waiting until timeout for monitored process [2023-08-31 22:13:13,925 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-08-31 22:13:13,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:13,929 INFO L263 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 26 conjunts are in the unsatisfiable core [2023-08-31 22:13:13,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:13,965 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:13:13,966 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:13:13,972 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,043 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:13:14,043 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:13:14,071 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,122 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,152 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,183 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,212 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:14,237 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:14,238 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:14,299 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_380) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8)))) is different from false [2023-08-31 22:13:14,306 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_380) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv3 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8)))) is different from false [2023-08-31 22:13:16,515 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2023-08-31 22:13:16,515 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:16,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1574006664] [2023-08-31 22:13:16,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1574006664] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:16,515 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:16,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 17 [2023-08-31 22:13:16,515 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862170346] [2023-08-31 22:13:16,515 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:16,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-31 22:13:16,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:16,516 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-31 22:13:16,516 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=182, Unknown=25, NotChecked=58, Total=306 [2023-08-31 22:13:16,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 219 [2023-08-31 22:13:16,517 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 29 transitions, 215 flow. Second operand has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 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 22:13:16,517 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:16,517 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 219 [2023-08-31 22:13:16,517 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:17,660 INFO L130 PetriNetUnfolder]: 18/62 cut-off events. [2023-08-31 22:13:17,660 INFO L131 PetriNetUnfolder]: For 130/130 co-relation queries the response was YES. [2023-08-31 22:13:17,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 280 conditions, 62 events. 18/62 cut-off events. For 130/130 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 107 event pairs, 1 based on Foata normal form. 2/64 useless extension candidates. Maximal degree in co-relation 263. Up to 37 conditions per place. [2023-08-31 22:13:17,661 INFO L137 encePairwiseOnDemand]: 214/219 looper letters, 25 selfloop transitions, 9 changer transitions 0/34 dead transitions. [2023-08-31 22:13:17,661 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 34 transitions, 286 flow [2023-08-31 22:13:17,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-08-31 22:13:17,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-08-31 22:13:17,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 397 transitions. [2023-08-31 22:13:17,662 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.20142059868087264 [2023-08-31 22:13:17,662 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 397 transitions. [2023-08-31 22:13:17,662 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 397 transitions. [2023-08-31 22:13:17,662 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:17,662 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 397 transitions. [2023-08-31 22:13:17,663 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.111111111111114) internal successors, (397), 9 states have internal predecessors, (397), 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 22:13:17,664 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:13:17,664 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 219.0) internal successors, (2190), 10 states have internal predecessors, (2190), 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 22:13:17,664 INFO L175 Difference]: Start difference. First operand has 60 places, 29 transitions, 215 flow. Second operand 9 states and 397 transitions. [2023-08-31 22:13:17,664 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 34 transitions, 286 flow [2023-08-31 22:13:17,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 34 transitions, 256 flow, removed 1 selfloop flow, removed 10 redundant places. [2023-08-31 22:13:17,666 INFO L231 Difference]: Finished difference. Result has 58 places, 29 transitions, 201 flow [2023-08-31 22:13:17,666 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=58, PETRI_TRANSITIONS=29} [2023-08-31 22:13:17,666 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 22 predicate places. [2023-08-31 22:13:17,666 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 29 transitions, 201 flow [2023-08-31 22:13:17,666 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 42.666666666666664) internal successors, (768), 18 states have internal predecessors, (768), 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 22:13:17,666 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:17,666 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:17,675 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 (23)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:17,866 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /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 22:13:17,867 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:17,867 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:17,867 INFO L85 PathProgramCache]: Analyzing trace with hash 1587277581, now seen corresponding path program 5 times [2023-08-31 22:13:17,867 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:17,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1328391968] [2023-08-31 22:13:17,867 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-08-31 22:13:17,867 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 22:13:17,867 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:17,868 INFO L229 MonitoredProcess]: Starting monitored process 24 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 22:13:17,870 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 (24)] Waiting until timeout for monitored process [2023-08-31 22:13:17,994 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-08-31 22:13:17,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:17,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 41 conjunts are in the unsatisfiable core [2023-08-31 22:13:18,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:18,031 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:13:18,031 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-08-31 22:13:18,090 INFO L321 Elim1Store]: treesize reduction 84, result has 33.3 percent of original size [2023-08-31 22:13:18,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 29 treesize of output 62 [2023-08-31 22:13:18,102 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:18,253 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:13:18,254 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 1 case distinctions, treesize of input 12 treesize of output 18 [2023-08-31 22:13:18,313 INFO L321 Elim1Store]: treesize reduction 12, result has 76.5 percent of original size [2023-08-31 22:13:18,313 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 57 treesize of output 87 [2023-08-31 22:13:18,735 INFO L321 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-08-31 22:13:18,736 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2023-08-31 22:13:19,490 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:19,704 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:19,875 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:20,095 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 58 [2023-08-31 22:13:20,303 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 56 [2023-08-31 22:13:20,329 INFO L321 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2023-08-31 22:13:20,329 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 58 treesize of output 54 [2023-08-31 22:13:20,395 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:20,395 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:21,370 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:21,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:21,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1328391968] [2023-08-31 22:13:21,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1328391968] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:21,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:21,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2023-08-31 22:13:21,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084051510] [2023-08-31 22:13:21,371 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:21,372 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2023-08-31 22:13:21,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:21,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2023-08-31 22:13:21,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=327, Unknown=3, NotChecked=0, Total=380 [2023-08-31 22:13:27,397 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 219 [2023-08-31 22:13:27,398 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 29 transitions, 201 flow. Second operand has 20 states, 20 states have (on average 45.6) internal successors, (912), 20 states have internal predecessors, (912), 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 22:13:27,398 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:27,398 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 219 [2023-08-31 22:13:27,398 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:43,036 INFO L130 PetriNetUnfolder]: 28/92 cut-off events. [2023-08-31 22:13:43,036 INFO L131 PetriNetUnfolder]: For 384/384 co-relation queries the response was YES. [2023-08-31 22:13:43,036 INFO L83 FinitePrefix]: Finished finitePrefix Result has 442 conditions, 92 events. 28/92 cut-off events. For 384/384 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 191 event pairs, 0 based on Foata normal form. 6/98 useless extension candidates. Maximal degree in co-relation 425. Up to 25 conditions per place. [2023-08-31 22:13:43,037 INFO L137 encePairwiseOnDemand]: 213/219 looper letters, 41 selfloop transitions, 23 changer transitions 0/64 dead transitions. [2023-08-31 22:13:43,037 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 64 transitions, 548 flow [2023-08-31 22:13:43,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-08-31 22:13:43,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-08-31 22:13:43,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 990 transitions. [2023-08-31 22:13:43,039 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.21526418786692758 [2023-08-31 22:13:43,039 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 990 transitions. [2023-08-31 22:13:43,039 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 990 transitions. [2023-08-31 22:13:43,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:43,039 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 990 transitions. [2023-08-31 22:13:43,040 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 47.142857142857146) internal successors, (990), 21 states have internal predecessors, (990), 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 22:13:43,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 219.0) internal successors, (4818), 22 states have internal predecessors, (4818), 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 22:13:43,047 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 219.0) internal successors, (4818), 22 states have internal predecessors, (4818), 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 22:13:43,047 INFO L175 Difference]: Start difference. First operand has 58 places, 29 transitions, 201 flow. Second operand 21 states and 990 transitions. [2023-08-31 22:13:43,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 64 transitions, 548 flow [2023-08-31 22:13:43,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 64 transitions, 511 flow, removed 6 selfloop flow, removed 9 redundant places. [2023-08-31 22:13:43,049 INFO L231 Difference]: Finished difference. Result has 68 places, 38 transitions, 332 flow [2023-08-31 22:13:43,049 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=28, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=11, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=332, PETRI_PLACES=68, PETRI_TRANSITIONS=38} [2023-08-31 22:13:43,049 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 32 predicate places. [2023-08-31 22:13:43,049 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 38 transitions, 332 flow [2023-08-31 22:13:43,050 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 45.6) internal successors, (912), 20 states have internal predecessors, (912), 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 22:13:43,050 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:43,050 INFO L208 CegarLoopForPetriNet]: trace histogram [8, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:43,077 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 (24)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:43,250 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /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 22:13:43,250 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:43,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:43,251 INFO L85 PathProgramCache]: Analyzing trace with hash -299748857, now seen corresponding path program 3 times [2023-08-31 22:13:43,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:43,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [71846250] [2023-08-31 22:13:43,251 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-08-31 22:13:43,251 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 22:13:43,251 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:43,252 INFO L229 MonitoredProcess]: Starting monitored process 25 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 22:13:43,254 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 (25)] Waiting until timeout for monitored process [2023-08-31 22:13:43,397 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-08-31 22:13:43,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:43,402 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 31 conjunts are in the unsatisfiable core [2023-08-31 22:13:43,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:43,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:43,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:43,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:43,417 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:13:43,450 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:13:43,450 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:13:43,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,527 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:13:43,527 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 22:13:43,547 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:13:43,547 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:13:43,596 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,677 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,697 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,721 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,740 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,752 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,772 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,790 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:43,836 INFO L321 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-08-31 22:13:43,836 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 14 [2023-08-31 22:13:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-08-31 22:13:43,908 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:44,110 WARN L839 $PredicateComparison]: unable to prove that (forall ((|thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| (_ BitVec 32)) (v_ArrVal_461 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|)) (.cse1 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|))) (or (not (bvult .cse0 .cse1)) (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_461) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse0)) (_ bv0 8)) (bvult (bvadd |thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32)) .cse1)))) is different from false [2023-08-31 22:13:46,710 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 21 trivial. 14 not checked. [2023-08-31 22:13:46,711 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:46,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [71846250] [2023-08-31 22:13:46,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [71846250] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:46,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:46,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2023-08-31 22:13:46,711 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793599956] [2023-08-31 22:13:46,711 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:46,712 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-08-31 22:13:46,713 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-08-31 22:13:46,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=123, Unknown=3, NotChecked=22, Total=182 [2023-08-31 22:13:46,909 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 219 [2023-08-31 22:13:46,909 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 38 transitions, 332 flow. Second operand has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 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 22:13:46,909 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:13:46,909 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 219 [2023-08-31 22:13:46,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:13:50,885 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:13:51,031 INFO L130 PetriNetUnfolder]: 27/95 cut-off events. [2023-08-31 22:13:51,031 INFO L131 PetriNetUnfolder]: For 739/739 co-relation queries the response was YES. [2023-08-31 22:13:51,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 428 conditions, 95 events. 27/95 cut-off events. For 739/739 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 237 event pairs, 0 based on Foata normal form. 15/110 useless extension candidates. Maximal degree in co-relation 413. Up to 52 conditions per place. [2023-08-31 22:13:51,032 INFO L137 encePairwiseOnDemand]: 211/219 looper letters, 41 selfloop transitions, 13 changer transitions 0/54 dead transitions. [2023-08-31 22:13:51,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 54 transitions, 505 flow [2023-08-31 22:13:51,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-08-31 22:13:51,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-08-31 22:13:51,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 335 transitions. [2023-08-31 22:13:51,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.19121004566210045 [2023-08-31 22:13:51,034 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 335 transitions. [2023-08-31 22:13:51,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 335 transitions. [2023-08-31 22:13:51,034 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:13:51,034 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 335 transitions. [2023-08-31 22:13:51,035 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.875) internal successors, (335), 8 states have internal predecessors, (335), 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 22:13:51,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 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 22:13:51,036 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 219.0) internal successors, (1971), 9 states have internal predecessors, (1971), 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 22:13:51,036 INFO L175 Difference]: Start difference. First operand has 68 places, 38 transitions, 332 flow. Second operand 8 states and 335 transitions. [2023-08-31 22:13:51,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 54 transitions, 505 flow [2023-08-31 22:13:51,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 54 transitions, 329 flow, removed 36 selfloop flow, removed 19 redundant places. [2023-08-31 22:13:51,038 INFO L231 Difference]: Finished difference. Result has 54 places, 39 transitions, 218 flow [2023-08-31 22:13:51,038 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=218, PETRI_PLACES=54, PETRI_TRANSITIONS=39} [2023-08-31 22:13:51,039 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 18 predicate places. [2023-08-31 22:13:51,039 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 39 transitions, 218 flow [2023-08-31 22:13:51,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 40.714285714285715) internal successors, (570), 14 states have internal predecessors, (570), 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 22:13:51,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:13:51,039 INFO L208 CegarLoopForPetriNet]: trace histogram [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:13:51,059 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 (25)] Forceful destruction successful, exit code 0 [2023-08-31 22:13:51,248 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /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 22:13:51,248 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:13:51,248 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:13:51,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1144776256, now seen corresponding path program 6 times [2023-08-31 22:13:51,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:13:51,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1871506318] [2023-08-31 22:13:51,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-08-31 22:13:51,249 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 22:13:51,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:13:51,252 INFO L229 MonitoredProcess]: Starting monitored process 26 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 22:13:51,252 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 (26)] Waiting until timeout for monitored process [2023-08-31 22:13:51,428 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2023-08-31 22:13:51,428 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-31 22:13:51,433 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 36 conjunts are in the unsatisfiable core [2023-08-31 22:13:51,438 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-31 22:13:51,452 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:51,454 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:51,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-31 22:13:51,457 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 19 [2023-08-31 22:13:51,516 INFO L321 Elim1Store]: treesize reduction 72, result has 24.2 percent of original size [2023-08-31 22:13:51,516 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 31 treesize of output 45 [2023-08-31 22:13:51,530 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:51,621 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-31 22:13:51,621 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2023-08-31 22:13:51,648 INFO L321 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2023-08-31 22:13:51,649 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2023-08-31 22:13:51,719 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:51,814 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:51,865 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:51,914 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:51,971 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:52,026 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:52,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2023-08-31 22:13:52,134 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:52,134 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-31 22:13:57,319 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 14 refuted. 7 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-31 22:13:57,320 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-31 22:13:57,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1871506318] [2023-08-31 22:13:57,320 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1871506318] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-31 22:13:57,320 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-08-31 22:13:57,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 21 [2023-08-31 22:13:57,320 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395092081] [2023-08-31 22:13:57,320 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-08-31 22:13:57,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-08-31 22:13:57,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-31 22:13:57,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-08-31 22:13:57,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=382, Unknown=11, NotChecked=0, Total=462 [2023-08-31 22:14:07,031 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-08-31 22:14:09,216 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 219 [2023-08-31 22:14:09,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 39 transitions, 218 flow. Second operand has 22 states, 22 states have (on average 53.54545454545455) internal successors, (1178), 22 states have internal predecessors, (1178), 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 22:14:09,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-31 22:14:09,217 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 219 [2023-08-31 22:14:09,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-31 22:14:16,663 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv1 32))) (.cse2 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|)) (.cse0 (select |c_#length| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base|))) (and (or (not (bvult (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset| (_ bv2 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1|) .cse0)) (not (bvult .cse1 .cse2)) (forall ((v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_502) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv2 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8))))) (or (not (bvult (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|) .cse2)) (not (bvult (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| (_ bv1 32)) .cse0)) (forall ((v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_502) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) .cse1)) (_ bv0 8))))) (or (not (bvult (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset| (_ bv5 32)) .cse2)) (not (bvult (bvadd |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.offset| (_ bv6 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1|) .cse0)) (forall ((v_ArrVal_502 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= ((_ extract 7 0) (select (select (store |c_#memory_int| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_dest#1.base| v_ArrVal_502) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.base|) (bvadd (_ bv6 32) |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_#t~offset13#1| |c_thread2Thread1of1ForFork0_#Ultimate.C_strcpy_src#1.offset|))) (_ bv0 8))))))) is different from false [2023-08-31 22:14:18,842 INFO L130 PetriNetUnfolder]: 22/87 cut-off events. [2023-08-31 22:14:18,843 INFO L131 PetriNetUnfolder]: For 183/183 co-relation queries the response was YES. [2023-08-31 22:14:18,843 INFO L83 FinitePrefix]: Finished finitePrefix Result has 322 conditions, 87 events. 22/87 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 156 event pairs, 0 based on Foata normal form. 15/102 useless extension candidates. Maximal degree in co-relation 315. Up to 25 conditions per place. [2023-08-31 22:14:18,843 INFO L137 encePairwiseOnDemand]: 212/219 looper letters, 27 selfloop transitions, 24 changer transitions 0/51 dead transitions. [2023-08-31 22:14:18,843 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 51 transitions, 376 flow [2023-08-31 22:14:18,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-08-31 22:14:18,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-08-31 22:14:18,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 1093 transitions. [2023-08-31 22:14:18,846 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2495433789954338 [2023-08-31 22:14:18,846 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 1093 transitions. [2023-08-31 22:14:18,846 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 1093 transitions. [2023-08-31 22:14:18,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-31 22:14:18,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 1093 transitions. [2023-08-31 22:14:18,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 54.65) internal successors, (1093), 20 states have internal predecessors, (1093), 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 22:14:18,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 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 22:14:18,850 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 219.0) internal successors, (4599), 21 states have internal predecessors, (4599), 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 22:14:18,850 INFO L175 Difference]: Start difference. First operand has 54 places, 39 transitions, 218 flow. Second operand 20 states and 1093 transitions. [2023-08-31 22:14:18,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 51 transitions, 376 flow [2023-08-31 22:14:18,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 51 transitions, 345 flow, removed 0 selfloop flow, removed 7 redundant places. [2023-08-31 22:14:18,851 INFO L231 Difference]: Finished difference. Result has 64 places, 36 transitions, 215 flow [2023-08-31 22:14:18,851 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=219, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=9, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=215, PETRI_PLACES=64, PETRI_TRANSITIONS=36} [2023-08-31 22:14:18,852 INFO L281 CegarLoopForPetriNet]: 36 programPoint places, 28 predicate places. [2023-08-31 22:14:18,852 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 36 transitions, 215 flow [2023-08-31 22:14:18,852 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 53.54545454545455) internal successors, (1178), 22 states have internal predecessors, (1178), 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 22:14:18,852 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-31 22:14:18,852 INFO L208 CegarLoopForPetriNet]: trace histogram [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:14:18,862 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 (26)] Forceful destruction successful, exit code 0 [2023-08-31 22:14:19,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /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 22:14:19,063 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE, thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2023-08-31 22:14:19,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-31 22:14:19,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1128522691, now seen corresponding path program 7 times [2023-08-31 22:14:19,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-31 22:14:19,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [170663172] [2023-08-31 22:14:19,064 INFO L93 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2023-08-31 22:14:19,064 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 22:14:19,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-31 22:14:19,065 INFO L229 MonitoredProcess]: Starting monitored process 27 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 22:14:19,070 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 (27)] Waiting until timeout for monitored process [2023-08-31 22:14:19,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:14:19,290 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-31 22:14:19,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-31 22:14:19,461 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-31 22:14:19,461 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-31 22:14:19,462 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2023-08-31 22:14:19,463 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2023-08-31 22:14:19,464 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK (8 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (7 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (6 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0ASSERT_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1ASSERT_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err2ASSERT_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err3ASSERT_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2023-08-31 22:14:19,465 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2023-08-31 22:14:19,475 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 (27)] Forceful destruction successful, exit code 0 [2023-08-31 22:14:19,666 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /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 22:14:19,666 INFO L445 BasicCegarLoop]: Path program histogram: [7, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-31 22:14:19,679 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-31 22:14:19,680 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-31 22:14:19,688 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,691 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,692 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,693 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,694 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,695 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,696 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,697 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,698 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled [2023-08-31 22:14:19,699 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,699 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled [2023-08-31 22:14:19,699 WARN L421 cessorBacktranslator]: Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled [2023-08-31 22:14:19,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 31.08 10:14:19 BasicIcfg [2023-08-31 22:14:19,711 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-31 22:14:19,712 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-31 22:14:19,712 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-31 22:14:19,712 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-31 22:14:19,712 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 31.08 10:10:27" (3/4) ... [2023-08-31 22:14:19,714 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-31 22:14:19,714 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-31 22:14:19,714 INFO L158 Benchmark]: Toolchain (without parser) took 233205.21ms. Allocated memory was 104.9MB in the beginning and 161.5MB in the end (delta: 56.6MB). Free memory was 81.2MB in the beginning and 48.9MB in the end (delta: 32.3MB). Peak memory consumption was 89.8MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,714 INFO L158 Benchmark]: CDTParser took 0.34ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:14:19,714 INFO L158 Benchmark]: CACSL2BoogieTranslator took 567.69ms. Allocated memory is still 104.9MB. Free memory was 81.0MB in the beginning and 76.1MB in the end (delta: 5.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,715 INFO L158 Benchmark]: Boogie Procedure Inliner took 58.19ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,715 INFO L158 Benchmark]: Boogie Preprocessor took 24.01ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,715 INFO L158 Benchmark]: RCFGBuilder took 440.63ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 53.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,715 INFO L158 Benchmark]: TraceAbstraction took 232104.34ms. Allocated memory was 104.9MB in the beginning and 161.5MB in the end (delta: 56.6MB). Free memory was 52.5MB in the beginning and 48.9MB in the end (delta: 3.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. [2023-08-31 22:14:19,715 INFO L158 Benchmark]: Witness Printer took 2.28ms. Allocated memory is still 161.5MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-31 22:14:19,716 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.34ms. Allocated memory is still 71.3MB. Free memory is still 49.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 567.69ms. Allocated memory is still 104.9MB. Free memory was 81.0MB in the beginning and 76.1MB in the end (delta: 5.0MB). Peak memory consumption was 33.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 58.19ms. Allocated memory is still 104.9MB. Free memory was 76.1MB in the beginning and 73.9MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 24.01ms. Allocated memory is still 104.9MB. Free memory was 73.9MB in the beginning and 71.9MB in the end (delta: 2.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 440.63ms. Allocated memory is still 104.9MB. Free memory was 71.9MB in the beginning and 53.0MB in the end (delta: 18.9MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * TraceAbstraction took 232104.34ms. Allocated memory was 104.9MB in the beginning and 161.5MB in the end (delta: 56.6MB). Free memory was 52.5MB in the beginning and 48.9MB in the end (delta: 3.6MB). Peak memory consumption was 60.2MB. Max. memory is 16.1GB. * Witness Printer took 2.28ms. Allocated memory is still 161.5MB. Free memory is still 48.9MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_#res#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_dest#1 : $Pointer$ not handled - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: Nested struct field access of VarList #Ultimate.C_strcpy_src#1 : $Pointer$ not handled * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 6.2s, 104 PlacesBefore, 36 PlacesAfterwards, 101 TransitionsBefore, 31 TransitionsAfterwards, 340 CoEnabledTransitionPairs, 6 FixpointIterations, 59 TrivialSequentialCompositions, 41 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 6 ConcurrentYvCompositions, 2 ChoiceCompositions, 112 TotalNumberOfCompositions, 458 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 365, independent: 340, independent conditional: 0, independent unconditional: 340, dependent: 25, dependent conditional: 0, dependent unconditional: 25, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 181, independent: 171, independent conditional: 0, independent unconditional: 171, dependent: 10, dependent conditional: 0, dependent unconditional: 10, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 365, independent: 169, independent conditional: 0, independent unconditional: 169, dependent: 15, dependent conditional: 0, dependent unconditional: 15, unknown: 181, unknown conditional: 0, unknown unconditional: 181] , Statistics on independence cache: Total cache size (in pairs): 11, Positive cache size: 9, Positive conditional cache size: 0, Positive unconditional cache size: 9, Negative cache size: 2, Negative conditional cache size: 0, Negative unconditional cache size: 2, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 1119]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1107. Possible FailurePath: [L1108] 0 char *v; [L1121] 0 pthread_t t1, t2; [L1122] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [arg={0:0}, pthread_create(&t1, 0, thread1, 0)=1, t1={7:0}, t2={11:0}, v={0:0}] [L1123] 0 \read(t1) VAL [\read(t1)=1, arg={0:0}, t1={7:0}, t2={11:0}, v={0:0}] [L1111] 1 v = malloc(sizeof(char) * 8) [L1112] 1 return 0; [L1123] FCALL, JOIN 1 pthread_join(t1, 0) VAL [\read(t1)=1, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1124] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [\result={0:0}, arg={0:0}, arg={0:0}, pthread_create(&t2, 0, thread2, 0)=2, t1={7:0}, t2={11:0}, v={5:0}] [L1125] 0 \read(t2) VAL [\read(t2)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1116] COND TRUE 2 \read(*v) [L1116] FCALL 2 strcpy(v, "Bigshot") [L1117] 2 return 0; [L1125] FCALL, JOIN 2 pthread_join(t2, 0) VAL [\read(t2)=2, \result={0:0}, arg={0:0}, arg={0:0}, t1={7:0}, t2={11:0}, v={5:0}] [L1126] EXPR 0 v[0] [L1126] CALL 0 __VERIFIER_assert(v[0] == 'B') [L1107] COND FALSE 0 !(!expression) [L1126] RET 0 __VERIFIER_assert(v[0] == 'B') [L1127] 0 return 0; [L1127] 0 return 0; [L1127] 0 return 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: -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: 1107]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1122]: 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: 1124]: 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 5 procedures, 139 locations, 26 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: 231.9s, OverallIterations: 26, TraceHistogramMax: 8, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 191.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 6.3s, HoareTripleCheckerStatistics: 322 mSolverCounterUnknown, 5443 SdHoareTripleChecker+Valid, 161.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 4303 mSDsluCounter, 4370 SdHoareTripleChecker+Invalid, 158.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 225 IncrementalHoareTripleChecker+Unchecked, 4188 mSDsCounter, 438 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 16025 IncrementalHoareTripleChecker+Invalid, 17010 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 438 mSolverCounterUnsat, 182 mSDtfsCounter, 16025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 322 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 489 GetRequests, 213 SyntacticMatches, 3 SemanticMatches, 273 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 758 ImplicationChecksByTransitivity, 49.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=332occurred in iteration=23, InterpolantAutomatonStates: 185, 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.2s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 25.9s InterpolantComputationTime, 283 NumberOfCodeBlocks, 279 NumberOfCodeBlocksAsserted, 40 NumberOfCheckSat, 385 ConstructedInterpolants, 152 QuantifiedInterpolants, 7756 SizeOfPredicates, 125 NumberOfNonLiveVariables, 2634 ConjunctsInSsa, 388 ConjunctsInUnsatCore, 36 InterpolantComputations, 14 PerfectInterpolantSequences, 52/224 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 22:14:19,777 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