./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c -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 f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 01:13:27,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 01:13:27,081 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 01:13:27,125 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 01:13:27,127 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 01:13:27,130 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 01:13:27,131 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 01:13:27,134 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 01:13:27,136 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 01:13:27,140 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 01:13:27,141 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 01:13:27,143 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 01:13:27,143 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 01:13:27,145 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 01:13:27,146 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 01:13:27,151 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 01:13:27,152 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 01:13:27,153 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 01:13:27,155 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 01:13:27,159 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 01:13:27,168 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 01:13:27,169 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 01:13:27,170 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 01:13:27,171 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 01:13:27,177 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 01:13:27,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 01:13:27,178 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 01:13:27,180 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 01:13:27,180 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 01:13:27,181 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 01:13:27,181 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 01:13:27,187 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 01:13:27,189 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 01:13:27,190 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 01:13:27,190 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 01:13:27,191 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 01:13:27,191 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 01:13:27,191 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 01:13:27,192 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 01:13:27,192 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 01:13:27,193 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 01:13:27,194 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 01:13:27,227 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 01:13:27,227 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 01:13:27,228 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 01:13:27,228 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 01:13:27,229 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 01:13:27,229 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 01:13:27,230 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 01:13:27,230 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 01:13:27,230 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 01:13:27,230 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 01:13:27,231 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 01:13:27,231 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 01:13:27,232 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 01:13:27,232 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 01:13:27,232 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 01:13:27,232 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 01:13:27,232 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 01:13:27,233 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 01:13:27,233 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 01:13:27,233 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 01:13:27,233 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 01:13:27,233 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 01:13:27,234 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 01:13:27,234 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 01:13:27,234 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 01:13:27,234 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:13:27,234 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 01:13:27,235 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 01:13:27,235 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 01:13:27,235 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 01:13:27,235 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 01:13:27,235 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 01:13:27,236 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 01:13:27,236 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 01:13:27,236 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 -> f3514ef3a93910f9ac9453b24d3813c22e07d2a41de38e0bc0d58abd31257770 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 01:13:27,524 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 01:13:27,541 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 01:13:27,543 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 01:13:27,544 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 01:13:27,545 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 01:13:27,546 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-09-01 01:13:29,030 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 01:13:29,262 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 01:13:29,263 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c [2023-09-01 01:13:29,271 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60e80ba0/b5638f0950484a3f8015962b4fb2b9d5/FLAGce30f86ee [2023-09-01 01:13:29,291 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b60e80ba0/b5638f0950484a3f8015962b4fb2b9d5 [2023-09-01 01:13:29,294 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 01:13:29,295 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 01:13:29,298 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 01:13:29,298 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 01:13:29,301 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 01:13:29,302 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,303 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@ebe0deb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29, skipping insertion in model container [2023-09-01 01:13:29,303 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,309 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 01:13:29,328 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 01:13:29,472 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-09-01 01:13:29,476 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:13:29,484 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 01:13:29,503 WARN L247 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x4.wvr.c[2309,2322] [2023-09-01 01:13:29,504 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:13:29,516 INFO L208 MainTranslator]: Completed translation [2023-09-01 01:13:29,516 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29 WrapperNode [2023-09-01 01:13:29,516 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 01:13:29,517 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 01:13:29,517 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 01:13:29,518 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 01:13:29,523 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,533 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,556 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-09-01 01:13:29,558 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 01:13:29,559 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 01:13:29,559 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 01:13:29,559 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 01:13:29,566 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,567 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,585 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,597 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,598 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,600 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 01:13:29,601 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 01:13:29,609 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 01:13:29,610 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 01:13:29,610 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (1/1) ... [2023-09-01 01:13:29,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:13:29,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:29,643 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-09-01 01:13:29,645 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-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 01:13:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 01:13:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 01:13:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 01:13:29,677 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 01:13:29,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 01:13:29,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 01:13:29,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 01:13:29,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 01:13:29,678 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 01:13:29,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 01:13:29,679 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 01:13:29,780 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 01:13:29,782 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 01:13:30,137 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 01:13:30,144 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 01:13:30,156 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 01:13:30,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:13:30 BoogieIcfgContainer [2023-09-01 01:13:30,160 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 01:13:30,162 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 01:13:30,162 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 01:13:30,165 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 01:13:30,165 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:13:29" (1/3) ... [2023-09-01 01:13:30,166 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62713675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:13:30, skipping insertion in model container [2023-09-01 01:13:30,166 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:13:29" (2/3) ... [2023-09-01 01:13:30,167 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@62713675 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:13:30, skipping insertion in model container [2023-09-01 01:13:30,167 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:13:30" (3/3) ... [2023-09-01 01:13:30,170 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x4.wvr.c [2023-09-01 01:13:30,191 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 01:13:30,191 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-09-01 01:13:30,191 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 01:13:30,341 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 01:13:30,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 150 places, 147 transitions, 326 flow [2023-09-01 01:13:30,483 INFO L130 PetriNetUnfolder]: 10/143 cut-off events. [2023-09-01 01:13:30,484 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:30,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 160 conditions, 143 events. 10/143 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/115 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-09-01 01:13:30,489 INFO L82 GeneralOperation]: Start removeDead. Operand has 150 places, 147 transitions, 326 flow [2023-09-01 01:13:30,497 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 142 places, 139 transitions, 302 flow [2023-09-01 01:13:30,500 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 01:13:30,512 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 142 places, 139 transitions, 302 flow [2023-09-01 01:13:30,519 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 142 places, 139 transitions, 302 flow [2023-09-01 01:13:30,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 142 places, 139 transitions, 302 flow [2023-09-01 01:13:30,568 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2023-09-01 01:13:30,569 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:30,571 INFO L83 FinitePrefix]: Finished finitePrefix Result has 156 conditions, 139 events. 10/139 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 103 event pairs, 0 based on Foata normal form. 0/112 useless extension candidates. Maximal degree in co-relation 96. Up to 2 conditions per place. [2023-09-01 01:13:30,573 INFO L119 LiptonReduction]: Number of co-enabled transitions 1960 [2023-09-01 01:13:35,141 INFO L134 LiptonReduction]: Checked pairs total: 2229 [2023-09-01 01:13:35,142 INFO L136 LiptonReduction]: Total number of compositions: 134 [2023-09-01 01:13:35,154 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 01:13:35,159 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;@49ae5bb0, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 01:13:35,160 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-09-01 01:13:35,162 INFO L130 PetriNetUnfolder]: 0/1 cut-off events. [2023-09-01 01:13:35,162 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:13:35,162 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:35,163 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 01:13:35,163 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:35,167 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:35,168 INFO L85 PathProgramCache]: Analyzing trace with hash 531, now seen corresponding path program 1 times [2023-09-01 01:13:35,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:35,175 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463096184] [2023-09-01 01:13:35,175 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:35,175 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:35,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:35,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:35,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:35,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463096184] [2023-09-01 01:13:35,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463096184] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:35,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:35,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 01:13:35,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [882298788] [2023-09-01 01:13:35,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:35,265 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 01:13:35,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:35,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 01:13:35,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 01:13:35,292 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 132 out of 281 [2023-09-01 01:13:35,296 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,296 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:35,297 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 132 of 281 [2023-09-01 01:13:35,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:35,421 INFO L130 PetriNetUnfolder]: 513/692 cut-off events. [2023-09-01 01:13:35,422 INFO L131 PetriNetUnfolder]: For 25/25 co-relation queries the response was YES. [2023-09-01 01:13:35,423 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1650 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-09-01 01:13:35,427 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-09-01 01:13:35,427 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-09-01 01:13:35,428 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 01:13:35,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 01:13:35,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 306 transitions. [2023-09-01 01:13:35,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5444839857651246 [2023-09-01 01:13:35,440 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 306 transitions. [2023-09-01 01:13:35,440 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 306 transitions. [2023-09-01 01:13:35,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:35,443 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 306 transitions. [2023-09-01 01:13:35,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 153.0) internal successors, (306), 2 states have internal predecessors, (306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,450 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,451 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 281.0) internal successors, (843), 3 states have internal predecessors, (843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,453 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 108 flow. Second operand 2 states and 306 transitions. [2023-09-01 01:13:35,453 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-09-01 01:13:35,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 01:13:35,457 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-09-01 01:13:35,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-09-01 01:13:35,462 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:13:35,462 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-09-01 01:13:35,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 132.5) internal successors, (265), 2 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:35,463 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:13:35,463 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 01:13:35,463 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:35,464 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:35,464 INFO L85 PathProgramCache]: Analyzing trace with hash 520996, now seen corresponding path program 1 times [2023-09-01 01:13:35,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:35,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1010266240] [2023-09-01 01:13:35,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:35,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:35,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:35,845 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:35,846 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:35,846 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1010266240] [2023-09-01 01:13:35,846 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1010266240] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:35,846 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:35,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:35,847 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1335847681] [2023-09-01 01:13:35,847 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:35,848 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:35,848 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:35,849 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:35,849 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:35,917 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-09-01 01:13:35,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:35,918 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:35,918 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-09-01 01:13:35,918 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,015 INFO L130 PetriNetUnfolder]: 487/656 cut-off events. [2023-09-01 01:13:36,015 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:36,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1536 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-09-01 01:13:36,019 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-09-01 01:13:36,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-09-01 01:13:36,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:36,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:36,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 402 transitions. [2023-09-01 01:13:36,029 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47686832740213525 [2023-09-01 01:13:36,029 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 402 transitions. [2023-09-01 01:13:36,030 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 402 transitions. [2023-09-01 01:13:36,030 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,030 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 402 transitions. [2023-09-01 01:13:36,032 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.0) internal successors, (402), 3 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,035 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,036 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 402 transitions. [2023-09-01 01:13:36,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-09-01 01:13:36,036 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:36,037 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-09-01 01:13:36,037 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-09-01 01:13:36,038 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:13:36,038 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-09-01 01:13:36,039 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.0) internal successors, (366), 3 states have internal predecessors, (366), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,039 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,039 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:13:36,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 01:13:36,040 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,042 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,042 INFO L85 PathProgramCache]: Analyzing trace with hash 520995, now seen corresponding path program 1 times [2023-09-01 01:13:36,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,043 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537706395] [2023-09-01 01:13:36,043 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537706395] [2023-09-01 01:13:36,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537706395] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:36,162 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:36,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:36,162 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28897772] [2023-09-01 01:13:36,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,163 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:36,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:36,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:36,210 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-09-01 01:13:36,211 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,211 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,211 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-09-01 01:13:36,211 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,293 INFO L130 PetriNetUnfolder]: 461/620 cut-off events. [2023-09-01 01:13:36,294 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:36,295 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1423 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-09-01 01:13:36,297 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-09-01 01:13:36,297 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-09-01 01:13:36,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:36,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:36,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2023-09-01 01:13:36,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4958481613285884 [2023-09-01 01:13:36,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 418 transitions. [2023-09-01 01:13:36,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 418 transitions. [2023-09-01 01:13:36,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,300 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 418 transitions. [2023-09-01 01:13:36,302 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 139.33333333333334) internal successors, (418), 3 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-09-01 01:13:36,303 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,304 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,304 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 418 transitions. [2023-09-01 01:13:36,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-09-01 01:13:36,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:36,306 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-09-01 01:13:36,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-09-01 01:13:36,307 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-09-01 01:13:36,307 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-09-01 01:13:36,307 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 128.0) internal successors, (384), 3 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,308 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:13:36,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 01:13:36,313 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,314 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,314 INFO L85 PathProgramCache]: Analyzing trace with hash 500689666, now seen corresponding path program 1 times [2023-09-01 01:13:36,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168368657] [2023-09-01 01:13:36,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168368657] [2023-09-01 01:13:36,420 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168368657] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:36,420 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:36,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:36,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1931211264] [2023-09-01 01:13:36,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,421 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:36,422 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:36,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:36,469 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-09-01 01:13:36,470 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,470 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,470 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-09-01 01:13:36,471 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,540 INFO L130 PetriNetUnfolder]: 445/596 cut-off events. [2023-09-01 01:13:36,541 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:36,541 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1359 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-09-01 01:13:36,544 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-09-01 01:13:36,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-09-01 01:13:36,545 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:36,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:36,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 401 transitions. [2023-09-01 01:13:36,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47568208778173193 [2023-09-01 01:13:36,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 401 transitions. [2023-09-01 01:13:36,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 401 transitions. [2023-09-01 01:13:36,547 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,547 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 401 transitions. [2023-09-01 01:13:36,548 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.66666666666666) internal successors, (401), 3 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,550 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,550 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 401 transitions. [2023-09-01 01:13:36,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-09-01 01:13:36,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:36,552 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-09-01 01:13:36,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-09-01 01:13:36,553 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2023-09-01 01:13:36,553 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-09-01 01:13:36,553 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.66666666666667) internal successors, (371), 3 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:13:36,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 01:13:36,554 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,554 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,555 INFO L85 PathProgramCache]: Analyzing trace with hash 500689665, now seen corresponding path program 1 times [2023-09-01 01:13:36,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,555 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [698148057] [2023-09-01 01:13:36,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,603 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [698148057] [2023-09-01 01:13:36,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [698148057] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:36,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1422376325] [2023-09-01 01:13:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:36,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:36,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:36,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-09-01 01:13:36,655 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,655 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,655 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-09-01 01:13:36,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,715 INFO L130 PetriNetUnfolder]: 429/572 cut-off events. [2023-09-01 01:13:36,716 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:36,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1287 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-09-01 01:13:36,719 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 01:13:36,719 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-09-01 01:13:36,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:36,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:36,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-09-01 01:13:36,721 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697508896797153 [2023-09-01 01:13:36,721 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-09-01 01:13:36,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-09-01 01:13:36,721 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,722 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-09-01 01:13:36,723 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,725 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,725 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 396 transitions. [2023-09-01 01:13:36,725 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-09-01 01:13:36,725 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:36,726 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-09-01 01:13:36,726 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-09-01 01:13:36,727 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:13:36,727 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-09-01 01:13:36,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 122.66666666666667) internal successors, (368), 3 states have internal predecessors, (368), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,728 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,728 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:36,728 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 01:13:36,728 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,729 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,729 INFO L85 PathProgramCache]: Analyzing trace with hash 126441678, now seen corresponding path program 1 times [2023-09-01 01:13:36,729 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [398655913] [2023-09-01 01:13:36,729 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,730 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,784 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,784 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [398655913] [2023-09-01 01:13:36,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [398655913] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:36,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:36,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:36,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248217569] [2023-09-01 01:13:36,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:36,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:36,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:36,828 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 127 out of 281 [2023-09-01 01:13:36,828 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 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-09-01 01:13:36,829 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,829 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 127 of 281 [2023-09-01 01:13:36,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:36,897 INFO L130 PetriNetUnfolder]: 403/536 cut-off events. [2023-09-01 01:13:36,897 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:36,898 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1182 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-09-01 01:13:36,900 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 01:13:36,900 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-09-01 01:13:36,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:36,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 412 transitions. [2023-09-01 01:13:36,902 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4887307236061684 [2023-09-01 01:13:36,902 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 412 transitions. [2023-09-01 01:13:36,902 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 412 transitions. [2023-09-01 01:13:36,903 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:36,903 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 412 transitions. [2023-09-01 01:13:36,904 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.33333333333334) internal successors, (412), 3 states have internal predecessors, (412), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,906 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,906 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,906 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 412 transitions. [2023-09-01 01:13:36,907 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-09-01 01:13:36,907 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:36,908 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-09-01 01:13:36,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-09-01 01:13:36,909 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2023-09-01 01:13:36,909 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-09-01 01:13:36,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-09-01 01:13:36,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:36,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:36,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 01:13:36,910 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:36,910 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:36,910 INFO L85 PathProgramCache]: Analyzing trace with hash 126441677, now seen corresponding path program 1 times [2023-09-01 01:13:36,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:36,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [84022638] [2023-09-01 01:13:36,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:36,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:36,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:36,945 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:36,945 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:36,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [84022638] [2023-09-01 01:13:36,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [84022638] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:36,946 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:36,946 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:36,946 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91066084] [2023-09-01 01:13:36,946 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:36,947 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:36,947 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:36,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:36,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:36,996 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 281 [2023-09-01 01:13:36,996 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:36,997 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:36,997 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 281 [2023-09-01 01:13:36,997 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:37,060 INFO L130 PetriNetUnfolder]: 377/500 cut-off events. [2023-09-01 01:13:37,061 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:37,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1072 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-09-01 01:13:37,064 INFO L137 encePairwiseOnDemand]: 278/281 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-09-01 01:13:37,064 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-09-01 01:13:37,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:37,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:37,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-09-01 01:13:37,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465005931198102 [2023-09-01 01:13:37,066 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,066 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:37,066 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,070 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,070 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,070 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 392 transitions. [2023-09-01 01:13:37,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-09-01 01:13:37,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:37,073 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-09-01 01:13:37,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-09-01 01:13:37,074 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:37,074 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-09-01 01:13:37,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.33333333333333) internal successors, (370), 3 states have internal predecessors, (370), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:37,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:37,075 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 01:13:37,075 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:37,075 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:37,075 INFO L85 PathProgramCache]: Analyzing trace with hash 1251377933, now seen corresponding path program 1 times [2023-09-01 01:13:37,076 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:37,076 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537371166] [2023-09-01 01:13:37,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:37,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:37,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:37,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,233 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:37,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537371166] [2023-09-01 01:13:37,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537371166] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:37,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:37,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 01:13:37,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128438254] [2023-09-01 01:13:37,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:37,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:37,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:37,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:37,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:37,338 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 109 out of 281 [2023-09-01 01:13:37,339 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,339 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:37,339 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 109 of 281 [2023-09-01 01:13:37,339 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:37,398 INFO L130 PetriNetUnfolder]: 313/420 cut-off events. [2023-09-01 01:13:37,399 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:37,400 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 851 event pairs, 149 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 861. Up to 420 conditions per place. [2023-09-01 01:13:37,401 INFO L137 encePairwiseOnDemand]: 279/281 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-09-01 01:13:37,401 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-09-01 01:13:37,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:37,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:37,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 354 transitions. [2023-09-01 01:13:37,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4199288256227758 [2023-09-01 01:13:37,403 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 354 transitions. [2023-09-01 01:13:37,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 354 transitions. [2023-09-01 01:13:37,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:37,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 354 transitions. [2023-09-01 01:13:37,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 118.0) internal successors, (354), 3 states have internal predecessors, (354), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,406 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 354 transitions. [2023-09-01 01:13:37,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-09-01 01:13:37,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:37,408 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-09-01 01:13:37,408 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-09-01 01:13:37,409 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:37,409 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-09-01 01:13:37,409 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 110.5) internal successors, (663), 6 states have internal predecessors, (663), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,409 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:37,409 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:37,410 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 01:13:37,410 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:37,410 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:37,410 INFO L85 PathProgramCache]: Analyzing trace with hash 1251377934, now seen corresponding path program 1 times [2023-09-01 01:13:37,410 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:37,411 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [750297293] [2023-09-01 01:13:37,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:37,411 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:37,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:37,443 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:37,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [750297293] [2023-09-01 01:13:37,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [750297293] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:37,444 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:37,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:37,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37871977] [2023-09-01 01:13:37,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:37,445 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:37,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:37,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:37,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:37,483 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 122 out of 281 [2023-09-01 01:13:37,484 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 3 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-09-01 01:13:37,484 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:37,484 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 122 of 281 [2023-09-01 01:13:37,484 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:37,541 INFO L130 PetriNetUnfolder]: 249/340 cut-off events. [2023-09-01 01:13:37,542 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:13:37,542 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 643 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-09-01 01:13:37,544 INFO L137 encePairwiseOnDemand]: 279/281 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-09-01 01:13:37,544 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-09-01 01:13:37,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:37,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:37,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 392 transitions. [2023-09-01 01:13:37,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.465005931198102 [2023-09-01 01:13:37,546 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:37,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 392 transitions. [2023-09-01 01:13:37,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 130.66666666666666) internal successors, (392), 3 states have internal predecessors, (392), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,549 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,549 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,549 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 392 transitions. [2023-09-01 01:13:37,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-09-01 01:13:37,551 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:37,552 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-09-01 01:13:37,552 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-09-01 01:13:37,553 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:13:37,553 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-09-01 01:13:37,554 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-09-01 01:13:37,554 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:37,554 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:37,554 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 01:13:37,554 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:37,555 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:37,555 INFO L85 PathProgramCache]: Analyzing trace with hash -730289387, now seen corresponding path program 1 times [2023-09-01 01:13:37,555 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:37,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688412390] [2023-09-01 01:13:37,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:37,559 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:37,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:37,880 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:37,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688412390] [2023-09-01 01:13:37,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688412390] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:37,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:37,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:13:37,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [10027558] [2023-09-01 01:13:37,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:37,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:13:37,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:37,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:13:37,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:13:37,927 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 281 [2023-09-01 01:13:37,928 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:37,928 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:37,928 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 281 [2023-09-01 01:13:37,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:38,041 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-09-01 01:13:38,042 INFO L131 PetriNetUnfolder]: For 12/12 co-relation queries the response was YES. [2023-09-01 01:13:38,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1786 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-09-01 01:13:38,045 INFO L137 encePairwiseOnDemand]: 275/281 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-09-01 01:13:38,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-09-01 01:13:38,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:13:38,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:13:38,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-09-01 01:13:38,047 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4697508896797153 [2023-09-01 01:13:38,047 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-09-01 01:13:38,047 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-09-01 01:13:38,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:38,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-09-01 01:13:38,049 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,050 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,052 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 281.0) internal successors, (1124), 4 states have internal predecessors, (1124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,052 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 396 transitions. [2023-09-01 01:13:38,052 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-09-01 01:13:38,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:38,054 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-09-01 01:13:38,055 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-09-01 01:13:38,055 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:13:38,055 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-09-01 01:13:38,056 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,056 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:38,056 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:38,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 01:13:38,056 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:38,057 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:38,057 INFO L85 PathProgramCache]: Analyzing trace with hash -932647200, now seen corresponding path program 1 times [2023-09-01 01:13:38,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:38,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305446570] [2023-09-01 01:13:38,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:38,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:38,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:38,290 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:38,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:38,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305446570] [2023-09-01 01:13:38,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305446570] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:38,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:38,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:38,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1408576381] [2023-09-01 01:13:38,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:38,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:38,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:38,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:38,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:38,357 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 281 [2023-09-01 01:13:38,358 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,358 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:38,358 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 281 [2023-09-01 01:13:38,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:38,515 INFO L130 PetriNetUnfolder]: 461/641 cut-off events. [2023-09-01 01:13:38,515 INFO L131 PetriNetUnfolder]: For 177/177 co-relation queries the response was YES. [2023-09-01 01:13:38,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1650 conditions, 641 events. 461/641 cut-off events. For 177/177 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1841 event pairs, 17 based on Foata normal form. 36/677 useless extension candidates. Maximal degree in co-relation 1645. Up to 435 conditions per place. [2023-09-01 01:13:38,520 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 50 selfloop transitions, 9 changer transitions 1/60 dead transitions. [2023-09-01 01:13:38,520 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 60 transitions, 297 flow [2023-09-01 01:13:38,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:13:38,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:13:38,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-09-01 01:13:38,522 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.44661921708185054 [2023-09-01 01:13:38,522 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-09-01 01:13:38,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-09-01 01:13:38,523 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:38,523 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-09-01 01:13:38,524 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,525 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,526 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,526 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 4 states and 502 transitions. [2023-09-01 01:13:38,526 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 60 transitions, 297 flow [2023-09-01 01:13:38,527 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 60 transitions, 290 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:38,528 INFO L231 Difference]: Finished difference. Result has 41 places, 33 transitions, 135 flow [2023-09-01 01:13:38,528 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=135, PETRI_PLACES=41, PETRI_TRANSITIONS=33} [2023-09-01 01:13:38,529 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:13:38,529 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 33 transitions, 135 flow [2023-09-01 01:13:38,529 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,529 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:38,529 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:38,530 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 01:13:38,530 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:38,530 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:38,530 INFO L85 PathProgramCache]: Analyzing trace with hash 643872101, now seen corresponding path program 1 times [2023-09-01 01:13:38,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:38,531 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1641482708] [2023-09-01 01:13:38,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:38,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:38,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:38,672 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:38,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:38,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1641482708] [2023-09-01 01:13:38,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1641482708] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:38,673 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:38,673 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:38,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601651073] [2023-09-01 01:13:38,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:38,674 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:38,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:38,717 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-09-01 01:13:38,718 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 33 transitions, 135 flow. Second operand has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,718 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:38,718 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-09-01 01:13:38,718 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:38,886 INFO L130 PetriNetUnfolder]: 657/915 cut-off events. [2023-09-01 01:13:38,887 INFO L131 PetriNetUnfolder]: For 659/659 co-relation queries the response was YES. [2023-09-01 01:13:38,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2539 conditions, 915 events. 657/915 cut-off events. For 659/659 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2743 event pairs, 55 based on Foata normal form. 32/947 useless extension candidates. Maximal degree in co-relation 2533. Up to 349 conditions per place. [2023-09-01 01:13:38,893 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-09-01 01:13:38,893 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 85 transitions, 479 flow [2023-09-01 01:13:38,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:38,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:38,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-09-01 01:13:38,895 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4711743772241993 [2023-09-01 01:13:38,895 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-09-01 01:13:38,895 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-09-01 01:13:38,896 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:38,896 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-09-01 01:13:38,897 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.4) internal successors, (662), 5 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,899 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,900 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,900 INFO L175 Difference]: Start difference. First operand has 41 places, 33 transitions, 135 flow. Second operand 5 states and 662 transitions. [2023-09-01 01:13:38,900 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 85 transitions, 479 flow [2023-09-01 01:13:38,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 85 transitions, 457 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-09-01 01:13:38,903 INFO L231 Difference]: Finished difference. Result has 45 places, 41 transitions, 200 flow [2023-09-01 01:13:38,903 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=45, PETRI_TRANSITIONS=41} [2023-09-01 01:13:38,903 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -6 predicate places. [2023-09-01 01:13:38,903 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 41 transitions, 200 flow [2023-09-01 01:13:38,904 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 123.5) internal successors, (494), 4 states have internal predecessors, (494), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:38,904 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:38,904 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:38,904 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-09-01 01:13:38,905 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:38,905 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:38,905 INFO L85 PathProgramCache]: Analyzing trace with hash -716394137, now seen corresponding path program 1 times [2023-09-01 01:13:38,905 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:38,905 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415250851] [2023-09-01 01:13:38,905 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:38,906 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:38,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:39,034 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:39,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:39,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415250851] [2023-09-01 01:13:39,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415250851] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:39,035 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063155082] [2023-09-01 01:13:39,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:39,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:39,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:39,038 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:39,057 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 01:13:39,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:39,131 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:39,135 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:39,572 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:39,572 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:39,651 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:39,651 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063155082] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:39,651 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:39,652 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:39,652 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414426900] [2023-09-01 01:13:39,652 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:39,652 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:39,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:39,653 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:39,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:39,749 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-09-01 01:13:39,750 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 41 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:39,750 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:39,750 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-09-01 01:13:39,750 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:39,996 INFO L130 PetriNetUnfolder]: 807/1127 cut-off events. [2023-09-01 01:13:39,996 INFO L131 PetriNetUnfolder]: For 1077/1077 co-relation queries the response was YES. [2023-09-01 01:13:39,999 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3770 conditions, 1127 events. 807/1127 cut-off events. For 1077/1077 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3517 event pairs, 223 based on Foata normal form. 30/1127 useless extension candidates. Maximal degree in co-relation 3762. Up to 509 conditions per place. [2023-09-01 01:13:40,005 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 72 selfloop transitions, 13 changer transitions 0/85 dead transitions. [2023-09-01 01:13:40,005 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 85 transitions, 520 flow [2023-09-01 01:13:40,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:40,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:40,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 664 transitions. [2023-09-01 01:13:40,008 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47259786476868326 [2023-09-01 01:13:40,008 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 664 transitions. [2023-09-01 01:13:40,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 664 transitions. [2023-09-01 01:13:40,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:40,009 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 664 transitions. [2023-09-01 01:13:40,010 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 132.8) internal successors, (664), 5 states have internal predecessors, (664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,013 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,013 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,013 INFO L175 Difference]: Start difference. First operand has 45 places, 41 transitions, 200 flow. Second operand 5 states and 664 transitions. [2023-09-01 01:13:40,014 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 85 transitions, 520 flow [2023-09-01 01:13:40,017 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 85 transitions, 520 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:40,020 INFO L231 Difference]: Finished difference. Result has 51 places, 44 transitions, 264 flow [2023-09-01 01:13:40,020 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=51, PETRI_TRANSITIONS=44} [2023-09-01 01:13:40,021 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-09-01 01:13:40,021 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 44 transitions, 264 flow [2023-09-01 01:13:40,022 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 125.0) internal successors, (750), 6 states have internal predecessors, (750), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,022 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:40,022 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:40,045 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:40,236 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-09-01 01:13:40,237 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:40,237 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:40,238 INFO L85 PathProgramCache]: Analyzing trace with hash -1563368825, now seen corresponding path program 2 times [2023-09-01 01:13:40,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:40,238 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199694727] [2023-09-01 01:13:40,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:40,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:40,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:40,435 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:40,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:40,436 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199694727] [2023-09-01 01:13:40,436 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199694727] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:40,436 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:40,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:40,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [682812655] [2023-09-01 01:13:40,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:40,437 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:40,437 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:40,437 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:40,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:40,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 281 [2023-09-01 01:13:40,502 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 44 transitions, 264 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,503 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:40,503 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 281 [2023-09-01 01:13:40,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:40,681 INFO L130 PetriNetUnfolder]: 793/1113 cut-off events. [2023-09-01 01:13:40,681 INFO L131 PetriNetUnfolder]: For 1791/1791 co-relation queries the response was YES. [2023-09-01 01:13:40,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4066 conditions, 1113 events. 793/1113 cut-off events. For 1791/1791 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 3559 event pairs, 135 based on Foata normal form. 14/1097 useless extension candidates. Maximal degree in co-relation 4055. Up to 907 conditions per place. [2023-09-01 01:13:40,689 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 53 selfloop transitions, 11 changer transitions 11/75 dead transitions. [2023-09-01 01:13:40,689 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 75 transitions, 503 flow [2023-09-01 01:13:40,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:13:40,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:13:40,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-09-01 01:13:40,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.445729537366548 [2023-09-01 01:13:40,692 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-09-01 01:13:40,692 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-09-01 01:13:40,692 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:40,692 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-09-01 01:13:40,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,695 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,695 INFO L175 Difference]: Start difference. First operand has 51 places, 44 transitions, 264 flow. Second operand 4 states and 501 transitions. [2023-09-01 01:13:40,695 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 75 transitions, 503 flow [2023-09-01 01:13:40,703 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 75 transitions, 491 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:40,705 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 288 flow [2023-09-01 01:13:40,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=288, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-09-01 01:13:40,705 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-09-01 01:13:40,706 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 288 flow [2023-09-01 01:13:40,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:40,706 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:40,706 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-09-01 01:13:40,706 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:40,707 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:40,707 INFO L85 PathProgramCache]: Analyzing trace with hash 1892794647, now seen corresponding path program 2 times [2023-09-01 01:13:40,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:40,707 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215955943] [2023-09-01 01:13:40,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:40,708 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:40,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:40,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:40,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:40,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215955943] [2023-09-01 01:13:40,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1215955943] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:13:40,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:13:40,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:13:40,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433782064] [2023-09-01 01:13:40,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:13:40,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:13:40,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:40,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:13:40,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:13:40,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 281 [2023-09-01 01:13:40,951 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 288 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:40,951 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:40,951 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 281 [2023-09-01 01:13:40,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:41,149 INFO L130 PetriNetUnfolder]: 881/1229 cut-off events. [2023-09-01 01:13:41,149 INFO L131 PetriNetUnfolder]: For 1852/1852 co-relation queries the response was YES. [2023-09-01 01:13:41,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4714 conditions, 1229 events. 881/1229 cut-off events. For 1852/1852 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 3931 event pairs, 203 based on Foata normal form. 28/1257 useless extension candidates. Maximal degree in co-relation 4701. Up to 921 conditions per place. [2023-09-01 01:13:41,158 INFO L137 encePairwiseOnDemand]: 275/281 looper letters, 63 selfloop transitions, 10 changer transitions 3/76 dead transitions. [2023-09-01 01:13:41,159 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 76 transitions, 547 flow [2023-09-01 01:13:41,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:13:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:13:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-09-01 01:13:41,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4483985765124555 [2023-09-01 01:13:41,161 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-09-01 01:13:41,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-09-01 01:13:41,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:41,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-09-01 01:13:41,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:41,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:41,165 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 281.0) internal successors, (1405), 5 states have internal predecessors, (1405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:41,165 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 288 flow. Second operand 4 states and 504 transitions. [2023-09-01 01:13:41,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 76 transitions, 547 flow [2023-09-01 01:13:41,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 76 transitions, 538 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:13:41,170 INFO L231 Difference]: Finished difference. Result has 57 places, 47 transitions, 314 flow [2023-09-01 01:13:41,170 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=279, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=314, PETRI_PLACES=57, PETRI_TRANSITIONS=47} [2023-09-01 01:13:41,171 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 6 predicate places. [2023-09-01 01:13:41,171 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 47 transitions, 314 flow [2023-09-01 01:13:41,172 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:41,172 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:41,172 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:41,172 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 01:13:41,172 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:41,173 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:41,173 INFO L85 PathProgramCache]: Analyzing trace with hash -727013529, now seen corresponding path program 1 times [2023-09-01 01:13:41,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:41,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623373090] [2023-09-01 01:13:41,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:41,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:41,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:41,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:41,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623373090] [2023-09-01 01:13:41,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623373090] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:41,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1247449988] [2023-09-01 01:13:41,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:41,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:41,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:41,293 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:41,318 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 01:13:41,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:41,393 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:41,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:41,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:41,600 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:41,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1247449988] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:41,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:41,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:13:41,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229491823] [2023-09-01 01:13:41,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:41,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:13:41,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:41,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:13:41,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:13:41,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 281 [2023-09-01 01:13:41,670 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 47 transitions, 314 flow. Second operand has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:41,670 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:41,670 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 281 [2023-09-01 01:13:41,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:42,025 INFO L130 PetriNetUnfolder]: 1771/2439 cut-off events. [2023-09-01 01:13:42,026 INFO L131 PetriNetUnfolder]: For 6830/6830 co-relation queries the response was YES. [2023-09-01 01:13:42,032 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9782 conditions, 2439 events. 1771/2439 cut-off events. For 6830/6830 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 8995 event pairs, 413 based on Foata normal form. 104/2543 useless extension candidates. Maximal degree in co-relation 9768. Up to 1123 conditions per place. [2023-09-01 01:13:42,045 INFO L137 encePairwiseOnDemand]: 276/281 looper letters, 117 selfloop transitions, 10 changer transitions 0/127 dead transitions. [2023-09-01 01:13:42,045 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 127 transitions, 1005 flow [2023-09-01 01:13:42,046 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:13:42,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:13:42,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 672 transitions. [2023-09-01 01:13:42,048 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4782918149466192 [2023-09-01 01:13:42,048 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 672 transitions. [2023-09-01 01:13:42,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 672 transitions. [2023-09-01 01:13:42,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:42,049 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 672 transitions. [2023-09-01 01:13:42,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 134.4) internal successors, (672), 5 states have internal predecessors, (672), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:42,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:42,052 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 281.0) internal successors, (1686), 6 states have internal predecessors, (1686), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:42,053 INFO L175 Difference]: Start difference. First operand has 57 places, 47 transitions, 314 flow. Second operand 5 states and 672 transitions. [2023-09-01 01:13:42,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 127 transitions, 1005 flow [2023-09-01 01:13:42,066 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 127 transitions, 977 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 01:13:42,068 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 359 flow [2023-09-01 01:13:42,068 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=295, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=359, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-09-01 01:13:42,068 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 11 predicate places. [2023-09-01 01:13:42,068 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 359 flow [2023-09-01 01:13:42,069 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 123.66666666666667) internal successors, (742), 6 states have internal predecessors, (742), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:42,069 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:42,069 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:42,078 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:42,277 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-09-01 01:13:42,278 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:42,278 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:42,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1373357770, now seen corresponding path program 2 times [2023-09-01 01:13:42,278 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:42,278 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514041951] [2023-09-01 01:13:42,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:42,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:42,433 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:42,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514041951] [2023-09-01 01:13:42,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514041951] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:42,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1365301997] [2023-09-01 01:13:42,434 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:13:42,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:42,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:42,436 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:42,446 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 01:13:42,550 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:13:42,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:13:42,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:13:42,554 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:13:42,650 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:42,651 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:13:42,702 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:42,703 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1365301997] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:13:42,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:13:42,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 01:13:42,704 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1622045022] [2023-09-01 01:13:42,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:13:42,704 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 01:13:42,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:13:42,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 01:13:42,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 01:13:42,816 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 281 [2023-09-01 01:13:42,817 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 359 flow. Second operand has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:42,817 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:13:42,817 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 281 [2023-09-01 01:13:42,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:13:43,287 INFO L130 PetriNetUnfolder]: 2241/3081 cut-off events. [2023-09-01 01:13:43,288 INFO L131 PetriNetUnfolder]: For 9675/9675 co-relation queries the response was YES. [2023-09-01 01:13:43,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13704 conditions, 3081 events. 2241/3081 cut-off events. For 9675/9675 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 12025 event pairs, 403 based on Foata normal form. 76/3157 useless extension candidates. Maximal degree in co-relation 13687. Up to 1757 conditions per place. [2023-09-01 01:13:43,318 INFO L137 encePairwiseOnDemand]: 274/281 looper letters, 126 selfloop transitions, 14 changer transitions 3/143 dead transitions. [2023-09-01 01:13:43,318 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 143 transitions, 1128 flow [2023-09-01 01:13:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 01:13:43,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 01:13:43,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-09-01 01:13:43,322 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.45077105575326215 [2023-09-01 01:13:43,322 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-09-01 01:13:43,322 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-09-01 01:13:43,322 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:13:43,323 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-09-01 01:13:43,324 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:43,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:43,327 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 281.0) internal successors, (1967), 7 states have internal predecessors, (1967), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:43,327 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 359 flow. Second operand 6 states and 760 transitions. [2023-09-01 01:13:43,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 143 transitions, 1128 flow [2023-09-01 01:13:43,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 143 transitions, 1126 flow, removed 1 selfloop flow, removed 0 redundant places. [2023-09-01 01:13:43,367 INFO L231 Difference]: Finished difference. Result has 69 places, 55 transitions, 420 flow [2023-09-01 01:13:43,368 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=357, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=420, PETRI_PLACES=69, PETRI_TRANSITIONS=55} [2023-09-01 01:13:43,368 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-09-01 01:13:43,368 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 55 transitions, 420 flow [2023-09-01 01:13:43,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 116.28571428571429) internal successors, (814), 7 states have internal predecessors, (814), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:13:43,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:13:43,369 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:13:43,377 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 01:13:43,577 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:43,578 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:13:43,578 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:13:43,578 INFO L85 PathProgramCache]: Analyzing trace with hash 1261291806, now seen corresponding path program 1 times [2023-09-01 01:13:43,578 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:13:43,578 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563386143] [2023-09-01 01:13:43,579 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:43,579 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:13:43,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:44,064 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:13:44,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:13:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563386143] [2023-09-01 01:13:44,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [563386143] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:13:44,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [250471888] [2023-09-01 01:13:44,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:13:44,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:13:44,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:13:44,066 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:13:44,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 01:13:48,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:13:48,479 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-01 01:13:48,481 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:14:05,938 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:14:05,938 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:14:15,026 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:14:15,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [250471888] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:14:15,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:14:15,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-09-01 01:14:15,027 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1218492902] [2023-09-01 01:14:15,027 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:14:15,027 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 01:14:15,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:14:15,028 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 01:14:15,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=134, Unknown=10, NotChecked=0, Total=182 [2023-09-01 01:14:17,168 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:20,077 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:22,165 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:24,183 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:25,394 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:27,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:29,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:29,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 281 [2023-09-01 01:14:29,802 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 55 transitions, 420 flow. Second operand has 14 states, 14 states have (on average 108.21428571428571) internal successors, (1515), 14 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:14:29,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:14:29,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 281 [2023-09-01 01:14:29,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:14:37,933 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:39,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:41,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:43,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:46,013 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:48,065 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:51,642 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:53,649 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:55,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:14:58,770 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:00,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:02,633 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:03,645 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:05,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:07,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:13,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:20,591 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:21,761 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:23,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:25,767 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:27,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:29,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:31,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:33,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:35,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:36,858 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:39,139 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:41,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:44,107 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:46,106 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:49,359 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:51,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:53,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:55,883 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:15:58,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:00,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:02,763 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:07,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:09,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:10,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:13,038 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:15,274 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:16,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:18,691 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:21,169 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:23,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:25,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:28,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:30,296 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:32,462 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:34,465 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:37,393 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:40,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:42,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:44,637 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:46,309 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:48,314 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:50,319 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:52,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:54,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:57,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:16:59,164 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.47s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:01,321 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:03,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:05,713 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:07,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:09,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:10,209 INFO L130 PetriNetUnfolder]: 3347/4622 cut-off events. [2023-09-01 01:17:10,209 INFO L131 PetriNetUnfolder]: For 17105/17105 co-relation queries the response was YES. [2023-09-01 01:17:10,223 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21592 conditions, 4622 events. 3347/4622 cut-off events. For 17105/17105 co-relation queries the response was YES. Maximal size of possible extension queue 189. Compared 19658 event pairs, 399 based on Foata normal form. 3/4625 useless extension candidates. Maximal degree in co-relation 21572. Up to 3251 conditions per place. [2023-09-01 01:17:10,248 INFO L137 encePairwiseOnDemand]: 271/281 looper letters, 161 selfloop transitions, 48 changer transitions 12/221 dead transitions. [2023-09-01 01:17:10,248 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 221 transitions, 1691 flow [2023-09-01 01:17:10,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-09-01 01:17:10,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-09-01 01:17:10,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1214 transitions. [2023-09-01 01:17:10,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43202846975088965 [2023-09-01 01:17:10,252 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1214 transitions. [2023-09-01 01:17:10,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1214 transitions. [2023-09-01 01:17:10,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:17:10,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1214 transitions. [2023-09-01 01:17:10,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 121.4) internal successors, (1214), 10 states have internal predecessors, (1214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:10,259 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:10,260 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 281.0) internal successors, (3091), 11 states have internal predecessors, (3091), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:10,260 INFO L175 Difference]: Start difference. First operand has 69 places, 55 transitions, 420 flow. Second operand 10 states and 1214 transitions. [2023-09-01 01:17:10,260 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 221 transitions, 1691 flow [2023-09-01 01:17:10,294 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 75 places, 221 transitions, 1638 flow, removed 15 selfloop flow, removed 3 redundant places. [2023-09-01 01:17:10,297 INFO L231 Difference]: Finished difference. Result has 81 places, 94 transitions, 850 flow [2023-09-01 01:17:10,297 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=850, PETRI_PLACES=81, PETRI_TRANSITIONS=94} [2023-09-01 01:17:10,297 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 30 predicate places. [2023-09-01 01:17:10,297 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 94 transitions, 850 flow [2023-09-01 01:17:10,298 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.21428571428571) internal successors, (1515), 14 states have internal predecessors, (1515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:10,298 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:17:10,298 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:17:10,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-09-01 01:17:10,505 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-09-01 01:17:10,505 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:17:10,506 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:17:10,506 INFO L85 PathProgramCache]: Analyzing trace with hash 1950256391, now seen corresponding path program 1 times [2023-09-01 01:17:10,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:17:10,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220682540] [2023-09-01 01:17:10,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:17:10,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:17:10,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:17:11,029 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:17:11,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:17:11,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220682540] [2023-09-01 01:17:11,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220682540] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:17:11,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [571172394] [2023-09-01 01:17:11,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:17:11,030 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:17:11,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:17:11,031 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:17:11,034 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-09-01 01:17:11,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:17:11,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:17:11,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:17:37,412 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:17:37,413 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:17:46,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:17:46,193 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [571172394] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:17:46,193 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:17:46,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:17:46,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1978685572] [2023-09-01 01:17:46,193 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:17:46,194 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:17:46,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:17:46,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:17:46,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=167, Unknown=8, NotChecked=0, Total=240 [2023-09-01 01:17:48,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:50,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:52,788 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:54,795 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:17:55,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 281 [2023-09-01 01:17:55,749 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 94 transitions, 850 flow. Second operand has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:17:55,749 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:17:55,749 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 281 [2023-09-01 01:17:55,749 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:17:57,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:11,372 WARN L222 SmtUtils]: Spent 1.15m on a formula simplification. DAG size of input: 86 DAG size of output: 84 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:19:13,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:15,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:18,028 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:20,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:21,790 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:27,191 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:29,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:31,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:34,433 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:37,216 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:39,399 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:41,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:49,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:51,361 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:01,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:03,114 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:05,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:06,140 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:08,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:10,303 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:12,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:14,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:16,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:18,958 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:21,185 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:23,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:25,229 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:27,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:29,251 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:31,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:32,867 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:34,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:36,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:44,801 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:54,794 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:57,523 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:59,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:04,411 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:06,415 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:10,720 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:13,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:17,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:17,051 INFO L130 PetriNetUnfolder]: 4168/5784 cut-off events. [2023-09-01 01:21:17,051 INFO L131 PetriNetUnfolder]: For 24907/24907 co-relation queries the response was YES. [2023-09-01 01:21:17,067 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28966 conditions, 5784 events. 4168/5784 cut-off events. For 24907/24907 co-relation queries the response was YES. Maximal size of possible extension queue 246. Compared 25688 event pairs, 785 based on Foata normal form. 33/5817 useless extension candidates. Maximal degree in co-relation 28940. Up to 4652 conditions per place. [2023-09-01 01:21:17,091 INFO L137 encePairwiseOnDemand]: 264/281 looper letters, 181 selfloop transitions, 60 changer transitions 21/262 dead transitions. [2023-09-01 01:21:17,092 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 262 transitions, 2329 flow [2023-09-01 01:21:17,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 01:21:17,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 01:21:17,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1539 transitions. [2023-09-01 01:21:17,097 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4212975636463181 [2023-09-01 01:21:17,097 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1539 transitions. [2023-09-01 01:21:17,097 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1539 transitions. [2023-09-01 01:21:17,098 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:21:17,098 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1539 transitions. [2023-09-01 01:21:17,101 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 118.38461538461539) internal successors, (1539), 13 states have internal predecessors, (1539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:21:17,106 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:21:17,107 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:21:17,107 INFO L175 Difference]: Start difference. First operand has 81 places, 94 transitions, 850 flow. Second operand 13 states and 1539 transitions. [2023-09-01 01:21:17,107 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 262 transitions, 2329 flow [2023-09-01 01:21:17,154 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 262 transitions, 2258 flow, removed 31 selfloop flow, removed 1 redundant places. [2023-09-01 01:21:17,157 INFO L231 Difference]: Finished difference. Result has 99 places, 145 transitions, 1434 flow [2023-09-01 01:21:17,157 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=779, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=94, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=1434, PETRI_PLACES=99, PETRI_TRANSITIONS=145} [2023-09-01 01:21:17,158 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 48 predicate places. [2023-09-01 01:21:17,158 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 145 transitions, 1434 flow [2023-09-01 01:21:17,159 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:21:17,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:21:17,159 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:21:17,168 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-09-01 01:21:17,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:21:17,368 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:21:17,369 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:21:17,369 INFO L85 PathProgramCache]: Analyzing trace with hash -626367199, now seen corresponding path program 2 times [2023-09-01 01:21:17,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:21:17,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143237789] [2023-09-01 01:21:17,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:21:17,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:21:17,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:21:17,925 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:21:17,925 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:21:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143237789] [2023-09-01 01:21:17,925 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143237789] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:21:17,925 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1606964686] [2023-09-01 01:21:17,926 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:21:17,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:21:17,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:21:17,929 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:21:17,933 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-09-01 01:21:20,309 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:21:20,309 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:21:20,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 16 conjunts are in the unsatisfiable core [2023-09-01 01:21:20,313 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:21:29,079 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:21:29,079 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:21:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:21:33,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1606964686] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:21:33,578 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:21:33,578 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 12 [2023-09-01 01:21:33,578 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336992475] [2023-09-01 01:21:33,578 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:21:33,579 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-09-01 01:21:33,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:21:33,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-09-01 01:21:33,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=127, Unknown=2, NotChecked=0, Total=182 [2023-09-01 01:21:35,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:37,608 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:39,617 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:40,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:42,585 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:45,307 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:48,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:50,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:51,825 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:53,833 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:55,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:57,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:57,915 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 281 [2023-09-01 01:21:57,917 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 145 transitions, 1434 flow. Second operand has 14 states, 14 states have (on average 108.64285714285714) internal successors, (1521), 14 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:21:57,917 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:21:57,917 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 281 [2023-09-01 01:21:57,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:22:04,807 WARN L222 SmtUtils]: Spent 6.30s on a formula simplification. DAG size of input: 70 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:22:07,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:10,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:11,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:14,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:16,301 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:18,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:20,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:22,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:24,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:26,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:28,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:29,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:31,859 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:33,873 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:39,500 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:41,988 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:43,992 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:46,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:48,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:50,623 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:53,931 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.76s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:56,424 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:59,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:01,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:03,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:05,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:07,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:09,743 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:11,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:13,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:14,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:16,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:19,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:22,561 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:29,496 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:31,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:34,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:37,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:40,444 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:42,450 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:44,600 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:46,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:47,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:49,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:52,136 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:54,186 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:56,193 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:58,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:00,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:02,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:03,670 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:05,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:07,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:09,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.95s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:11,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:12,882 INFO L130 PetriNetUnfolder]: 5222/7333 cut-off events. [2023-09-01 01:24:12,882 INFO L131 PetriNetUnfolder]: For 46485/46485 co-relation queries the response was YES. [2023-09-01 01:24:12,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42521 conditions, 7333 events. 5222/7333 cut-off events. For 46485/46485 co-relation queries the response was YES. Maximal size of possible extension queue 267. Compared 34284 event pairs, 861 based on Foata normal form. 4/7337 useless extension candidates. Maximal degree in co-relation 42487. Up to 5029 conditions per place. [2023-09-01 01:24:12,972 INFO L137 encePairwiseOnDemand]: 270/281 looper letters, 233 selfloop transitions, 85 changer transitions 15/333 dead transitions. [2023-09-01 01:24:12,972 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 333 transitions, 3570 flow [2023-09-01 01:24:12,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-09-01 01:24:12,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-09-01 01:24:12,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 1554 transitions. [2023-09-01 01:24:12,979 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.425403777716945 [2023-09-01 01:24:12,979 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 1554 transitions. [2023-09-01 01:24:12,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 1554 transitions. [2023-09-01 01:24:12,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:24:12,980 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 1554 transitions. [2023-09-01 01:24:12,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 119.53846153846153) internal successors, (1554), 13 states have internal predecessors, (1554), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:24:12,988 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:24:12,989 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 281.0) internal successors, (3934), 14 states have internal predecessors, (3934), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:24:12,989 INFO L175 Difference]: Start difference. First operand has 99 places, 145 transitions, 1434 flow. Second operand 13 states and 1554 transitions. [2023-09-01 01:24:12,989 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 333 transitions, 3570 flow [2023-09-01 01:24:13,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 333 transitions, 3413 flow, removed 74 selfloop flow, removed 1 redundant places. [2023-09-01 01:24:13,108 INFO L231 Difference]: Finished difference. Result has 115 places, 191 transitions, 2072 flow [2023-09-01 01:24:13,108 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=281, PETRI_DIFFERENCE_MINUEND_FLOW=1283, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=145, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=2072, PETRI_PLACES=115, PETRI_TRANSITIONS=191} [2023-09-01 01:24:13,109 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 64 predicate places. [2023-09-01 01:24:13,109 INFO L495 AbstractCegarLoop]: Abstraction has has 115 places, 191 transitions, 2072 flow [2023-09-01 01:24:13,109 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 108.64285714285714) internal successors, (1521), 14 states have internal predecessors, (1521), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:24:13,109 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:24:13,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:24:13,117 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-09-01 01:24:13,317 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:24:13,318 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:24:13,318 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:24:13,318 INFO L85 PathProgramCache]: Analyzing trace with hash 1181634503, now seen corresponding path program 3 times [2023-09-01 01:24:13,319 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:24:13,319 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559800554] [2023-09-01 01:24:13,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:24:13,319 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:24:13,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:24:13,892 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:24:13,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:24:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559800554] [2023-09-01 01:24:13,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559800554] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:24:13,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1498057161] [2023-09-01 01:24:13,892 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-09-01 01:24:13,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:24:13,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:24:13,897 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:24:13,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-09-01 01:24:19,050 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-09-01 01:24:19,050 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:24:19,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:24:19,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:24:36,271 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:24:36,272 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:24:46,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:24:46,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1498057161] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:24:46,470 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:24:46,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:24:46,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [562576602] [2023-09-01 01:24:46,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:24:46,471 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:24:46,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:24:46,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:24:46,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=171, Unknown=8, NotChecked=0, Total=240 [2023-09-01 01:24:48,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:51,330 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:54,141 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:57,110 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:59,993 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:00,011 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 281 [2023-09-01 01:25:00,012 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 191 transitions, 2072 flow. Second operand has 16 states, 16 states have (on average 108.0625) internal successors, (1729), 16 states have internal predecessors, (1729), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:25:00,012 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:25:00,012 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 281 [2023-09-01 01:25:00,013 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:25:02,405 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:01,518 WARN L222 SmtUtils]: Spent 50.41s on a formula simplification. DAG size of input: 85 DAG size of output: 61 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:26:03,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:05,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:08,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:09,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:11,716 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:13,732 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:15,738 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:17,744 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:25,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:27,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:32,945 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:36,759 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:38,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.85s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:40,654 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:42,664 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:44,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:58,684 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:04,381 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:06,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:16,152 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.28s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:18,300 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:39,677 WARN L222 SmtUtils]: Spent 7.98s on a formula simplification. DAG size of input: 60 DAG size of output: 35 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:27:41,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:43,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:45,739 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:47,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] Killed by 15