./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --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-ext/26_stack_cas_longest-1.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 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:56:15,964 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:56:15,965 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:56:16,000 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:56:16,010 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:56:16,013 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:56:16,015 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:56:16,018 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:56:16,020 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:56:16,024 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:56:16,025 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:56:16,028 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:56:16,028 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:56:16,030 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:56:16,032 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:56:16,040 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:56:16,041 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:56:16,043 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:56:16,045 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:56:16,049 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:56:16,050 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:56:16,051 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:56:16,052 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:56:16,053 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:56:16,059 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:56:16,060 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:56:16,060 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:56:16,062 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:56:16,062 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:56:16,063 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:56:16,063 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:56:16,069 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:56:16,070 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:56:16,071 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:56:16,072 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:56:16,072 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:56:16,072 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:56:16,073 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:56:16,073 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:56:16,073 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:56:16,074 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:56:16,075 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-29 19:56:16,106 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:56:16,107 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:56:16,108 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:56:16,108 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:56:16,109 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:56:16,109 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:56:16,110 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:56:16,110 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:56:16,110 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:56:16,110 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:56:16,111 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:56:16,111 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:56:16,111 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:56:16,112 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:56:16,113 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:56:16,113 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:56:16,113 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:56:16,113 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:56:16,113 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:56:16,114 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:56:16,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:56:16,114 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:56:16,114 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:56:16,114 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-29 19:56:16,114 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-29 19:56:16,115 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:56:16,115 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:56:16,115 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:56:16,115 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:56:16,115 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 -> 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412 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 -> AFTER [2023-08-29 19:56:16,412 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:56:16,430 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:56:16,432 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:56:16,433 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:56:16,434 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:56:16,435 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-29 19:56:17,552 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:56:17,776 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:56:17,776 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-29 19:56:17,786 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16640891e/b11f3e76b95b412aa91bc929ed2a09a1/FLAG250229fd4 [2023-08-29 19:56:17,800 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/16640891e/b11f3e76b95b412aa91bc929ed2a09a1 [2023-08-29 19:56:17,802 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:56:17,803 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:56:17,804 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:56:17,804 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:56:17,806 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:56:17,807 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:56:17" (1/1) ... [2023-08-29 19:56:17,808 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@43578d3c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:17, skipping insertion in model container [2023-08-29 19:56:17,808 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:56:17" (1/1) ... [2023-08-29 19:56:17,813 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:56:17,874 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:56:18,231 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-ext/26_stack_cas_longest-1.i[31167,31180] [2023-08-29 19:56:18,240 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:56:18,253 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:56:18,302 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-ext/26_stack_cas_longest-1.i[31167,31180] [2023-08-29 19:56:18,311 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:56:18,350 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:56:18,351 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18 WrapperNode [2023-08-29 19:56:18,351 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:56:18,352 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:56:18,352 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:56:18,352 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:56:18,359 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,387 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,420 INFO L138 Inliner]: procedures = 177, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 190 [2023-08-29 19:56:18,420 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:56:18,421 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:56:18,421 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:56:18,422 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:56:18,429 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,430 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,447 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,449 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,458 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,471 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,473 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,476 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:56:18,477 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:56:18,477 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:56:18,483 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:56:18,484 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (1/1) ... [2023-08-29 19:56:18,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:56:18,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:56:18,517 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-29 19:56:18,541 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-29 19:56:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-29 19:56:18,553 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 19:56:18,554 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-29 19:56:18,554 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:56:18,554 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:56:18,556 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:56:18,752 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:56:18,754 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:56:19,091 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:56:19,326 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:56:19,327 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 19:56:19,329 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:19 BoogieIcfgContainer [2023-08-29 19:56:19,329 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:56:19,330 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:56:19,331 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:56:19,333 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:56:19,333 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:56:17" (1/3) ... [2023-08-29 19:56:19,334 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e304ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:56:19, skipping insertion in model container [2023-08-29 19:56:19,334 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:18" (2/3) ... [2023-08-29 19:56:19,335 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54e304ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:56:19, skipping insertion in model container [2023-08-29 19:56:19,335 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:19" (3/3) ... [2023-08-29 19:56:19,336 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2023-08-29 19:56:19,349 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:56:19,349 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-29 19:56:19,349 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:56:19,445 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:56:19,479 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,535 INFO L130 PetriNetUnfolder]: 11/175 cut-off events. [2023-08-29 19:56:19,535 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:19,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 175 events. 11/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-08-29 19:56:19,543 INFO L82 GeneralOperation]: Start removeDead. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,551 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,554 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:56:19,565 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,566 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 153 places, 160 transitions, 325 flow [2023-08-29 19:56:19,621 INFO L130 PetriNetUnfolder]: 11/175 cut-off events. [2023-08-29 19:56:19,622 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:19,626 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 175 events. 11/175 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/117 useless extension candidates. Maximal degree in co-relation 135. Up to 4 conditions per place. [2023-08-29 19:56:19,629 INFO L119 LiptonReduction]: Number of co-enabled transitions 4248 [2023-08-29 19:56:24,847 INFO L134 LiptonReduction]: Checked pairs total: 8906 [2023-08-29 19:56:24,848 INFO L136 LiptonReduction]: Total number of compositions: 153 [2023-08-29 19:56:24,857 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:56:24,862 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;@213e27f, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:56:24,863 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2023-08-29 19:56:24,865 INFO L130 PetriNetUnfolder]: 0/3 cut-off events. [2023-08-29 19:56:24,865 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:24,865 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:24,866 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:24,866 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:24,870 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:24,871 INFO L85 PathProgramCache]: Analyzing trace with hash 30939, now seen corresponding path program 1 times [2023-08-29 19:56:24,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:24,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [489102261] [2023-08-29 19:56:24,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:24,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:24,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:25,192 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-29 19:56:25,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:25,193 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [489102261] [2023-08-29 19:56:25,194 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [489102261] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:25,194 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:25,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:25,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458775233] [2023-08-29 19:56:25,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:25,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:25,215 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:25,237 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:25,238 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:25,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 313 [2023-08-29 19:56:25,293 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 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-29 19:56:25,293 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:25,294 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 313 [2023-08-29 19:56:25,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:25,429 INFO L130 PetriNetUnfolder]: 128/284 cut-off events. [2023-08-29 19:56:25,429 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:25,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 569 conditions, 284 events. 128/284 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1141 event pairs, 108 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 554. Up to 279 conditions per place. [2023-08-29 19:56:25,434 INFO L137 encePairwiseOnDemand]: 292/313 looper letters, 45 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 19:56:25,435 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 48 transitions, 193 flow [2023-08-29 19:56:25,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:25,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:25,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 399 transitions. [2023-08-29 19:56:25,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4249201277955272 [2023-08-29 19:56:25,457 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 399 transitions. [2023-08-29 19:56:25,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 399 transitions. [2023-08-29 19:56:25,461 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:25,463 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 399 transitions. [2023-08-29 19:56:25,468 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.0) internal successors, (399), 3 states have internal predecessors, (399), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,474 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,475 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,477 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 147 flow. Second operand 3 states and 399 transitions. [2023-08-29 19:56:25,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 48 transitions, 193 flow [2023-08-29 19:56:25,480 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 193 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:56:25,482 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 103 flow [2023-08-29 19:56:25,483 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=103, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-29 19:56:25,487 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:25,487 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 103 flow [2023-08-29 19:56:25,487 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.66666666666667) internal successors, (335), 3 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-29 19:56:25,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:25,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:25,488 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-29 19:56:25,488 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:25,496 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:25,496 INFO L85 PathProgramCache]: Analyzing trace with hash 30941, now seen corresponding path program 1 times [2023-08-29 19:56:25,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:25,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1131067315] [2023-08-29 19:56:25,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:25,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:25,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:25,583 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-29 19:56:25,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:25,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1131067315] [2023-08-29 19:56:25,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1131067315] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:25,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:25,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:25,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936640526] [2023-08-29 19:56:25,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:25,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:25,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:25,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:25,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:25,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 313 [2023-08-29 19:56:25,621 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 103 flow. Second operand has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,621 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:25,621 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 313 [2023-08-29 19:56:25,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:25,759 INFO L130 PetriNetUnfolder]: 172/397 cut-off events. [2023-08-29 19:56:25,759 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:25,760 INFO L83 FinitePrefix]: Finished finitePrefix Result has 794 conditions, 397 events. 172/397 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1608 event pairs, 90 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 787. Up to 205 conditions per place. [2023-08-29 19:56:25,761 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 73 selfloop transitions, 4 changer transitions 1/80 dead transitions. [2023-08-29 19:56:25,762 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 80 transitions, 323 flow [2023-08-29 19:56:25,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:25,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:25,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 397 transitions. [2023-08-29 19:56:25,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.422790202342918 [2023-08-29 19:56:25,764 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 397 transitions. [2023-08-29 19:56:25,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 397 transitions. [2023-08-29 19:56:25,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:25,764 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 397 transitions. [2023-08-29 19:56:25,766 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.33333333333334) internal successors, (397), 3 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-29 19:56:25,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,768 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,769 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 103 flow. Second operand 3 states and 397 transitions. [2023-08-29 19:56:25,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 80 transitions, 323 flow [2023-08-29 19:56:25,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 80 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:25,771 INFO L231 Difference]: Finished difference. Result has 51 places, 50 transitions, 130 flow [2023-08-29 19:56:25,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=50} [2023-08-29 19:56:25,772 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-08-29 19:56:25,772 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 50 transitions, 130 flow [2023-08-29 19:56:25,773 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.66666666666667) internal successors, (320), 3 states have internal predecessors, (320), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,773 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:25,773 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:25,773 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-29 19:56:25,773 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:25,774 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:25,774 INFO L85 PathProgramCache]: Analyzing trace with hash 29758463, now seen corresponding path program 1 times [2023-08-29 19:56:25,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:25,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [745987728] [2023-08-29 19:56:25,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:25,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:25,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:25,878 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-29 19:56:25,878 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:25,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [745987728] [2023-08-29 19:56:25,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [745987728] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:25,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:25,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:25,879 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292182185] [2023-08-29 19:56:25,879 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:25,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:25,880 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:25,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:25,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:25,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 313 [2023-08-29 19:56:25,940 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 50 transitions, 130 flow. Second operand has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:25,940 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:25,941 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 313 [2023-08-29 19:56:25,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:26,097 INFO L130 PetriNetUnfolder]: 169/410 cut-off events. [2023-08-29 19:56:26,097 INFO L131 PetriNetUnfolder]: For 141/141 co-relation queries the response was YES. [2023-08-29 19:56:26,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 410 events. 169/410 cut-off events. For 141/141 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1785 event pairs, 110 based on Foata normal form. 0/260 useless extension candidates. Maximal degree in co-relation 948. Up to 238 conditions per place. [2023-08-29 19:56:26,100 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 70 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 19:56:26,100 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 75 transitions, 334 flow [2023-08-29 19:56:26,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:26,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:26,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-29 19:56:26,106 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4132055378061768 [2023-08-29 19:56:26,106 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-29 19:56:26,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-29 19:56:26,107 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:26,107 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-29 19:56:26,108 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,110 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,111 INFO L175 Difference]: Start difference. First operand has 51 places, 50 transitions, 130 flow. Second operand 3 states and 388 transitions. [2023-08-29 19:56:26,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 75 transitions, 334 flow [2023-08-29 19:56:26,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:26,115 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:26,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-29 19:56:26,116 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 19:56:26,116 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:26,117 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 106.0) internal successors, (424), 4 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:26,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:26,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-29 19:56:26,118 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:26,118 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:26,118 INFO L85 PathProgramCache]: Analyzing trace with hash 29758586, now seen corresponding path program 1 times [2023-08-29 19:56:26,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:26,118 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [111707660] [2023-08-29 19:56:26,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:26,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:26,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:26,275 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-29 19:56:26,276 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:26,276 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [111707660] [2023-08-29 19:56:26,276 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [111707660] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:26,276 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:26,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:26,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633562481] [2023-08-29 19:56:26,277 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:26,277 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:26,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:26,278 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:26,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:26,324 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-29 19:56:26,325 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 139 flow. Second operand has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,325 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:26,325 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-29 19:56:26,325 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:26,443 INFO L130 PetriNetUnfolder]: 159/397 cut-off events. [2023-08-29 19:56:26,444 INFO L131 PetriNetUnfolder]: For 59/59 co-relation queries the response was YES. [2023-08-29 19:56:26,444 INFO L83 FinitePrefix]: Finished finitePrefix Result has 906 conditions, 397 events. 159/397 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1742 event pairs, 127 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 895. Up to 370 conditions per place. [2023-08-29 19:56:26,446 INFO L137 encePairwiseOnDemand]: 309/313 looper letters, 44 selfloop transitions, 1 changer transitions 0/47 dead transitions. [2023-08-29 19:56:26,446 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 47 transitions, 223 flow [2023-08-29 19:56:26,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:26,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-29 19:56:26,450 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39403620873269435 [2023-08-29 19:56:26,450 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-29 19:56:26,450 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-29 19:56:26,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:26,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-29 19:56:26,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,454 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,455 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,455 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 139 flow. Second operand 3 states and 370 transitions. [2023-08-29 19:56:26,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 47 transitions, 223 flow [2023-08-29 19:56:26,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 47 transitions, 220 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:26,462 INFO L231 Difference]: Finished difference. Result has 47 places, 47 transitions, 132 flow [2023-08-29 19:56:26,462 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=132, PETRI_PLACES=47, PETRI_TRANSITIONS=47} [2023-08-29 19:56:26,464 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:56:26,465 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 47 transitions, 132 flow [2023-08-29 19:56:26,465 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 110.0) internal successors, (440), 4 states have internal predecessors, (440), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,465 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:26,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:26,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-29 19:56:26,465 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:26,466 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:26,466 INFO L85 PathProgramCache]: Analyzing trace with hash 29758464, now seen corresponding path program 1 times [2023-08-29 19:56:26,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:26,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [192112950] [2023-08-29 19:56:26,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:26,466 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:26,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:26,604 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-29 19:56:26,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:26,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [192112950] [2023-08-29 19:56:26,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [192112950] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:26,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:26,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:26,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942798263] [2023-08-29 19:56:26,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:26,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:26,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:26,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:26,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:26,651 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:56:26,652 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 47 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,652 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:26,652 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:56:26,652 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:26,744 INFO L130 PetriNetUnfolder]: 155/387 cut-off events. [2023-08-29 19:56:26,745 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 19:56:26,745 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 387 events. 155/387 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1700 event pairs, 123 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 867. Up to 360 conditions per place. [2023-08-29 19:56:26,747 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-29 19:56:26,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:26,748 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:26,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:26,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 19:56:26,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40042598509052185 [2023-08-29 19:56:26,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 19:56:26,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 19:56:26,750 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:26,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 19:56:26,751 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 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-29 19:56:26,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,754 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,754 INFO L175 Difference]: Start difference. First operand has 47 places, 47 transitions, 132 flow. Second operand 3 states and 376 transitions. [2023-08-29 19:56:26,754 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:26,755 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:26,756 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:26,756 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-29 19:56:26,757 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:26,757 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:26,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 113.0) internal successors, (452), 4 states have internal predecessors, (452), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:26,758 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:56:26,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-29 19:56:26,758 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:26,759 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:26,759 INFO L85 PathProgramCache]: Analyzing trace with hash 922513359, now seen corresponding path program 1 times [2023-08-29 19:56:26,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:26,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554741407] [2023-08-29 19:56:26,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:26,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:26,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:26,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-29 19:56:26,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:26,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554741407] [2023-08-29 19:56:26,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554741407] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:26,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:26,821 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:26,821 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [949620119] [2023-08-29 19:56:26,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:26,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:26,822 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:26,822 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:26,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:26,885 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 101 out of 313 [2023-08-29 19:56:26,886 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 129 flow. Second operand has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:26,886 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:26,887 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 101 of 313 [2023-08-29 19:56:26,887 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:27,014 INFO L130 PetriNetUnfolder]: 143/341 cut-off events. [2023-08-29 19:56:27,014 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 19:56:27,015 INFO L83 FinitePrefix]: Finished finitePrefix Result has 781 conditions, 341 events. 143/341 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1371 event pairs, 48 based on Foata normal form. 0/209 useless extension candidates. Maximal degree in co-relation 768. Up to 170 conditions per place. [2023-08-29 19:56:27,016 INFO L137 encePairwiseOnDemand]: 306/313 looper letters, 57 selfloop transitions, 8 changer transitions 0/67 dead transitions. [2023-08-29 19:56:27,016 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 67 transitions, 307 flow [2023-08-29 19:56:27,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:56:27,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:56:27,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 472 transitions. [2023-08-29 19:56:27,019 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3769968051118211 [2023-08-29 19:56:27,019 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 472 transitions. [2023-08-29 19:56:27,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 472 transitions. [2023-08-29 19:56:27,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:27,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 472 transitions. [2023-08-29 19:56:27,021 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 118.0) internal successors, (472), 4 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-29 19:56:27,023 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,024 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,024 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 129 flow. Second operand 4 states and 472 transitions. [2023-08-29 19:56:27,024 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 67 transitions, 307 flow [2023-08-29 19:56:27,025 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 67 transitions, 306 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:27,026 INFO L231 Difference]: Finished difference. Result has 45 places, 42 transitions, 138 flow [2023-08-29 19:56:27,026 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=138, PETRI_PLACES=45, PETRI_TRANSITIONS=42} [2023-08-29 19:56:27,027 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 19:56:27,027 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 42 transitions, 138 flow [2023-08-29 19:56:27,027 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 102.25) internal successors, (409), 4 states have internal predecessors, (409), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,027 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:27,028 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:27,028 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-29 19:56:27,028 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:27,028 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:27,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1775671262, now seen corresponding path program 1 times [2023-08-29 19:56:27,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:27,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278738733] [2023-08-29 19:56:27,029 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:27,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:27,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:27,052 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-29 19:56:27,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:27,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278738733] [2023-08-29 19:56:27,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278738733] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:27,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:27,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:27,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [243622191] [2023-08-29 19:56:27,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:27,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:27,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:27,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:27,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:27,060 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 313 [2023-08-29 19:56:27,060 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 42 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,061 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:27,061 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 313 [2023-08-29 19:56:27,061 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:27,140 INFO L130 PetriNetUnfolder]: 140/352 cut-off events. [2023-08-29 19:56:27,140 INFO L131 PetriNetUnfolder]: For 78/78 co-relation queries the response was YES. [2023-08-29 19:56:27,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 825 conditions, 352 events. 140/352 cut-off events. For 78/78 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1487 event pairs, 46 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 811. Up to 317 conditions per place. [2023-08-29 19:56:27,142 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 39 selfloop transitions, 2 changer transitions 0/43 dead transitions. [2023-08-29 19:56:27,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 43 transitions, 224 flow [2023-08-29 19:56:27,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:27,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:27,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 376 transitions. [2023-08-29 19:56:27,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40042598509052185 [2023-08-29 19:56:27,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 376 transitions. [2023-08-29 19:56:27,145 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 376 transitions. [2023-08-29 19:56:27,145 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:27,145 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 376 transitions. [2023-08-29 19:56:27,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 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-29 19:56:27,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,148 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,148 INFO L175 Difference]: Start difference. First operand has 45 places, 42 transitions, 138 flow. Second operand 3 states and 376 transitions. [2023-08-29 19:56:27,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 43 transitions, 224 flow [2023-08-29 19:56:27,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 43 transitions, 206 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-08-29 19:56:27,150 INFO L231 Difference]: Finished difference. Result has 44 places, 41 transitions, 122 flow [2023-08-29 19:56:27,150 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=44, PETRI_TRANSITIONS=41} [2023-08-29 19:56:27,151 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -23 predicate places. [2023-08-29 19:56:27,151 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 41 transitions, 122 flow [2023-08-29 19:56:27,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.33333333333333) internal successors, (346), 3 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:27,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:27,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-29 19:56:27,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:27,152 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:27,153 INFO L85 PathProgramCache]: Analyzing trace with hash -898009828, now seen corresponding path program 1 times [2023-08-29 19:56:27,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:27,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1951165546] [2023-08-29 19:56:27,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:27,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:27,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:27,303 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-29 19:56:27,304 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:27,304 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1951165546] [2023-08-29 19:56:27,304 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1951165546] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:27,304 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:27,304 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:27,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917426318] [2023-08-29 19:56:27,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:27,305 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-29 19:56:27,305 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:27,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-29 19:56:27,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-08-29 19:56:27,354 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:56:27,355 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 41 transitions, 122 flow. Second operand has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,355 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:27,355 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:56:27,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:27,431 INFO L130 PetriNetUnfolder]: 135/338 cut-off events. [2023-08-29 19:56:27,431 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:56:27,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 772 conditions, 338 events. 135/338 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1409 event pairs, 106 based on Foata normal form. 0/218 useless extension candidates. Maximal degree in co-relation 759. Up to 313 conditions per place. [2023-08-29 19:56:27,433 INFO L137 encePairwiseOnDemand]: 311/313 looper letters, 37 selfloop transitions, 1 changer transitions 0/40 dead transitions. [2023-08-29 19:56:27,433 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 40 transitions, 196 flow [2023-08-29 19:56:27,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:27,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:27,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 370 transitions. [2023-08-29 19:56:27,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39403620873269435 [2023-08-29 19:56:27,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 370 transitions. [2023-08-29 19:56:27,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 370 transitions. [2023-08-29 19:56:27,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:27,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 370 transitions. [2023-08-29 19:56:27,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,438 INFO L175 Difference]: Start difference. First operand has 44 places, 41 transitions, 122 flow. Second operand 3 states and 370 transitions. [2023-08-29 19:56:27,438 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 40 transitions, 196 flow [2023-08-29 19:56:27,440 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 40 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:27,441 INFO L231 Difference]: Finished difference. Result has 43 places, 40 transitions, 118 flow [2023-08-29 19:56:27,442 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=43, PETRI_TRANSITIONS=40} [2023-08-29 19:56:27,444 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -24 predicate places. [2023-08-29 19:56:27,444 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 40 transitions, 118 flow [2023-08-29 19:56:27,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 114.0) internal successors, (456), 4 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:27,444 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:27,444 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-29 19:56:27,445 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:27,445 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:27,445 INFO L85 PathProgramCache]: Analyzing trace with hash -2068501142, now seen corresponding path program 1 times [2023-08-29 19:56:27,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:27,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719598909] [2023-08-29 19:56:27,445 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:27,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:27,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:27,608 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-29 19:56:27,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:27,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719598909] [2023-08-29 19:56:27,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719598909] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:27,609 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:27,609 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:56:27,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936864002] [2023-08-29 19:56:27,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:27,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:56:27,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:27,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:56:27,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:56:27,696 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 106 out of 313 [2023-08-29 19:56:27,697 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 40 transitions, 118 flow. Second operand has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,697 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:27,697 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 106 of 313 [2023-08-29 19:56:27,697 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:27,804 INFO L130 PetriNetUnfolder]: 123/295 cut-off events. [2023-08-29 19:56:27,804 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2023-08-29 19:56:27,804 INFO L83 FinitePrefix]: Finished finitePrefix Result has 676 conditions, 295 events. 123/295 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1115 event pairs, 48 based on Foata normal form. 0/196 useless extension candidates. Maximal degree in co-relation 663. Up to 114 conditions per place. [2023-08-29 19:56:27,806 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 48 selfloop transitions, 9 changer transitions 0/59 dead transitions. [2023-08-29 19:56:27,806 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 59 transitions, 274 flow [2023-08-29 19:56:27,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:56:27,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:56:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 484 transitions. [2023-08-29 19:56:27,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3865814696485623 [2023-08-29 19:56:27,825 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 484 transitions. [2023-08-29 19:56:27,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 484 transitions. [2023-08-29 19:56:27,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:27,825 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 484 transitions. [2023-08-29 19:56:27,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 121.0) internal successors, (484), 4 states have internal predecessors, (484), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,829 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,829 INFO L175 Difference]: Start difference. First operand has 43 places, 40 transitions, 118 flow. Second operand 4 states and 484 transitions. [2023-08-29 19:56:27,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 59 transitions, 274 flow [2023-08-29 19:56:27,830 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 59 transitions, 273 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:27,831 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 153 flow [2023-08-29 19:56:27,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=153, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-08-29 19:56:27,832 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -22 predicate places. [2023-08-29 19:56:27,832 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 153 flow [2023-08-29 19:56:27,835 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 107.8) internal successors, (539), 5 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:27,835 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:27,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-29 19:56:27,835 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:27,836 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:27,836 INFO L85 PathProgramCache]: Analyzing trace with hash 740294123, now seen corresponding path program 1 times [2023-08-29 19:56:27,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:27,838 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445709131] [2023-08-29 19:56:27,838 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:27,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:27,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:27,884 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-29 19:56:27,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:27,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445709131] [2023-08-29 19:56:27,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445709131] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:27,885 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:27,885 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:27,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139092619] [2023-08-29 19:56:27,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:27,886 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:27,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:27,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:27,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:27,892 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 112 out of 313 [2023-08-29 19:56:27,893 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 153 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,893 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:27,893 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 112 of 313 [2023-08-29 19:56:27,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:27,962 INFO L130 PetriNetUnfolder]: 120/292 cut-off events. [2023-08-29 19:56:27,962 INFO L131 PetriNetUnfolder]: For 133/133 co-relation queries the response was YES. [2023-08-29 19:56:27,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 726 conditions, 292 events. 120/292 cut-off events. For 133/133 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 1136 event pairs, 52 based on Foata normal form. 3/201 useless extension candidates. Maximal degree in co-relation 710. Up to 240 conditions per place. [2023-08-29 19:56:27,963 INFO L137 encePairwiseOnDemand]: 310/313 looper letters, 40 selfloop transitions, 2 changer transitions 1/45 dead transitions. [2023-08-29 19:56:27,964 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 251 flow [2023-08-29 19:56:27,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:27,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:27,965 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-29 19:56:27,966 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3993610223642173 [2023-08-29 19:56:27,966 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-29 19:56:27,966 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-29 19:56:27,966 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:27,966 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-29 19:56:27,967 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,969 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 153 flow. Second operand 3 states and 375 transitions. [2023-08-29 19:56:27,969 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 251 flow [2023-08-29 19:56:27,970 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 45 transitions, 243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:27,973 INFO L231 Difference]: Finished difference. Result has 46 places, 40 transitions, 153 flow [2023-08-29 19:56:27,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=153, PETRI_PLACES=46, PETRI_TRANSITIONS=40} [2023-08-29 19:56:27,974 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:27,974 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 40 transitions, 153 flow [2023-08-29 19:56:27,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:27,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:27,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:27,975 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-29 19:56:27,975 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:27,975 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:27,975 INFO L85 PathProgramCache]: Analyzing trace with hash 740445031, now seen corresponding path program 1 times [2023-08-29 19:56:27,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:27,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304968422] [2023-08-29 19:56:27,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:27,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:27,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:28,060 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-29 19:56:28,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:28,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304968422] [2023-08-29 19:56:28,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304968422] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:28,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:28,061 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:56:28,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877761972] [2023-08-29 19:56:28,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:28,062 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:56:28,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:28,062 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:56:28,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:56:28,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 313 [2023-08-29 19:56:28,111 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 40 transitions, 153 flow. Second operand has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,111 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:28,111 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 313 [2023-08-29 19:56:28,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:28,256 INFO L130 PetriNetUnfolder]: 126/315 cut-off events. [2023-08-29 19:56:28,256 INFO L131 PetriNetUnfolder]: For 86/86 co-relation queries the response was YES. [2023-08-29 19:56:28,256 INFO L83 FinitePrefix]: Finished finitePrefix Result has 780 conditions, 315 events. 126/315 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1189 event pairs, 20 based on Foata normal form. 3/218 useless extension candidates. Maximal degree in co-relation 762. Up to 181 conditions per place. [2023-08-29 19:56:28,257 INFO L137 encePairwiseOnDemand]: 305/313 looper letters, 58 selfloop transitions, 5 changer transitions 0/65 dead transitions. [2023-08-29 19:56:28,258 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 65 transitions, 335 flow [2023-08-29 19:56:28,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:56:28,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:56:28,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 675 transitions. [2023-08-29 19:56:28,260 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.35942492012779553 [2023-08-29 19:56:28,260 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 675 transitions. [2023-08-29 19:56:28,261 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 675 transitions. [2023-08-29 19:56:28,261 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:28,261 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 675 transitions. [2023-08-29 19:56:28,263 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 112.5) internal successors, (675), 6 states have internal predecessors, (675), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,265 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,266 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 313.0) internal successors, (2191), 7 states have internal predecessors, (2191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,266 INFO L175 Difference]: Start difference. First operand has 46 places, 40 transitions, 153 flow. Second operand 6 states and 675 transitions. [2023-08-29 19:56:28,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 65 transitions, 335 flow [2023-08-29 19:56:28,267 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 65 transitions, 331 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:28,268 INFO L231 Difference]: Finished difference. Result has 52 places, 41 transitions, 167 flow [2023-08-29 19:56:28,268 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=167, PETRI_PLACES=52, PETRI_TRANSITIONS=41} [2023-08-29 19:56:28,269 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -15 predicate places. [2023-08-29 19:56:28,269 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 41 transitions, 167 flow [2023-08-29 19:56:28,269 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 104.2) internal successors, (521), 5 states have internal predecessors, (521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,269 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:28,269 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:28,270 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-29 19:56:28,270 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:28,270 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:28,270 INFO L85 PathProgramCache]: Analyzing trace with hash -1396868387, now seen corresponding path program 1 times [2023-08-29 19:56:28,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:28,270 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746839285] [2023-08-29 19:56:28,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:28,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:28,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:28,357 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-29 19:56:28,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:28,358 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746839285] [2023-08-29 19:56:28,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746839285] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:28,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:28,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:28,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771784143] [2023-08-29 19:56:28,359 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:28,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:28,360 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:28,360 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:28,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:28,393 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 313 [2023-08-29 19:56:28,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 41 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:28,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 313 [2023-08-29 19:56:28,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:28,456 INFO L130 PetriNetUnfolder]: 116/284 cut-off events. [2023-08-29 19:56:28,456 INFO L131 PetriNetUnfolder]: For 89/89 co-relation queries the response was YES. [2023-08-29 19:56:28,456 INFO L83 FinitePrefix]: Finished finitePrefix Result has 767 conditions, 284 events. 116/284 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1027 event pairs, 27 based on Foata normal form. 0/212 useless extension candidates. Maximal degree in co-relation 746. Up to 188 conditions per place. [2023-08-29 19:56:28,458 INFO L137 encePairwiseOnDemand]: 307/313 looper letters, 34 selfloop transitions, 7 changer transitions 0/42 dead transitions. [2023-08-29 19:56:28,458 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 42 transitions, 257 flow [2023-08-29 19:56:28,458 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:28,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:28,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 347 transitions. [2023-08-29 19:56:28,460 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.369542066027689 [2023-08-29 19:56:28,460 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 347 transitions. [2023-08-29 19:56:28,460 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 347 transitions. [2023-08-29 19:56:28,460 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:28,460 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 347 transitions. [2023-08-29 19:56:28,461 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,463 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,463 INFO L175 Difference]: Start difference. First operand has 52 places, 41 transitions, 167 flow. Second operand 3 states and 347 transitions. [2023-08-29 19:56:28,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 42 transitions, 257 flow [2023-08-29 19:56:28,464 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 42 transitions, 243 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-08-29 19:56:28,465 INFO L231 Difference]: Finished difference. Result has 48 places, 38 transitions, 161 flow [2023-08-29 19:56:28,465 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=147, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=48, PETRI_TRANSITIONS=38} [2023-08-29 19:56:28,466 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:28,466 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 38 transitions, 161 flow [2023-08-29 19:56:28,467 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.33333333333333) internal successors, (325), 3 states have internal predecessors, (325), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,467 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:28,467 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:28,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-08-29 19:56:28,467 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:28,468 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:28,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1396868386, now seen corresponding path program 1 times [2023-08-29 19:56:28,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:28,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2072584977] [2023-08-29 19:56:28,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:28,468 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:28,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:28,635 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-29 19:56:28,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:28,636 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2072584977] [2023-08-29 19:56:28,636 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2072584977] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:28,636 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:28,636 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282896327] [2023-08-29 19:56:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:28,637 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:28,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:28,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:28,666 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 313 [2023-08-29 19:56:28,667 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 38 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,667 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:28,667 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 313 [2023-08-29 19:56:28,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:28,727 INFO L130 PetriNetUnfolder]: 106/258 cut-off events. [2023-08-29 19:56:28,727 INFO L131 PetriNetUnfolder]: For 100/100 co-relation queries the response was YES. [2023-08-29 19:56:28,727 INFO L83 FinitePrefix]: Finished finitePrefix Result has 715 conditions, 258 events. 106/258 cut-off events. For 100/100 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 868 event pairs, 27 based on Foata normal form. 0/204 useless extension candidates. Maximal degree in co-relation 696. Up to 162 conditions per place. [2023-08-29 19:56:28,729 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 32 selfloop transitions, 7 changer transitions 0/40 dead transitions. [2023-08-29 19:56:28,729 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 40 transitions, 249 flow [2023-08-29 19:56:28,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:28,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:28,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 359 transitions. [2023-08-29 19:56:28,730 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38232161874334397 [2023-08-29 19:56:28,731 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 359 transitions. [2023-08-29 19:56:28,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 359 transitions. [2023-08-29 19:56:28,731 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:28,731 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 359 transitions. [2023-08-29 19:56:28,732 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.66666666666667) internal successors, (359), 3 states have internal predecessors, (359), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,733 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,734 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 313.0) internal successors, (1252), 4 states have internal predecessors, (1252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,734 INFO L175 Difference]: Start difference. First operand has 48 places, 38 transitions, 161 flow. Second operand 3 states and 359 transitions. [2023-08-29 19:56:28,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 40 transitions, 249 flow [2023-08-29 19:56:28,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 40 transitions, 235 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:28,736 INFO L231 Difference]: Finished difference. Result has 46 places, 36 transitions, 157 flow [2023-08-29 19:56:28,736 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=143, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=157, PETRI_PLACES=46, PETRI_TRANSITIONS=36} [2023-08-29 19:56:28,737 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:28,737 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 36 transitions, 157 flow [2023-08-29 19:56:28,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,737 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:28,737 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:28,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-29 19:56:28,737 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:28,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:28,738 INFO L85 PathProgramCache]: Analyzing trace with hash -167064850, now seen corresponding path program 1 times [2023-08-29 19:56:28,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:28,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [509319359] [2023-08-29 19:56:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:28,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:28,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:28,871 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-29 19:56:28,872 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-29 19:56:28,872 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [509319359] [2023-08-29 19:56:28,872 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [509319359] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:28,872 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:28,872 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-08-29 19:56:28,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1539588195] [2023-08-29 19:56:28,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:28,873 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:56:28,873 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-29 19:56:28,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:56:28,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:56:28,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 97 out of 313 [2023-08-29 19:56:28,949 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 36 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:28,949 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:28,950 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 97 of 313 [2023-08-29 19:56:28,950 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:29,013 INFO L130 PetriNetUnfolder]: 100/240 cut-off events. [2023-08-29 19:56:29,013 INFO L131 PetriNetUnfolder]: For 98/98 co-relation queries the response was YES. [2023-08-29 19:56:29,014 INFO L83 FinitePrefix]: Finished finitePrefix Result has 675 conditions, 240 events. 100/240 cut-off events. For 98/98 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 769 event pairs, 21 based on Foata normal form. 0/198 useless extension candidates. Maximal degree in co-relation 656. Up to 162 conditions per place. [2023-08-29 19:56:29,015 INFO L137 encePairwiseOnDemand]: 308/313 looper letters, 30 selfloop transitions, 8 changer transitions 0/39 dead transitions. [2023-08-29 19:56:29,015 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 39 transitions, 245 flow [2023-08-29 19:56:29,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-08-29 19:56:29,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-08-29 19:56:29,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 418 transitions. [2023-08-29 19:56:29,017 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.33386581469648563 [2023-08-29 19:56:29,017 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 418 transitions. [2023-08-29 19:56:29,017 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 418 transitions. [2023-08-29 19:56:29,017 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:29,018 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 418 transitions. [2023-08-29 19:56:29,019 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 104.5) internal successors, (418), 4 states have internal predecessors, (418), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:29,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:29,021 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 313.0) internal successors, (1565), 5 states have internal predecessors, (1565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:29,021 INFO L175 Difference]: Start difference. First operand has 46 places, 36 transitions, 157 flow. Second operand 4 states and 418 transitions. [2023-08-29 19:56:29,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 39 transitions, 245 flow [2023-08-29 19:56:29,022 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 39 transitions, 231 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:29,022 INFO L231 Difference]: Finished difference. Result has 46 places, 35 transitions, 157 flow [2023-08-29 19:56:29,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=313, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=157, PETRI_PLACES=46, PETRI_TRANSITIONS=35} [2023-08-29 19:56:29,023 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:29,023 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 35 transitions, 157 flow [2023-08-29 19:56:29,023 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 99.66666666666667) internal successors, (598), 6 states have internal predecessors, (598), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:29,023 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:29,024 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:29,024 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-08-29 19:56:29,024 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thr1Err38ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:29,024 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:29,025 INFO L85 PathProgramCache]: Analyzing trace with hash -167064848, now seen corresponding path program 1 times [2023-08-29 19:56:29,025 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-29 19:56:29,025 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1054760683] [2023-08-29 19:56:29,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:29,025 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-29 19:56:29,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:29,056 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:56:29,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:29,098 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-08-29 19:56:29,098 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:56:29,099 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (80 of 81 remaining) [2023-08-29 19:56:29,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2023-08-29 19:56:29,105 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2023-08-29 19:56:29,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2023-08-29 19:56:29,108 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (75 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2023-08-29 19:56:29,109 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2023-08-29 19:56:29,110 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (53 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2023-08-29 19:56:29,111 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2023-08-29 19:56:29,112 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (41 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2023-08-29 19:56:29,113 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2023-08-29 19:56:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2023-08-29 19:56:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2023-08-29 19:56:29,114 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2023-08-29 19:56:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2023-08-29 19:56:29,115 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (22 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (21 of 81 remaining) [2023-08-29 19:56:29,116 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2023-08-29 19:56:29,117 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2023-08-29 19:56:29,118 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2023-08-29 19:56:29,119 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (0 of 81 remaining) [2023-08-29 19:56:29,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-29 19:56:29,120 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:29,122 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 19:56:29,126 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:56:29,126 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:56:29,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:56:29 BasicIcfg [2023-08-29 19:56:29,176 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:56:29,177 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:56:29,177 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:56:29,177 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:56:29,178 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:19" (3/4) ... [2023-08-29 19:56:29,180 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:56:29,180 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:56:29,180 INFO L158 Benchmark]: Toolchain (without parser) took 11377.25ms. Allocated memory was 71.3MB in the beginning and 188.7MB in the end (delta: 117.4MB). Free memory was 38.4MB in the beginning and 111.8MB in the end (delta: -73.3MB). Peak memory consumption was 43.4MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,180 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 71.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:29,181 INFO L158 Benchmark]: CACSL2BoogieTranslator took 547.45ms. Allocated memory is still 71.3MB. Free memory was 38.2MB in the beginning and 39.2MB in the end (delta: -987.0kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,181 INFO L158 Benchmark]: Boogie Procedure Inliner took 68.24ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,181 INFO L158 Benchmark]: Boogie Preprocessor took 55.26ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,181 INFO L158 Benchmark]: RCFGBuilder took 851.93ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 34.7MB in the beginning and 59.8MB in the end (delta: -25.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,182 INFO L158 Benchmark]: TraceAbstraction took 9845.98ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 59.1MB in the beginning and 111.8MB in the end (delta: -52.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. [2023-08-29 19:56:29,182 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 188.7MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:29,183 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.20ms. Allocated memory is still 71.3MB. Free memory is still 48.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 547.45ms. Allocated memory is still 71.3MB. Free memory was 38.2MB in the beginning and 39.2MB in the end (delta: -987.0kB). Peak memory consumption was 10.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 68.24ms. Allocated memory is still 71.3MB. Free memory was 38.9MB in the beginning and 36.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.26ms. Allocated memory is still 71.3MB. Free memory was 36.6MB in the beginning and 34.7MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 851.93ms. Allocated memory was 71.3MB in the beginning and 88.1MB in the end (delta: 16.8MB). Free memory was 34.7MB in the beginning and 59.8MB in the end (delta: -25.0MB). Peak memory consumption was 16.1MB. Max. memory is 16.1GB. * TraceAbstraction took 9845.98ms. Allocated memory was 88.1MB in the beginning and 188.7MB in the end (delta: 100.7MB). Free memory was 59.1MB in the beginning and 111.8MB in the end (delta: -52.6MB). Peak memory consumption was 47.5MB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 188.7MB. Free memory is still 111.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 5.3s, 153 PlacesBefore, 67 PlacesAfterwards, 160 TransitionsBefore, 71 TransitionsAfterwards, 4248 CoEnabledTransitionPairs, 5 FixpointIterations, 22 TrivialSequentialCompositions, 108 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 20 ConcurrentYvCompositions, 3 ChoiceCompositions, 153 TotalNumberOfCompositions, 8906 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 5032, independent: 4729, independent conditional: 0, independent unconditional: 4729, dependent: 303, dependent conditional: 0, dependent unconditional: 303, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2143, independent: 2074, independent conditional: 0, independent unconditional: 2074, dependent: 69, dependent conditional: 0, dependent unconditional: 69, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 5032, independent: 2655, independent conditional: 0, independent unconditional: 2655, dependent: 234, dependent conditional: 0, dependent unconditional: 234, unknown: 2143, unknown conditional: 0, unknown unconditional: 2143] , Statistics on independence cache: Total cache size (in pairs): 293, Positive cache size: 253, Positive conditional cache size: 0, Positive unconditional cache size: 253, Negative cache size: 40, Negative conditional cache size: 0, Negative unconditional cache size: 40, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 759]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 759. Possible FailurePath: [L714] 0 int memory[(2*960+1)]; [L715] 0 int next_alloc_idx = 1; [L716] 0 int m = 0; [L717] 0 int top; [L769] 0 int m2 = 0; [L770] 0 int state = 0; [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={7:0}, top={4:0}] [L789] COND TRUE 0 1 [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-2, state=0, t={7:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 [L777] RET 1 EBStack_init() [L778] 1 state = 1 [L779] 1 case 1: [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; [L763] 1 int arg = __VERIFIER_nondet_int(); [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*960+1)) [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() VAL [\old(d)=0, casret={6:0}, d=0, index_malloc()=1, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L743] COND FALSE 1 !(newTop == 0) [L746] EXPR 1 memory[newTop+0] [L746] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 [L748] EXPR 1 \read(top) [L748] 1 oldTop = top [L749] EXPR 1 memory[newTop+1] [L749] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) [L751] COND TRUE 1 casret==1 VAL [\old(d)=0, \read(casret)=1, casret={6:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L752] 1 return 1; [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) VAL [arg=0, m2={5:0}, m={3:0}, next_alloc_idx=3, push(arg)=1, r=1, state=1, top={4:0}] [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4: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: 749]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 261 locations, 82 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: 9.6s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 5.4s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1555 SdHoareTripleChecker+Valid, 1.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1024 mSDsluCounter, 205 SdHoareTripleChecker+Invalid, 1.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 94 mSDsCounter, 117 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1794 IncrementalHoareTripleChecker+Invalid, 1911 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 117 mSolverCounterUnsat, 111 mSDtfsCounter, 1794 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 37 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=167occurred in iteration=11, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 125 NumberOfCodeBlocks, 125 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 95 ConstructedInterpolants, 0 QuantifiedInterpolants, 540 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 19:56:29,200 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-ext/26_stack_cas_longest-1.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 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations AFTER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-29 19:56:31,047 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-29 19:56:31,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-29 19:56:31,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-29 19:56:31,075 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-29 19:56:31,076 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-29 19:56:31,078 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-29 19:56:31,079 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-29 19:56:31,081 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-29 19:56:31,081 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-29 19:56:31,082 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-29 19:56:31,083 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-29 19:56:31,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-29 19:56:31,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-29 19:56:31,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-29 19:56:31,087 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-29 19:56:31,087 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-29 19:56:31,088 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-29 19:56:31,090 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-29 19:56:31,091 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-29 19:56:31,093 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-29 19:56:31,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-29 19:56:31,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-29 19:56:31,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-29 19:56:31,100 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-29 19:56:31,100 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-29 19:56:31,103 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-29 19:56:31,104 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-29 19:56:31,105 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-29 19:56:31,106 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-29 19:56:31,108 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-29 19:56:31,111 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-29 19:56:31,112 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-29 19:56:31,113 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-29 19:56:31,115 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-29 19:56:31,118 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-29 19:56:31,128 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-29 19:56:31,131 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-29 19:56:31,131 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-29 19:56:31,132 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-29 19:56:31,133 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-29 19:56:31,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-08-29 19:56:31,170 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-29 19:56:31,170 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-29 19:56:31,171 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-29 19:56:31,171 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-29 19:56:31,172 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-29 19:56:31,172 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-29 19:56:31,173 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-29 19:56:31,174 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-29 19:56:31,174 INFO L138 SettingsManager]: * Use SBE=true [2023-08-29 19:56:31,174 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-29 19:56:31,175 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-29 19:56:31,176 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-29 19:56:31,176 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-29 19:56:31,176 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-29 19:56:31,176 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-29 19:56:31,176 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2023-08-29 19:56:31,177 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-08-29 19:56:31,177 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-29 19:56:31,177 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-29 19:56:31,177 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-29 19:56:31,177 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-29 19:56:31,177 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-29 19:56:31,178 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:56:31,178 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-29 19:56:31,178 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-29 19:56:31,178 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2023-08-29 19:56:31,178 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-08-29 19:56:31,179 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-29 19:56:31,179 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-29 19:56:31,179 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-29 19:56:31,179 INFO L138 SettingsManager]: * Logic for external solver=AUFBV [2023-08-29 19:56:31,179 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-29 19:56:31,179 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 -> 8c0827ac193c1e2b03d5ccf1e60b62c7d6ff1b4feade2c409a6c7ca2cebf9412 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 -> AFTER [2023-08-29 19:56:31,482 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-29 19:56:31,503 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-29 19:56:31,508 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-29 19:56:31,509 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-29 19:56:31,510 INFO L275 PluginConnector]: CDTParser initialized [2023-08-29 19:56:31,511 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-29 19:56:32,555 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-29 19:56:32,767 INFO L351 CDTParser]: Found 1 translation units. [2023-08-29 19:56:32,768 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-ext/26_stack_cas_longest-1.i [2023-08-29 19:56:32,777 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c0be69f/e43014bf061648bc81f4af549a439338/FLAG689f2f792 [2023-08-29 19:56:32,792 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2c0be69f/e43014bf061648bc81f4af549a439338 [2023-08-29 19:56:32,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-29 19:56:32,796 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-29 19:56:32,798 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-29 19:56:32,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-29 19:56:32,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-29 19:56:32,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:56:32" (1/1) ... [2023-08-29 19:56:32,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@23233c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:32, skipping insertion in model container [2023-08-29 19:56:32,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.08 07:56:32" (1/1) ... [2023-08-29 19:56:32,810 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-29 19:56:32,842 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-29 19:56:33,206 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-ext/26_stack_cas_longest-1.i[31167,31180] [2023-08-29 19:56:33,215 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:56:33,232 INFO L203 MainTranslator]: Completed pre-run [2023-08-29 19:56:33,285 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-ext/26_stack_cas_longest-1.i[31167,31180] [2023-08-29 19:56:33,290 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-29 19:56:33,341 INFO L208 MainTranslator]: Completed translation [2023-08-29 19:56:33,342 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33 WrapperNode [2023-08-29 19:56:33,342 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-29 19:56:33,343 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-29 19:56:33,343 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-29 19:56:33,343 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-29 19:56:33,349 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,380 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,418 INFO L138 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 16, calls inlined = 19, statements flattened = 187 [2023-08-29 19:56:33,418 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-29 19:56:33,419 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-29 19:56:33,420 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-29 19:56:33,420 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-29 19:56:33,427 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,428 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,442 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,442 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,451 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,462 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,464 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,470 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,473 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-29 19:56:33,478 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-29 19:56:33,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-29 19:56:33,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-29 19:56:33,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (1/1) ... [2023-08-29 19:56:33,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-29 19:56:33,494 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-29 19:56:33,506 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-29 19:56:33,528 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-29 19:56:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-08-29 19:56:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure thr1 [2023-08-29 19:56:33,542 INFO L138 BoogieDeclarations]: Found implementation of procedure thr1 [2023-08-29 19:56:33,542 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4 [2023-08-29 19:56:33,543 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-29 19:56:33,544 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-29 19:56:33,545 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-29 19:56:33,671 INFO L236 CfgBuilder]: Building ICFG [2023-08-29 19:56:33,673 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-29 19:56:34,178 INFO L277 CfgBuilder]: Performing block encoding [2023-08-29 19:56:34,419 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-29 19:56:34,419 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-08-29 19:56:34,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:34 BoogieIcfgContainer [2023-08-29 19:56:34,422 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-29 19:56:34,425 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-29 19:56:34,425 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-29 19:56:34,428 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-29 19:56:34,428 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.08 07:56:32" (1/3) ... [2023-08-29 19:56:34,428 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77948a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:56:34, skipping insertion in model container [2023-08-29 19:56:34,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.08 07:56:33" (2/3) ... [2023-08-29 19:56:34,429 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@77948a9b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.08 07:56:34, skipping insertion in model container [2023-08-29 19:56:34,429 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:34" (3/3) ... [2023-08-29 19:56:34,430 INFO L112 eAbstractionObserver]: Analyzing ICFG 26_stack_cas_longest-1.i [2023-08-29 19:56:34,446 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-29 19:56:34,446 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 42 error locations. [2023-08-29 19:56:34,447 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-29 19:56:34,558 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-08-29 19:56:34,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,709 INFO L130 PetriNetUnfolder]: 11/173 cut-off events. [2023-08-29 19:56:34,709 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:34,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 11/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-29 19:56:34,715 INFO L82 GeneralOperation]: Start removeDead. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,720 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,723 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-29 19:56:34,731 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,733 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 151 places, 158 transitions, 321 flow [2023-08-29 19:56:34,763 INFO L130 PetriNetUnfolder]: 11/173 cut-off events. [2023-08-29 19:56:34,763 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:34,765 INFO L83 FinitePrefix]: Finished finitePrefix Result has 178 conditions, 173 events. 11/173 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 11. Compared 331 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 132. Up to 4 conditions per place. [2023-08-29 19:56:34,767 INFO L119 LiptonReduction]: Number of co-enabled transitions 4140 [2023-08-29 19:56:43,336 INFO L134 LiptonReduction]: Checked pairs total: 8741 [2023-08-29 19:56:43,337 INFO L136 LiptonReduction]: Total number of compositions: 148 [2023-08-29 19:56:43,349 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-29 19:56:43,354 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;@5404ee35, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-29 19:56:43,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2023-08-29 19:56:43,357 INFO L130 PetriNetUnfolder]: 0/2 cut-off events. [2023-08-29 19:56:43,357 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:43,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:43,358 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:43,358 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:43,362 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:43,362 INFO L85 PathProgramCache]: Analyzing trace with hash 30235, now seen corresponding path program 1 times [2023-08-29 19:56:43,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:43,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [113469768] [2023-08-29 19:56:43,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:43,377 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-29 19:56:43,377 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:43,389 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-29 19:56:43,392 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-29 19:56:43,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:43,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2023-08-29 19:56:43,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:43,528 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-29 19:56:43,552 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-29 19:56:43,552 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:43,554 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:43,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [113469768] [2023-08-29 19:56:43,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [113469768] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:43,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:43,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:43,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123309536] [2023-08-29 19:56:43,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:43,580 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:43,584 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:43,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:43,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:43,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 306 [2023-08-29 19:56:43,675 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 71 transitions, 147 flow. Second operand has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:43,675 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:43,675 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 306 [2023-08-29 19:56:43,676 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:44,021 INFO L130 PetriNetUnfolder]: 239/532 cut-off events. [2023-08-29 19:56:44,022 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-29 19:56:44,023 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1060 conditions, 532 events. 239/532 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2363 event pairs, 122 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 1027. Up to 274 conditions per place. [2023-08-29 19:56:44,026 INFO L137 encePairwiseOnDemand]: 282/306 looper letters, 76 selfloop transitions, 4 changer transitions 0/82 dead transitions. [2023-08-29 19:56:44,027 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 82 transitions, 329 flow [2023-08-29 19:56:44,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:44,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:44,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-08-29 19:56:44,040 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4651416122004357 [2023-08-29 19:56:44,041 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-08-29 19:56:44,042 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-08-29 19:56:44,043 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:44,045 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-08-29 19:56:44,048 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,055 INFO L175 Difference]: Start difference. First operand has 67 places, 71 transitions, 147 flow. Second operand 3 states and 427 transitions. [2023-08-29 19:56:44,056 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 82 transitions, 329 flow [2023-08-29 19:56:44,058 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 82 transitions, 329 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-29 19:56:44,060 INFO L231 Difference]: Finished difference. Result has 51 places, 52 transitions, 133 flow [2023-08-29 19:56:44,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=133, PETRI_PLACES=51, PETRI_TRANSITIONS=52} [2023-08-29 19:56:44,064 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -16 predicate places. [2023-08-29 19:56:44,065 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 52 transitions, 133 flow [2023-08-29 19:56:44,065 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:44,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-08-29 19:56:44,078 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-29 19:56:44,277 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-29 19:56:44,277 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:44,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:44,278 INFO L85 PathProgramCache]: Analyzing trace with hash 30233, now seen corresponding path program 1 times [2023-08-29 19:56:44,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:44,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [653979690] [2023-08-29 19:56:44,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:44,279 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-29 19:56:44,279 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:44,280 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-29 19:56:44,283 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-29 19:56:44,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:44,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 4 conjunts are in the unsatisfiable core [2023-08-29 19:56:44,341 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:44,350 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-29 19:56:44,358 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-29 19:56:44,358 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:44,358 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:44,359 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [653979690] [2023-08-29 19:56:44,359 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [653979690] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:44,359 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:44,359 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:44,359 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2105534172] [2023-08-29 19:56:44,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:44,360 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:44,361 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:44,361 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:44,361 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:44,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:44,424 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 52 transitions, 133 flow. Second operand has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,424 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:44,425 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:44,425 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:44,601 INFO L130 PetriNetUnfolder]: 172/402 cut-off events. [2023-08-29 19:56:44,601 INFO L131 PetriNetUnfolder]: For 137/137 co-relation queries the response was YES. [2023-08-29 19:56:44,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 941 conditions, 402 events. 172/402 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1672 event pairs, 120 based on Foata normal form. 61/319 useless extension candidates. Maximal degree in co-relation 905. Up to 385 conditions per place. [2023-08-29 19:56:44,606 INFO L137 encePairwiseOnDemand]: 304/306 looper letters, 47 selfloop transitions, 1 changer transitions 1/51 dead transitions. [2023-08-29 19:56:44,606 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 51 transitions, 229 flow [2023-08-29 19:56:44,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:44,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:44,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-29 19:56:44,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-08-29 19:56:44,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-29 19:56:44,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-29 19:56:44,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:44,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-29 19:56:44,614 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,616 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,617 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,617 INFO L175 Difference]: Start difference. First operand has 51 places, 52 transitions, 133 flow. Second operand 3 states and 374 transitions. [2023-08-29 19:56:44,618 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 51 transitions, 229 flow [2023-08-29 19:56:44,620 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 51 transitions, 221 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:44,621 INFO L231 Difference]: Finished difference. Result has 50 places, 50 transitions, 123 flow [2023-08-29 19:56:44,621 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=123, PETRI_PLACES=50, PETRI_TRANSITIONS=50} [2023-08-29 19:56:44,622 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -17 predicate places. [2023-08-29 19:56:44,622 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 50 transitions, 123 flow [2023-08-29 19:56:44,623 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 109.66666666666667) internal successors, (329), 3 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:44,623 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:44,623 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:44,637 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-29 19:56:44,831 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-29 19:56:44,832 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:44,832 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:44,833 INFO L85 PathProgramCache]: Analyzing trace with hash 29079456, now seen corresponding path program 1 times [2023-08-29 19:56:44,833 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:44,833 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [688826967] [2023-08-29 19:56:44,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:44,834 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-29 19:56:44,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:44,838 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-29 19:56:44,841 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-29 19:56:44,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:44,907 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:56:44,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:44,930 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:44,931 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-29 19:56:44,967 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-29 19:56:44,967 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:44,968 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:44,968 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [688826967] [2023-08-29 19:56:44,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [688826967] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:44,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:44,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:44,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417046259] [2023-08-29 19:56:44,969 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:44,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:44,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:44,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:44,970 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:45,042 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:45,043 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 50 transitions, 123 flow. Second operand has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,043 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:45,043 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:45,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:45,280 INFO L130 PetriNetUnfolder]: 169/414 cut-off events. [2023-08-29 19:56:45,280 INFO L131 PetriNetUnfolder]: For 51/51 co-relation queries the response was YES. [2023-08-29 19:56:45,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 930 conditions, 414 events. 169/414 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1814 event pairs, 110 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 921. Up to 238 conditions per place. [2023-08-29 19:56:45,283 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 70 selfloop transitions, 3 changer transitions 0/75 dead transitions. [2023-08-29 19:56:45,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 75 transitions, 323 flow [2023-08-29 19:56:45,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:45,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:45,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-29 19:56:45,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4357298474945534 [2023-08-29 19:56:45,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-29 19:56:45,286 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-29 19:56:45,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:45,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-29 19:56:45,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,290 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,290 INFO L175 Difference]: Start difference. First operand has 50 places, 50 transitions, 123 flow. Second operand 3 states and 400 transitions. [2023-08-29 19:56:45,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 75 transitions, 323 flow [2023-08-29 19:56:45,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 75 transitions, 322 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:45,292 INFO L231 Difference]: Finished difference. Result has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:45,292 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=49, PETRI_TRANSITIONS=50} [2023-08-29 19:56:45,293 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -18 predicate places. [2023-08-29 19:56:45,293 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 50 transitions, 139 flow [2023-08-29 19:56:45,294 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 110.33333333333333) internal successors, (331), 3 states have internal predecessors, (331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,294 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:45,294 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:45,307 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-29 19:56:45,502 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-29 19:56:45,503 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:45,503 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:45,503 INFO L85 PathProgramCache]: Analyzing trace with hash 29079457, now seen corresponding path program 1 times [2023-08-29 19:56:45,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:45,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2015541800] [2023-08-29 19:56:45,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:45,504 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-29 19:56:45,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:45,506 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-29 19:56:45,509 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-29 19:56:45,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:45,578 INFO L263 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 10 conjunts are in the unsatisfiable core [2023-08-29 19:56:45,579 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:45,613 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:45,614 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-29 19:56:45,649 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-29 19:56:45,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:45,650 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:45,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2015541800] [2023-08-29 19:56:45,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2015541800] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:45,650 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:45,650 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:45,650 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1693410755] [2023-08-29 19:56:45,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:45,651 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:45,651 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:45,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:45,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:45,699 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-08-29 19:56:45,700 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 50 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 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-29 19:56:45,700 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:45,700 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-08-29 19:56:45,700 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:45,862 INFO L130 PetriNetUnfolder]: 165/418 cut-off events. [2023-08-29 19:56:45,863 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:56:45,863 INFO L83 FinitePrefix]: Finished finitePrefix Result has 952 conditions, 418 events. 165/418 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1908 event pairs, 133 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 941. Up to 386 conditions per place. [2023-08-29 19:56:45,865 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 45 selfloop transitions, 1 changer transitions 0/48 dead transitions. [2023-08-29 19:56:45,865 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 48 transitions, 227 flow [2023-08-29 19:56:45,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:45,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:45,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 382 transitions. [2023-08-29 19:56:45,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41612200435729846 [2023-08-29 19:56:45,867 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 382 transitions. [2023-08-29 19:56:45,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 382 transitions. [2023-08-29 19:56:45,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:45,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 382 transitions. [2023-08-29 19:56:45,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 127.33333333333333) internal successors, (382), 3 states have internal predecessors, (382), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,871 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,871 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:45,872 INFO L175 Difference]: Start difference. First operand has 49 places, 50 transitions, 139 flow. Second operand 3 states and 382 transitions. [2023-08-29 19:56:45,872 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 48 transitions, 227 flow [2023-08-29 19:56:45,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 48 transitions, 224 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:45,873 INFO L231 Difference]: Finished difference. Result has 48 places, 48 transitions, 134 flow [2023-08-29 19:56:45,874 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=132, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=134, PETRI_PLACES=48, PETRI_TRANSITIONS=48} [2023-08-29 19:56:45,874 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:45,875 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 48 transitions, 134 flow [2023-08-29 19:56:45,875 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 114.33333333333333) internal successors, (343), 3 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-29 19:56:45,875 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:45,875 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-08-29 19:56:45,885 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-29 19:56:46,084 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-29 19:56:46,084 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:46,084 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:46,084 INFO L85 PathProgramCache]: Analyzing trace with hash 29079569, now seen corresponding path program 1 times [2023-08-29 19:56:46,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:46,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1314496418] [2023-08-29 19:56:46,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:46,085 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-29 19:56:46,085 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:46,087 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-29 19:56:46,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 (6)] Waiting until timeout for monitored process [2023-08-29 19:56:46,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:46,156 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:56:46,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:46,181 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:46,182 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-29 19:56:46,222 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-29 19:56:46,223 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:46,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:46,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1314496418] [2023-08-29 19:56:46,223 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1314496418] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:46,223 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:46,223 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:46,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302582370] [2023-08-29 19:56:46,224 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:46,224 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:46,224 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:46,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:46,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:46,276 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 306 [2023-08-29 19:56:46,277 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 48 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,277 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:46,277 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 306 [2023-08-29 19:56:46,277 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:46,427 INFO L130 PetriNetUnfolder]: 155/389 cut-off events. [2023-08-29 19:56:46,427 INFO L131 PetriNetUnfolder]: For 55/55 co-relation queries the response was YES. [2023-08-29 19:56:46,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 389 events. 155/389 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1714 event pairs, 123 based on Foata normal form. 0/236 useless extension candidates. Maximal degree in co-relation 871. Up to 360 conditions per place. [2023-08-29 19:56:46,429 INFO L137 encePairwiseOnDemand]: 302/306 looper letters, 42 selfloop transitions, 1 changer transitions 0/45 dead transitions. [2023-08-29 19:56:46,429 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:46,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:46,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:46,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 374 transitions. [2023-08-29 19:56:46,431 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4074074074074074 [2023-08-29 19:56:46,431 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 374 transitions. [2023-08-29 19:56:46,431 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 374 transitions. [2023-08-29 19:56:46,432 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:46,432 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 374 transitions. [2023-08-29 19:56:46,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,434 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,435 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,435 INFO L175 Difference]: Start difference. First operand has 48 places, 48 transitions, 134 flow. Second operand 3 states and 374 transitions. [2023-08-29 19:56:46,435 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 45 transitions, 214 flow [2023-08-29 19:56:46,437 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 45 transitions, 213 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:46,438 INFO L231 Difference]: Finished difference. Result has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:46,438 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=127, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=129, PETRI_PLACES=46, PETRI_TRANSITIONS=45} [2023-08-29 19:56:46,440 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:46,441 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 45 transitions, 129 flow [2023-08-29 19:56:46,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.33333333333333) internal successors, (337), 3 states have internal predecessors, (337), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,441 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:46,441 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-29 19:56:46,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-08-29 19:56:46,655 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-29 19:56:46,656 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:46,656 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:46,656 INFO L85 PathProgramCache]: Analyzing trace with hash 901463964, now seen corresponding path program 1 times [2023-08-29 19:56:46,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:46,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [24643659] [2023-08-29 19:56:46,657 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:46,657 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-29 19:56:46,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:46,658 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-29 19:56:46,660 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-29 19:56:46,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:46,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:56:46,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:46,743 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:46,744 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-29 19:56:46,780 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-29 19:56:46,781 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:46,781 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:46,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [24643659] [2023-08-29 19:56:46,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [24643659] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:46,781 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:46,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:46,782 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213144865] [2023-08-29 19:56:46,782 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:46,782 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:46,782 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:46,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:46,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:46,834 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 306 [2023-08-29 19:56:46,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 45 transitions, 129 flow. Second operand has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:46,835 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:46,835 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 306 [2023-08-29 19:56:46,835 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:47,029 INFO L130 PetriNetUnfolder]: 149/360 cut-off events. [2023-08-29 19:56:47,030 INFO L131 PetriNetUnfolder]: For 52/52 co-relation queries the response was YES. [2023-08-29 19:56:47,030 INFO L83 FinitePrefix]: Finished finitePrefix Result has 823 conditions, 360 events. 149/360 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1496 event pairs, 92 based on Foata normal form. 0/216 useless extension candidates. Maximal degree in co-relation 810. Up to 222 conditions per place. [2023-08-29 19:56:47,032 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 61 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2023-08-29 19:56:47,032 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 66 transitions, 299 flow [2023-08-29 19:56:47,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:47,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:47,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-29 19:56:47,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.420479302832244 [2023-08-29 19:56:47,034 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-29 19:56:47,034 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-29 19:56:47,035 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:47,035 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-29 19:56:47,036 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,038 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,038 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,038 INFO L175 Difference]: Start difference. First operand has 46 places, 45 transitions, 129 flow. Second operand 3 states and 386 transitions. [2023-08-29 19:56:47,038 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 66 transitions, 299 flow [2023-08-29 19:56:47,039 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 66 transitions, 298 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:47,040 INFO L231 Difference]: Finished difference. Result has 47 places, 44 transitions, 139 flow [2023-08-29 19:56:47,040 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=139, PETRI_PLACES=47, PETRI_TRANSITIONS=44} [2023-08-29 19:56:47,041 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:56:47,041 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 44 transitions, 139 flow [2023-08-29 19:56:47,041 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 108.66666666666667) internal successors, (326), 3 states have internal predecessors, (326), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,042 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:47,042 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:47,055 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-29 19:56:47,250 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-29 19:56:47,251 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:47,251 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:47,251 INFO L85 PathProgramCache]: Analyzing trace with hash -1273083600, now seen corresponding path program 1 times [2023-08-29 19:56:47,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:47,251 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1367112679] [2023-08-29 19:56:47,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:47,252 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-29 19:56:47,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:47,253 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-29 19:56:47,257 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-29 19:56:47,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:47,329 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2023-08-29 19:56:47,329 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:47,340 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-29 19:56:47,341 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:47,341 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:47,342 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1367112679] [2023-08-29 19:56:47,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1367112679] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:47,343 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:47,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:47,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844948777] [2023-08-29 19:56:47,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:47,345 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:47,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:47,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:47,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:47,351 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 306 [2023-08-29 19:56:47,352 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 44 transitions, 139 flow. Second operand has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,352 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:47,352 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 306 [2023-08-29 19:56:47,352 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:47,497 INFO L130 PetriNetUnfolder]: 146/369 cut-off events. [2023-08-29 19:56:47,497 INFO L131 PetriNetUnfolder]: For 69/69 co-relation queries the response was YES. [2023-08-29 19:56:47,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 369 events. 146/369 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1620 event pairs, 50 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 850. Up to 333 conditions per place. [2023-08-29 19:56:47,499 INFO L137 encePairwiseOnDemand]: 303/306 looper letters, 41 selfloop transitions, 2 changer transitions 0/45 dead transitions. [2023-08-29 19:56:47,499 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 45 transitions, 229 flow [2023-08-29 19:56:47,500 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:47,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:47,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 372 transitions. [2023-08-29 19:56:47,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40522875816993464 [2023-08-29 19:56:47,502 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 372 transitions. [2023-08-29 19:56:47,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 372 transitions. [2023-08-29 19:56:47,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:47,503 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 372 transitions. [2023-08-29 19:56:47,504 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 124.0) internal successors, (372), 3 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-29 19:56:47,505 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,505 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,506 INFO L175 Difference]: Start difference. First operand has 47 places, 44 transitions, 139 flow. Second operand 3 states and 372 transitions. [2023-08-29 19:56:47,506 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 45 transitions, 229 flow [2023-08-29 19:56:47,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 45 transitions, 223 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:47,507 INFO L231 Difference]: Finished difference. Result has 47 places, 43 transitions, 135 flow [2023-08-29 19:56:47,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=135, PETRI_PLACES=47, PETRI_TRANSITIONS=43} [2023-08-29 19:56:47,508 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -20 predicate places. [2023-08-29 19:56:47,508 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 43 transitions, 135 flow [2023-08-29 19:56:47,509 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 113.33333333333333) internal successors, (340), 3 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,509 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:47,509 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:47,521 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-29 19:56:47,718 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-29 19:56:47,719 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:47,719 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:47,719 INFO L85 PathProgramCache]: Analyzing trace with hash -915458820, now seen corresponding path program 1 times [2023-08-29 19:56:47,719 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:47,720 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1945025393] [2023-08-29 19:56:47,720 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:47,720 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-29 19:56:47,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:47,721 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-29 19:56:47,722 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-29 19:56:47,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:47,805 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 13 conjunts are in the unsatisfiable core [2023-08-29 19:56:47,807 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:47,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-08-29 19:56:47,829 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-29 19:56:47,904 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-08-29 19:56:47,904 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-29 19:56:47,914 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-29 19:56:47,914 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:47,915 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:47,915 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1945025393] [2023-08-29 19:56:47,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1945025393] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:47,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:47,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:47,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536170833] [2023-08-29 19:56:47,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:47,916 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:47,916 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:47,916 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:47,917 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:47,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 113 out of 306 [2023-08-29 19:56:47,964 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 43 transitions, 135 flow. Second operand has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:47,964 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:47,964 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 113 of 306 [2023-08-29 19:56:47,964 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:48,083 INFO L130 PetriNetUnfolder]: 141/355 cut-off events. [2023-08-29 19:56:48,083 INFO L131 PetriNetUnfolder]: For 57/57 co-relation queries the response was YES. [2023-08-29 19:56:48,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 831 conditions, 355 events. 141/355 cut-off events. For 57/57 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1514 event pairs, 112 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 816. Up to 329 conditions per place. [2023-08-29 19:56:48,085 INFO L137 encePairwiseOnDemand]: 304/306 looper letters, 39 selfloop transitions, 1 changer transitions 0/42 dead transitions. [2023-08-29 19:56:48,086 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 213 flow [2023-08-29 19:56:48,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:48,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:48,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 375 transitions. [2023-08-29 19:56:48,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4084967320261438 [2023-08-29 19:56:48,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 375 transitions. [2023-08-29 19:56:48,088 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 375 transitions. [2023-08-29 19:56:48,088 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:48,088 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 375 transitions. [2023-08-29 19:56:48,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 125.0) internal successors, (375), 3 states have internal predecessors, (375), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,091 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,091 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,091 INFO L175 Difference]: Start difference. First operand has 47 places, 43 transitions, 135 flow. Second operand 3 states and 375 transitions. [2023-08-29 19:56:48,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 213 flow [2023-08-29 19:56:48,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 42 transitions, 209 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:48,093 INFO L231 Difference]: Finished difference. Result has 46 places, 42 transitions, 131 flow [2023-08-29 19:56:48,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=131, PETRI_PLACES=46, PETRI_TRANSITIONS=42} [2023-08-29 19:56:48,094 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -21 predicate places. [2023-08-29 19:56:48,094 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 42 transitions, 131 flow [2023-08-29 19:56:48,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 115.66666666666667) internal successors, (347), 3 states have internal predecessors, (347), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:48,094 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:48,109 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-29 19:56:48,307 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-29 19:56:48,307 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:48,308 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:48,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1685547449, now seen corresponding path program 1 times [2023-08-29 19:56:48,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:48,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1348436478] [2023-08-29 19:56:48,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:48,308 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-29 19:56:48,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:48,309 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-29 19:56:48,311 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-29 19:56:48,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:48,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 9 conjunts are in the unsatisfiable core [2023-08-29 19:56:48,415 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:48,445 INFO L321 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-08-29 19:56:48,447 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-08-29 19:56:48,502 INFO L321 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-08-29 19:56:48,502 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-29 19:56:48,520 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-29 19:56:48,520 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:48,520 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:48,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1348436478] [2023-08-29 19:56:48,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1348436478] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:48,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:48,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-29 19:56:48,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974829939] [2023-08-29 19:56:48,521 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:48,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:48,522 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:48,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:48,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:48,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 306 [2023-08-29 19:56:48,573 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 42 transitions, 131 flow. Second operand has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,573 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:48,573 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 306 [2023-08-29 19:56:48,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:48,761 INFO L130 PetriNetUnfolder]: 135/328 cut-off events. [2023-08-29 19:56:48,762 INFO L131 PetriNetUnfolder]: For 48/48 co-relation queries the response was YES. [2023-08-29 19:56:48,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 328 events. 135/328 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1339 event pairs, 82 based on Foata normal form. 0/215 useless extension candidates. Maximal degree in co-relation 756. Up to 214 conditions per place. [2023-08-29 19:56:48,764 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 55 selfloop transitions, 3 changer transitions 0/60 dead transitions. [2023-08-29 19:56:48,764 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 60 transitions, 283 flow [2023-08-29 19:56:48,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:48,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:48,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 386 transitions. [2023-08-29 19:56:48,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.420479302832244 [2023-08-29 19:56:48,767 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 386 transitions. [2023-08-29 19:56:48,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 386 transitions. [2023-08-29 19:56:48,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:48,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 386 transitions. [2023-08-29 19:56:48,768 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 128.66666666666666) internal successors, (386), 3 states have internal predecessors, (386), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,770 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,770 INFO L175 Difference]: Start difference. First operand has 46 places, 42 transitions, 131 flow. Second operand 3 states and 386 transitions. [2023-08-29 19:56:48,770 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 60 transitions, 283 flow [2023-08-29 19:56:48,772 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 60 transitions, 282 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:48,773 INFO L231 Difference]: Finished difference. Result has 48 places, 42 transitions, 145 flow [2023-08-29 19:56:48,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=145, PETRI_PLACES=48, PETRI_TRANSITIONS=42} [2023-08-29 19:56:48,774 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -19 predicate places. [2023-08-29 19:56:48,774 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 42 transitions, 145 flow [2023-08-29 19:56:48,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 112.0) internal successors, (336), 3 states have internal predecessors, (336), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:48,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:48,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:48,785 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-29 19:56:48,984 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-29 19:56:48,985 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting thr1Err22ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:48,985 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:48,985 INFO L85 PathProgramCache]: Analyzing trace with hash 608605728, now seen corresponding path program 1 times [2023-08-29 19:56:48,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:48,985 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2096985528] [2023-08-29 19:56:48,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:48,986 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-29 19:56:48,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:48,986 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-29 19:56:48,987 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-29 19:56:49,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:49,079 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 6 conjunts are in the unsatisfiable core [2023-08-29 19:56:49,080 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:49,105 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-29 19:56:49,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:49,105 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:49,105 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2096985528] [2023-08-29 19:56:49,106 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2096985528] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:49,106 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:49,106 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-29 19:56:49,106 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2128366221] [2023-08-29 19:56:49,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:49,107 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-08-29 19:56:49,107 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:49,107 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-08-29 19:56:49,107 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-08-29 19:56:49,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 103 out of 306 [2023-08-29 19:56:49,133 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 42 transitions, 145 flow. Second operand has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:49,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:49,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 103 of 306 [2023-08-29 19:56:49,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:49,399 INFO L130 PetriNetUnfolder]: 142/358 cut-off events. [2023-08-29 19:56:49,399 INFO L131 PetriNetUnfolder]: For 63/63 co-relation queries the response was YES. [2023-08-29 19:56:49,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 854 conditions, 358 events. 142/358 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1451 event pairs, 24 based on Foata normal form. 6/254 useless extension candidates. Maximal degree in co-relation 837. Up to 213 conditions per place. [2023-08-29 19:56:49,401 INFO L137 encePairwiseOnDemand]: 298/306 looper letters, 62 selfloop transitions, 5 changer transitions 1/70 dead transitions. [2023-08-29 19:56:49,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 70 transitions, 339 flow [2023-08-29 19:56:49,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-08-29 19:56:49,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-08-29 19:56:49,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 686 transitions. [2023-08-29 19:56:49,404 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.37363834422657954 [2023-08-29 19:56:49,404 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 686 transitions. [2023-08-29 19:56:49,404 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 686 transitions. [2023-08-29 19:56:49,405 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:49,405 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 686 transitions. [2023-08-29 19:56:49,406 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 114.33333333333333) internal successors, (686), 6 states have internal predecessors, (686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:49,409 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 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-29 19:56:49,409 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 306.0) internal successors, (2142), 7 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-29 19:56:49,409 INFO L175 Difference]: Start difference. First operand has 48 places, 42 transitions, 145 flow. Second operand 6 states and 686 transitions. [2023-08-29 19:56:49,409 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 70 transitions, 339 flow [2023-08-29 19:56:49,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 70 transitions, 335 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:49,411 INFO L231 Difference]: Finished difference. Result has 55 places, 45 transitions, 169 flow [2023-08-29 19:56:49,411 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=131, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=169, PETRI_PLACES=55, PETRI_TRANSITIONS=45} [2023-08-29 19:56:49,412 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-08-29 19:56:49,412 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 45 transitions, 169 flow [2023-08-29 19:56:49,413 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 105.2) internal successors, (526), 5 states have internal predecessors, (526), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:49,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:49,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:49,425 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-29 19:56:49,622 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-29 19:56:49,622 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thr1Err25ASSERT_VIOLATIONARRAY_INDEX === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:49,622 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:49,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1686909463, now seen corresponding path program 1 times [2023-08-29 19:56:49,623 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:49,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1142167823] [2023-08-29 19:56:49,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:49,623 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-29 19:56:49,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:49,624 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-29 19:56:49,624 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-29 19:56:49,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:49,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-29 19:56:49,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:49,761 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-29 19:56:49,762 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:49,762 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:49,762 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1142167823] [2023-08-29 19:56:49,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1142167823] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:49,763 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:49,763 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-29 19:56:49,763 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513218899] [2023-08-29 19:56:49,763 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:49,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-29 19:56:49,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:49,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-29 19:56:49,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-08-29 19:56:49,837 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 98 out of 306 [2023-08-29 19:56:49,837 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 45 transitions, 169 flow. Second operand has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:49,837 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:49,837 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 98 of 306 [2023-08-29 19:56:49,837 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:50,155 INFO L130 PetriNetUnfolder]: 140/353 cut-off events. [2023-08-29 19:56:50,155 INFO L131 PetriNetUnfolder]: For 50/50 co-relation queries the response was YES. [2023-08-29 19:56:50,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 905 conditions, 353 events. 140/353 cut-off events. For 50/50 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 1440 event pairs, 22 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 884. Up to 213 conditions per place. [2023-08-29 19:56:50,157 INFO L137 encePairwiseOnDemand]: 299/306 looper letters, 63 selfloop transitions, 6 changer transitions 1/72 dead transitions. [2023-08-29 19:56:50,157 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 379 flow [2023-08-29 19:56:50,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-08-29 19:56:50,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-08-29 19:56:50,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 754 transitions. [2023-08-29 19:56:50,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3520074696545285 [2023-08-29 19:56:50,160 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 754 transitions. [2023-08-29 19:56:50,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 754 transitions. [2023-08-29 19:56:50,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:50,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 754 transitions. [2023-08-29 19:56:50,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 107.71428571428571) internal successors, (754), 7 states have internal predecessors, (754), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,165 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,166 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 306.0) internal successors, (2448), 8 states have internal predecessors, (2448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,166 INFO L175 Difference]: Start difference. First operand has 55 places, 45 transitions, 169 flow. Second operand 7 states and 754 transitions. [2023-08-29 19:56:50,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 379 flow [2023-08-29 19:56:50,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 72 transitions, 377 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-29 19:56:50,168 INFO L231 Difference]: Finished difference. Result has 61 places, 46 transitions, 187 flow [2023-08-29 19:56:50,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=187, PETRI_PLACES=61, PETRI_TRANSITIONS=46} [2023-08-29 19:56:50,169 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -6 predicate places. [2023-08-29 19:56:50,169 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 46 transitions, 187 flow [2023-08-29 19:56:50,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 100.0) internal successors, (600), 6 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:50,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:50,181 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-29 19:56:50,379 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-29 19:56:50,379 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:50,379 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:50,379 INFO L85 PathProgramCache]: Analyzing trace with hash 754586524, now seen corresponding path program 1 times [2023-08-29 19:56:50,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:50,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [341481784] [2023-08-29 19:56:50,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:50,380 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-29 19:56:50,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:50,381 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-29 19:56:50,384 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-29 19:56:50,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:50,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 5 conjunts are in the unsatisfiable core [2023-08-29 19:56:50,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:50,494 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-29 19:56:50,509 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-29 19:56:50,509 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:50,509 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:50,509 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [341481784] [2023-08-29 19:56:50,509 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [341481784] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:50,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:50,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:50,510 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1478746276] [2023-08-29 19:56:50,510 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:50,510 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:50,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:50,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:50,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:50,557 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 306 [2023-08-29 19:56:50,557 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 46 transitions, 187 flow. Second operand has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,557 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:50,558 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 306 [2023-08-29 19:56:50,558 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:50,675 INFO L130 PetriNetUnfolder]: 130/322 cut-off events. [2023-08-29 19:56:50,675 INFO L131 PetriNetUnfolder]: For 58/58 co-relation queries the response was YES. [2023-08-29 19:56:50,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 879 conditions, 322 events. 130/322 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1302 event pairs, 27 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 856. Up to 225 conditions per place. [2023-08-29 19:56:50,677 INFO L137 encePairwiseOnDemand]: 300/306 looper letters, 39 selfloop transitions, 7 changer transitions 0/47 dead transitions. [2023-08-29 19:56:50,677 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 47 transitions, 287 flow [2023-08-29 19:56:50,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:50,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:50,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 345 transitions. [2023-08-29 19:56:50,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3758169934640523 [2023-08-29 19:56:50,679 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 345 transitions. [2023-08-29 19:56:50,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 345 transitions. [2023-08-29 19:56:50,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:50,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 345 transitions. [2023-08-29 19:56:50,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 115.0) internal successors, (345), 3 states have internal predecessors, (345), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,682 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,682 INFO L175 Difference]: Start difference. First operand has 61 places, 46 transitions, 187 flow. Second operand 3 states and 345 transitions. [2023-08-29 19:56:50,682 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 47 transitions, 287 flow [2023-08-29 19:56:50,683 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 47 transitions, 277 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-08-29 19:56:50,684 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 185 flow [2023-08-29 19:56:50,684 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=185, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-08-29 19:56:50,685 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -12 predicate places. [2023-08-29 19:56:50,685 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 185 flow [2023-08-29 19:56:50,685 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 106.33333333333333) internal successors, (319), 3 states have internal predecessors, (319), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:50,685 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:50,686 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:50,695 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 (13)] Ended with exit code 0 [2023-08-29 19:56:50,895 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-29 19:56:50,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:50,896 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:50,896 INFO L85 PathProgramCache]: Analyzing trace with hash 754586525, now seen corresponding path program 1 times [2023-08-29 19:56:50,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:50,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [500976085] [2023-08-29 19:56:50,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:50,896 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-29 19:56:50,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:50,897 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-29 19:56:50,898 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-29 19:56:50,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-29 19:56:51,002 INFO L263 TraceCheckSpWp]: Trace formula consists of 168 conjuncts, 8 conjunts are in the unsatisfiable core [2023-08-29 19:56:51,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-29 19:56:51,010 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-29 19:56:51,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-29 19:56:51,036 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-08-29 19:56:51,036 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-08-29 19:56:51,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [500976085] [2023-08-29 19:56:51,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [500976085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-29 19:56:51,037 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-29 19:56:51,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-08-29 19:56:51,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213756664] [2023-08-29 19:56:51,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-29 19:56:51,037 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-29 19:56:51,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-08-29 19:56:51,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-29 19:56:51,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-29 19:56:51,086 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 306 [2023-08-29 19:56:51,087 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 185 flow. Second operand has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:51,087 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-29 19:56:51,087 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 306 [2023-08-29 19:56:51,087 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-29 19:56:51,206 INFO L130 PetriNetUnfolder]: 120/296 cut-off events. [2023-08-29 19:56:51,206 INFO L131 PetriNetUnfolder]: For 82/82 co-relation queries the response was YES. [2023-08-29 19:56:51,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 832 conditions, 296 events. 120/296 cut-off events. For 82/82 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1126 event pairs, 27 based on Foata normal form. 0/238 useless extension candidates. Maximal degree in co-relation 810. Up to 199 conditions per place. [2023-08-29 19:56:51,208 INFO L137 encePairwiseOnDemand]: 301/306 looper letters, 37 selfloop transitions, 7 changer transitions 0/45 dead transitions. [2023-08-29 19:56:51,208 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 45 transitions, 283 flow [2023-08-29 19:56:51,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-29 19:56:51,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-29 19:56:51,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 357 transitions. [2023-08-29 19:56:51,210 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3888888888888889 [2023-08-29 19:56:51,210 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 357 transitions. [2023-08-29 19:56:51,210 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 357 transitions. [2023-08-29 19:56:51,211 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-29 19:56:51,211 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 357 transitions. [2023-08-29 19:56:51,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 119.0) internal successors, (357), 3 states have internal predecessors, (357), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:51,213 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:51,213 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 306.0) internal successors, (1224), 4 states have internal predecessors, (1224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:51,214 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 185 flow. Second operand 3 states and 357 transitions. [2023-08-29 19:56:51,214 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 45 transitions, 283 flow [2023-08-29 19:56:51,215 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 269 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-08-29 19:56:51,216 INFO L231 Difference]: Finished difference. Result has 53 places, 41 transitions, 181 flow [2023-08-29 19:56:51,216 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=306, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=181, PETRI_PLACES=53, PETRI_TRANSITIONS=41} [2023-08-29 19:56:51,216 INFO L281 CegarLoopForPetriNet]: 67 programPoint places, -14 predicate places. [2023-08-29 19:56:51,216 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 41 transitions, 181 flow [2023-08-29 19:56:51,217 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 111.33333333333333) internal successors, (334), 3 states have internal predecessors, (334), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-29 19:56:51,217 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-29 19:56:51,217 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:51,231 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-29 19:56:51,427 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-29 19:56:51,427 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thr1Err38ASSERT_VIOLATIONMEMORY_LEAK === [thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2023-08-29 19:56:51,427 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-29 19:56:51,427 INFO L85 PathProgramCache]: Analyzing trace with hash 29209707, now seen corresponding path program 1 times [2023-08-29 19:56:51,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-08-29 19:56:51,428 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [795263417] [2023-08-29 19:56:51,428 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-29 19:56:51,428 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-29 19:56:51,428 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2023-08-29 19:56:51,429 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-29 19:56:51,432 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-29 19:56:51,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:51,581 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-08-29 19:56:51,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-08-29 19:56:51,748 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-08-29 19:56:51,748 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-08-29 19:56:51,749 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (80 of 81 remaining) [2023-08-29 19:56:51,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 81 remaining) [2023-08-29 19:56:51,750 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (75 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 81 remaining) [2023-08-29 19:56:51,751 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 81 remaining) [2023-08-29 19:56:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 81 remaining) [2023-08-29 19:56:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 81 remaining) [2023-08-29 19:56:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 81 remaining) [2023-08-29 19:56:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 81 remaining) [2023-08-29 19:56:51,752 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 81 remaining) [2023-08-29 19:56:51,764 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 81 remaining) [2023-08-29 19:56:51,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 81 remaining) [2023-08-29 19:56:51,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 81 remaining) [2023-08-29 19:56:51,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 81 remaining) [2023-08-29 19:56:51,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 81 remaining) [2023-08-29 19:56:51,765 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 81 remaining) [2023-08-29 19:56:51,766 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (53 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 81 remaining) [2023-08-29 19:56:51,767 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 81 remaining) [2023-08-29 19:56:51,768 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err25ASSERT_VIOLATIONARRAY_INDEX (41 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 81 remaining) [2023-08-29 19:56:51,769 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 81 remaining) [2023-08-29 19:56:51,770 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 81 remaining) [2023-08-29 19:56:51,771 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err38ASSERT_VIOLATIONMEMORY_LEAK (22 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_LEAK (21 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 81 remaining) [2023-08-29 19:56:51,772 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 81 remaining) [2023-08-29 19:56:51,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 81 remaining) [2023-08-29 19:56:51,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 81 remaining) [2023-08-29 19:56:51,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 81 remaining) [2023-08-29 19:56:51,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 81 remaining) [2023-08-29 19:56:51,775 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 81 remaining) [2023-08-29 19:56:51,776 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 81 remaining) [2023-08-29 19:56:51,777 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location thr1Err22ASSERT_VIOLATIONARRAY_INDEX (0 of 81 remaining) [2023-08-29 19:56:51,809 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-29 19:56:51,983 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-29 19:56:51,983 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-29 19:56:51,985 INFO L307 ceAbstractionStarter]: Result for error location AllErrorsAtOnce was UNSAFE,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN,UNKNOWN (1/2) [2023-08-29 19:56:51,989 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-08-29 19:56:51,989 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-08-29 19:56:52,043 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.08 07:56:52 BasicIcfg [2023-08-29 19:56:52,043 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-08-29 19:56:52,043 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-08-29 19:56:52,044 INFO L271 PluginConnector]: Initializing Witness Printer... [2023-08-29 19:56:52,044 INFO L275 PluginConnector]: Witness Printer initialized [2023-08-29 19:56:52,044 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.08 07:56:34" (3/4) ... [2023-08-29 19:56:52,046 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-08-29 19:56:52,047 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-08-29 19:56:52,047 INFO L158 Benchmark]: Toolchain (without parser) took 19250.71ms. Allocated memory was 67.1MB in the beginning and 130.0MB in the end (delta: 62.9MB). Free memory was 36.0MB in the beginning and 90.1MB in the end (delta: -54.1MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,047 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 50.3MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:52,048 INFO L158 Benchmark]: CACSL2BoogieTranslator took 544.21ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 44.0MB in the end (delta: -8.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,048 INFO L158 Benchmark]: Boogie Procedure Inliner took 75.53ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 41.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,048 INFO L158 Benchmark]: Boogie Preprocessor took 57.52ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 39.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,049 INFO L158 Benchmark]: RCFGBuilder took 944.32ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.3MB in the beginning and 56.5MB in the end (delta: -17.2MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,049 INFO L158 Benchmark]: TraceAbstraction took 17618.18ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 55.8MB in the beginning and 90.1MB in the end (delta: -34.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. [2023-08-29 19:56:52,049 INFO L158 Benchmark]: Witness Printer took 3.28ms. Allocated memory is still 130.0MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-08-29 19:56:52,051 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 50.3MB. Free memory was 28.9MB in the beginning and 28.9MB in the end (delta: 33.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 544.21ms. Allocated memory is still 67.1MB. Free memory was 35.8MB in the beginning and 44.0MB in the end (delta: -8.2MB). Peak memory consumption was 7.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 75.53ms. Allocated memory is still 67.1MB. Free memory was 44.0MB in the beginning and 41.4MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 57.52ms. Allocated memory is still 67.1MB. Free memory was 41.4MB in the beginning and 39.3MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 944.32ms. Allocated memory was 67.1MB in the beginning and 88.1MB in the end (delta: 21.0MB). Free memory was 39.3MB in the beginning and 56.5MB in the end (delta: -17.2MB). Peak memory consumption was 36.0MB. Max. memory is 16.1GB. * TraceAbstraction took 17618.18ms. Allocated memory was 88.1MB in the beginning and 130.0MB in the end (delta: 41.9MB). Free memory was 55.8MB in the beginning and 90.1MB in the end (delta: -34.2MB). Peak memory consumption was 71.1MB. Max. memory is 16.1GB. * Witness Printer took 3.28ms. Allocated memory is still 130.0MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 8.6s, 151 PlacesBefore, 67 PlacesAfterwards, 158 TransitionsBefore, 71 TransitionsAfterwards, 4140 CoEnabledTransitionPairs, 5 FixpointIterations, 23 TrivialSequentialCompositions, 104 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 18 ConcurrentYvCompositions, 3 ChoiceCompositions, 148 TotalNumberOfCompositions, 8741 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 4949, independent: 4645, independent conditional: 0, independent unconditional: 4645, dependent: 304, dependent conditional: 0, dependent unconditional: 304, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 2074, independent: 2007, independent conditional: 0, independent unconditional: 2007, dependent: 67, dependent conditional: 0, dependent unconditional: 67, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 4949, independent: 2638, independent conditional: 0, independent unconditional: 2638, dependent: 237, dependent conditional: 0, dependent unconditional: 237, unknown: 2074, unknown conditional: 0, unknown unconditional: 2074] , Statistics on independence cache: Total cache size (in pairs): 265, Positive cache size: 228, Positive conditional cache size: 0, Positive unconditional cache size: 228, Negative cache size: 37, Negative conditional cache size: 0, Negative unconditional cache size: 37, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - UnprovableResult [Line: 759]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 759. Possible FailurePath: [L714] 0 int memory[(2*960+1)]; [L715] 0 int next_alloc_idx = 1; [L716] 0 int m = 0; [L717] 0 int top; [L769] 0 int m2 = 0; [L770] 0 int state = 0; [L788] 0 pthread_t t; VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, state=0, t={15:0}, top={4:0}] [L789] COND TRUE 0 1 [L789] FCALL, FORK 0 pthread_create(&t, 0, thr1, 0) VAL [m2={5:0}, m={3:0}, next_alloc_idx=1, pthread_create(&t, 0, thr1, 0)=-1, state=0, t={15:0}, top={4:0}] [L773] CALL 1 __VERIFIER_atomic_acquire(&m2) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L773] RET 1 __VERIFIER_atomic_acquire(&m2) [L776] 1 case 0: [L777] CALL 1 EBStack_init() [L732] 1 top = 0 [L777] RET 1 EBStack_init() [L778] 1 state = 1 [L779] 1 case 1: [L780] CALL 1 __VERIFIER_atomic_release(&m2) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L780] RET 1 __VERIFIER_atomic_release(&m2) [L781] CALL 1 push_loop() [L762] 1 int r = -1; [L763] 1 int arg = __VERIFIER_nondet_int(); [L764] COND TRUE 1 1 [L765] CALL, EXPR 1 push(arg) [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L742] CALL, EXPR 1 index_malloc() [L719] 1 int curr_alloc_idx = -1; VAL [curr_alloc_idx=-1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L720] CALL 1 __VERIFIER_atomic_acquire(&m) [L691] EXPR 1 \read(*m) [L691] CALL 1 assume_abort_if_not(*m==0) [L4] COND FALSE 1 !(!cond) [L691] RET 1 assume_abort_if_not(*m==0) [L692] 1 *m = 1 [L720] RET 1 __VERIFIER_atomic_acquire(&m) [L721] COND FALSE 1 !(next_alloc_idx+2-1 > (2*960+1)) [L725] 1 curr_alloc_idx = next_alloc_idx VAL [curr_alloc_idx=1, m2={5:0}, m={3:0}, next_alloc_idx=1, state=1, top={4:0}] [L726] 1 next_alloc_idx += 2 [L727] CALL 1 __VERIFIER_atomic_release(&m) [L696] EXPR 1 \read(*m) [L696] CALL 1 assume_abort_if_not(*m==1) [L4] COND FALSE 1 !(!cond) [L696] RET 1 assume_abort_if_not(*m==1) [L697] 1 *m = 0 [L727] RET 1 __VERIFIER_atomic_release(&m) [L729] 1 return curr_alloc_idx; [L742] RET, EXPR 1 index_malloc() [L742] 1 newTop = index_malloc() [L743] COND FALSE 1 !(newTop == 0) [L746] EXPR 1 memory[newTop+0] [L746] 1 memory[newTop+0] = d VAL [\old(d)=0, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=-1, state=1, top={4:0}] [L747] COND TRUE 1 1 [L748] EXPR 1 \read(top) [L748] 1 oldTop = top [L749] EXPR 1 memory[newTop+1] [L749] 1 memory[newTop+1] = oldTop VAL [\old(d)=0, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L750] CALL 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L705] EXPR 1 \read(*v) [L705] COND TRUE 1 *v == e [L707] 1 *v = u [L707] 1 *r = 1 [L750] RET 1 __VERIFIER_atomic_CAS(&top,oldTop,newTop,&casret) [L751] EXPR 1 \read(casret) [L751] COND TRUE 1 casret==1 VAL [\old(d)=0, \read(casret)=1, casret={7:0}, d=0, m2={5:0}, m={3:0}, newTop=1, next_alloc_idx=3, oldTop=0, state=1, top={4:0}] [L752] 1 return 1; [L741] 1 int oldTop = -1, newTop = -1, casret = -1; [L752] 1 return 1; [L765] RET, EXPR 1 push(arg) [L765] 1 r = push(arg) [L766] CALL 1 __VERIFIER_atomic_assert(r) [L759] EXPR 1 !r || !isEmpty() [L759] CALL, EXPR 1 isEmpty() [L735] EXPR 1 \read(top) [L735] COND FALSE 1 !(top == 0) [L738] 1 return 0; [L759] RET, EXPR 1 isEmpty() [L759] EXPR 1 !r || !isEmpty() [L759] COND TRUE 1 !(!(!r || !isEmpty())) [L759] 1 reach_error() VAL [\old(r)=1, m2={5:0}, m={3:0}, next_alloc_idx=3, r=1, state=1, top={4: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: 749]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 746]: Unable to prove that array index is always in bounds Unable to prove that array index is always in bounds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 786]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 256 locations, 82 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: 17.4s, OverallIterations: 14, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 8.8s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1093 SdHoareTripleChecker+Valid, 2.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 614 mSDsluCounter, 280 SdHoareTripleChecker+Invalid, 2.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 154 mSDsCounter, 75 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1517 IncrementalHoareTripleChecker+Invalid, 1592 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 75 mSolverCounterUnsat, 126 mSDtfsCounter, 1517 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 86 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=187occurred in iteration=11, InterpolantAutomatonStates: 46, 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, 0.5s SatisfiabilityAnalysisTime, 0.7s InterpolantComputationTime, 110 NumberOfCodeBlocks, 110 NumberOfCodeBlocksAsserted, 14 NumberOfCheckSat, 81 ConstructedInterpolants, 0 QuantifiedInterpolants, 520 SizeOfPredicates, 14 NumberOfNonLiveVariables, 1276 ConjunctsInSsa, 85 ConjunctsInUnsatCore, 13 InterpolantComputations, 13 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-08-29 19:56:52,091 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