./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --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-exp2x3.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 ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations TOGETHER --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-08-30 04:37:14,359 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-08-30 04:37:14,362 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-08-30 04:37:14,411 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-08-30 04:37:14,411 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-08-30 04:37:14,414 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-08-30 04:37:14,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-08-30 04:37:14,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-08-30 04:37:14,421 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-08-30 04:37:14,426 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-08-30 04:37:14,427 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-08-30 04:37:14,429 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-08-30 04:37:14,430 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-08-30 04:37:14,431 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-08-30 04:37:14,433 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-08-30 04:37:14,437 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-08-30 04:37:14,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-08-30 04:37:14,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-08-30 04:37:14,443 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-08-30 04:37:14,445 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-08-30 04:37:14,449 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-08-30 04:37:14,459 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-08-30 04:37:14,459 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-08-30 04:37:14,460 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-08-30 04:37:14,465 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-08-30 04:37:14,465 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-08-30 04:37:14,465 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-08-30 04:37:14,466 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-08-30 04:37:14,467 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-08-30 04:37:14,467 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-08-30 04:37:14,468 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-08-30 04:37:14,468 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-08-30 04:37:14,469 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-08-30 04:37:14,469 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-08-30 04:37:14,470 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-08-30 04:37:14,471 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-08-30 04:37:14,471 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-08-30 04:37:14,471 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-08-30 04:37:14,472 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-08-30 04:37:14,472 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-08-30 04:37:14,473 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-08-30 04:37:14,474 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-08-30 04:37:14,493 INFO L113 SettingsManager]: Loading preferences was successful [2023-08-30 04:37:14,495 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-08-30 04:37:14,496 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-08-30 04:37:14,497 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-08-30 04:37:14,498 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-08-30 04:37:14,498 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-08-30 04:37:14,498 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-08-30 04:37:14,499 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-08-30 04:37:14,499 INFO L138 SettingsManager]: * Use SBE=true [2023-08-30 04:37:14,499 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-08-30 04:37:14,500 INFO L138 SettingsManager]: * sizeof long=4 [2023-08-30 04:37:14,500 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-08-30 04:37:14,500 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-08-30 04:37:14,500 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-08-30 04:37:14,501 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-08-30 04:37:14,501 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-08-30 04:37:14,501 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-08-30 04:37:14,501 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-08-30 04:37:14,501 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-08-30 04:37:14,502 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-08-30 04:37:14,502 INFO L138 SettingsManager]: * sizeof long double=12 [2023-08-30 04:37:14,502 INFO L138 SettingsManager]: * Use constant arrays=true [2023-08-30 04:37:14,502 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-08-30 04:37:14,502 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-08-30 04:37:14,503 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-08-30 04:37:14,503 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:37:14,503 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-08-30 04:37:14,503 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-08-30 04:37:14,503 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-08-30 04:37:14,504 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-08-30 04:37:14,504 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-08-30 04:37:14,504 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-08-30 04:37:14,504 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-08-30 04:37:14,505 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-08-30 04:37:14,505 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 -> ebb6bba6491ab996b2a2d1f88baf86906cd5ba5ce7e0ad4dc20017ded9089a97 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 -> TOGETHER [2023-08-30 04:37:14,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-08-30 04:37:14,850 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-08-30 04:37:14,852 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-08-30 04:37:14,853 INFO L271 PluginConnector]: Initializing CDTParser... [2023-08-30 04:37:14,854 INFO L275 PluginConnector]: CDTParser initialized [2023-08-30 04:37:14,855 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-30 04:37:16,111 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-08-30 04:37:16,345 INFO L351 CDTParser]: Found 1 translation units. [2023-08-30 04:37:16,345 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x3.wvr.c [2023-08-30 04:37:16,355 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a76b8aa5/afc486ebb8bf4fcf9be7fa8ddf4effa8/FLAG80d7c85cd [2023-08-30 04:37:16,373 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5a76b8aa5/afc486ebb8bf4fcf9be7fa8ddf4effa8 [2023-08-30 04:37:16,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-08-30 04:37:16,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-08-30 04:37:16,377 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-08-30 04:37:16,377 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-08-30 04:37:16,380 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-08-30 04:37:16,381 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,381 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3586ddc4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16, skipping insertion in model container [2023-08-30 04:37:16,382 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,387 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-08-30 04:37:16,406 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-08-30 04:37:16,530 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-exp2x3.wvr.c[2237,2250] [2023-08-30 04:37:16,534 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:37:16,543 INFO L203 MainTranslator]: Completed pre-run [2023-08-30 04:37:16,563 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-exp2x3.wvr.c[2237,2250] [2023-08-30 04:37:16,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-08-30 04:37:16,582 INFO L208 MainTranslator]: Completed translation [2023-08-30 04:37:16,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16 WrapperNode [2023-08-30 04:37:16,583 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-08-30 04:37:16,584 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-08-30 04:37:16,584 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-08-30 04:37:16,584 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-08-30 04:37:16,590 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,608 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,637 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-08-30 04:37:16,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-08-30 04:37:16,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-08-30 04:37:16,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-08-30 04:37:16,640 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-08-30 04:37:16,647 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,647 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,658 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,658 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,671 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,680 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,684 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,689 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,692 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-08-30 04:37:16,695 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-08-30 04:37:16,695 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-08-30 04:37:16,696 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-08-30 04:37:16,696 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (1/1) ... [2023-08-30 04:37:16,703 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-08-30 04:37:16,714 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:16,730 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-08-30 04:37:16,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-08-30 04:37:16,767 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-08-30 04:37:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-08-30 04:37:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-08-30 04:37:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-08-30 04:37:16,768 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-08-30 04:37:16,768 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-08-30 04:37:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-08-30 04:37:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-08-30 04:37:16,769 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-08-30 04:37:16,769 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-08-30 04:37:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-08-30 04:37:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-08-30 04:37:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-08-30 04:37:16,770 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-08-30 04:37:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-08-30 04:37:16,770 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-08-30 04:37:16,772 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-08-30 04:37:16,883 INFO L236 CfgBuilder]: Building ICFG [2023-08-30 04:37:16,885 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-08-30 04:37:17,200 INFO L277 CfgBuilder]: Performing block encoding [2023-08-30 04:37:17,207 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-08-30 04:37:17,207 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-08-30 04:37:17,209 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:37:17 BoogieIcfgContainer [2023-08-30 04:37:17,209 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-08-30 04:37:17,211 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-08-30 04:37:17,211 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-08-30 04:37:17,213 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-08-30 04:37:17,214 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.08 04:37:16" (1/3) ... [2023-08-30 04:37:17,214 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16eb4738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:37:17, skipping insertion in model container [2023-08-30 04:37:17,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.08 04:37:16" (2/3) ... [2023-08-30 04:37:17,215 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@16eb4738 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.08 04:37:17, skipping insertion in model container [2023-08-30 04:37:17,215 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.08 04:37:17" (3/3) ... [2023-08-30 04:37:17,216 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x3.wvr.c [2023-08-30 04:37:17,228 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-08-30 04:37:17,228 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-08-30 04:37:17,228 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-08-30 04:37:17,328 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-08-30 04:37:17,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 146 places, 143 transitions, 318 flow [2023-08-30 04:37:17,414 INFO L130 PetriNetUnfolder]: 10/139 cut-off events. [2023-08-30 04:37:17,414 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 04:37:17,420 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 94 event pairs, 0 based on Foata normal form. 0/111 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 04:37:17,420 INFO L82 GeneralOperation]: Start removeDead. Operand has 146 places, 143 transitions, 318 flow [2023-08-30 04:37:17,424 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 135 transitions, 294 flow [2023-08-30 04:37:17,427 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-08-30 04:37:17,434 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 138 places, 135 transitions, 294 flow [2023-08-30 04:37:17,436 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 138 places, 135 transitions, 294 flow [2023-08-30 04:37:17,436 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 135 transitions, 294 flow [2023-08-30 04:37:17,466 INFO L130 PetriNetUnfolder]: 10/135 cut-off events. [2023-08-30 04:37:17,466 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-08-30 04:37:17,468 INFO L83 FinitePrefix]: Finished finitePrefix Result has 152 conditions, 135 events. 10/135 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 93 event pairs, 0 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 93. Up to 2 conditions per place. [2023-08-30 04:37:17,469 INFO L119 LiptonReduction]: Number of co-enabled transitions 1608 [2023-08-30 04:37:21,872 INFO L134 LiptonReduction]: Checked pairs total: 2066 [2023-08-30 04:37:21,872 INFO L136 LiptonReduction]: Total number of compositions: 130 [2023-08-30 04:37:21,886 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-08-30 04:37:21,892 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;@588a0745, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-08-30 04:37:21,892 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-08-30 04:37:21,893 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-08-30 04:37:21,893 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:21,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:21,894 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-08-30 04:37:21,895 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-08-30 04:37:21,898 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:21,898 INFO L85 PathProgramCache]: Analyzing trace with hash 516, now seen corresponding path program 1 times [2023-08-30 04:37:21,907 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:21,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730111235] [2023-08-30 04:37:21,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:21,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:21,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:21,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:21,990 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:21,990 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730111235] [2023-08-30 04:37:21,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1730111235] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:21,991 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:21,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-08-30 04:37:21,992 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337695902] [2023-08-30 04:37:21,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:22,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-08-30 04:37:22,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:22,020 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-08-30 04:37:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-08-30 04:37:22,023 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 273 [2023-08-30 04:37:22,025 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,025 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:22,025 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 273 [2023-08-30 04:37:22,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:22,133 INFO L130 PetriNetUnfolder]: 513/692 cut-off events. [2023-08-30 04:37:22,134 INFO L131 PetriNetUnfolder]: For 21/21 co-relation queries the response was YES. [2023-08-30 04:37:22,136 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1648 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-08-30 04:37:22,140 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-08-30 04:37:22,140 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-08-30 04:37:22,141 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-08-30 04:37:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-08-30 04:37:22,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 298 transitions. [2023-08-30 04:37:22,152 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5457875457875457 [2023-08-30 04:37:22,153 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 298 transitions. [2023-08-30 04:37:22,153 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 298 transitions. [2023-08-30 04:37:22,154 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:22,156 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 298 transitions. [2023-08-30 04:37:22,159 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 149.0) internal successors, (298), 2 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,164 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 273.0) internal successors, (819), 3 states have internal predecessors, (819), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,165 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 108 flow. Second operand 2 states and 298 transitions. [2023-08-30 04:37:22,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-08-30 04:37:22,169 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-08-30 04:37:22,170 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-08-30 04:37:22,172 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:22,175 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 04:37:22,175 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-08-30 04:37:22,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 128.5) internal successors, (257), 2 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,176 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:22,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 04:37:22,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-08-30 04:37:22,177 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 04:37:22,177 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:22,177 INFO L85 PathProgramCache]: Analyzing trace with hash 505234, now seen corresponding path program 1 times [2023-08-30 04:37:22,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:22,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374167656] [2023-08-30 04:37:22,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:22,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:22,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:22,524 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:22,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:22,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374167656] [2023-08-30 04:37:22,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374167656] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:22,527 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:22,527 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:22,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274798282] [2023-08-30 04:37:22,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:22,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:22,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:22,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:22,530 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:22,582 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-30 04:37:22,583 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,583 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:22,583 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-30 04:37:22,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:22,680 INFO L130 PetriNetUnfolder]: 487/656 cut-off events. [2023-08-30 04:37:22,680 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:22,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1330 conditions, 656 events. 487/656 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1532 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-08-30 04:37:22,684 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-08-30 04:37:22,684 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-08-30 04:37:22,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:22,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:22,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 408 transitions. [2023-08-30 04:37:22,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4981684981684982 [2023-08-30 04:37:22,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 408 transitions. [2023-08-30 04:37:22,688 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 408 transitions. [2023-08-30 04:37:22,688 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:22,688 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 408 transitions. [2023-08-30 04:37:22,690 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,692 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,692 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,692 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 408 transitions. [2023-08-30 04:37:22,692 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-08-30 04:37:22,693 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:37:22,694 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-08-30 04:37:22,694 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:22,695 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-08-30 04:37:22,695 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-08-30 04:37:22,695 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.0) internal successors, (372), 3 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,696 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:22,696 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-08-30 04:37:22,696 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-08-30 04:37:22,696 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 04:37:22,697 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash 505233, now seen corresponding path program 1 times [2023-08-30 04:37:22,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:22,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58705012] [2023-08-30 04:37:22,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:22,698 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:22,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:22,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:22,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58705012] [2023-08-30 04:37:22,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58705012] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:22,800 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:22,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:22,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775406857] [2023-08-30 04:37:22,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:22,802 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:22,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:22,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:22,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:22,856 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-08-30 04:37:22,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 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-08-30 04:37:22,857 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:22,857 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-08-30 04:37:22,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:22,923 INFO L130 PetriNetUnfolder]: 461/620 cut-off events. [2023-08-30 04:37:22,923 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:22,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1260 conditions, 620 events. 461/620 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1430 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-08-30 04:37:22,927 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-08-30 04:37:22,927 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-08-30 04:37:22,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:22,927 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:22,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 388 transitions. [2023-08-30 04:37:22,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47374847374847373 [2023-08-30 04:37:22,942 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 388 transitions. [2023-08-30 04:37:22,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 388 transitions. [2023-08-30 04:37:22,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:22,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 388 transitions. [2023-08-30 04:37:22,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 129.33333333333334) internal successors, (388), 3 states have internal predecessors, (388), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,945 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:22,946 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 388 transitions. [2023-08-30 04:37:22,946 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-08-30 04:37:22,946 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:22,947 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-08-30 04:37:22,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:22,948 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-08-30 04:37:22,948 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-08-30 04:37:22,948 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 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-08-30 04:37:22,949 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:22,949 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 04:37:22,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-08-30 04:37:22,949 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-08-30 04:37:22,949 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:22,949 INFO L85 PathProgramCache]: Analyzing trace with hash 485539115, now seen corresponding path program 1 times [2023-08-30 04:37:22,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:22,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1778071933] [2023-08-30 04:37:22,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:22,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:22,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:23,036 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:23,036 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:23,036 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1778071933] [2023-08-30 04:37:23,036 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1778071933] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:23,036 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:23,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:23,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1096476277] [2023-08-30 04:37:23,037 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:23,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:23,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:23,040 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:23,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:23,084 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-30 04:37:23,084 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,084 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:23,085 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-30 04:37:23,085 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:23,154 INFO L130 PetriNetUnfolder]: 445/596 cut-off events. [2023-08-30 04:37:23,156 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:23,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1213 conditions, 596 events. 445/596 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1370 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-08-30 04:37:23,161 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-08-30 04:37:23,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-08-30 04:37:23,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:23,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:23,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 404 transitions. [2023-08-30 04:37:23,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4932844932844933 [2023-08-30 04:37:23,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 404 transitions. [2023-08-30 04:37:23,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 404 transitions. [2023-08-30 04:37:23,169 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:23,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 404 transitions. [2023-08-30 04:37:23,170 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 134.66666666666666) internal successors, (404), 3 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,172 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,173 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 404 transitions. [2023-08-30 04:37:23,173 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-08-30 04:37:23,173 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:23,175 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-08-30 04:37:23,175 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:23,177 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2023-08-30 04:37:23,177 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-08-30 04:37:23,178 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 124.66666666666667) internal successors, (374), 3 states have internal predecessors, (374), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,178 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:23,178 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-08-30 04:37:23,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-08-30 04:37:23,178 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-08-30 04:37:23,179 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:23,179 INFO L85 PathProgramCache]: Analyzing trace with hash 485539113, now seen corresponding path program 1 times [2023-08-30 04:37:23,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:23,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239779086] [2023-08-30 04:37:23,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:23,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:23,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:23,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:23,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:23,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239779086] [2023-08-30 04:37:23,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239779086] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:23,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:23,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:23,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [273409159] [2023-08-30 04:37:23,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:23,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:23,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:23,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:23,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:23,342 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-08-30 04:37:23,343 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,343 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:23,343 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-08-30 04:37:23,343 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:23,406 INFO L130 PetriNetUnfolder]: 429/572 cut-off events. [2023-08-30 04:37:23,406 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:23,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1166 conditions, 572 events. 429/572 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1295 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-08-30 04:37:23,409 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-08-30 04:37:23,409 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-08-30 04:37:23,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:23,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:23,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 384 transitions. [2023-08-30 04:37:23,411 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46886446886446886 [2023-08-30 04:37:23,411 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 384 transitions. [2023-08-30 04:37:23,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 384 transitions. [2023-08-30 04:37:23,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:23,412 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 384 transitions. [2023-08-30 04:37:23,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-08-30 04:37:23,414 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,415 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,415 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 384 transitions. [2023-08-30 04:37:23,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-08-30 04:37:23,416 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:23,416 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-08-30 04:37:23,417 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:23,417 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-08-30 04:37:23,417 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-08-30 04:37:23,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 118.66666666666667) internal successors, (356), 3 states have internal predecessors, (356), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,418 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:23,418 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 04:37:23,418 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-08-30 04:37:23,418 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-08-30 04:37:23,419 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:23,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1548335376, now seen corresponding path program 1 times [2023-08-30 04:37:23,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:23,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1677181724] [2023-08-30 04:37:23,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:23,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:23,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:23,473 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:23,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:23,474 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1677181724] [2023-08-30 04:37:23,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1677181724] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:23,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:23,475 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:23,475 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1624045121] [2023-08-30 04:37:23,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:23,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:23,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:23,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:23,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:23,512 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-30 04:37:23,513 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,514 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:23,514 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-30 04:37:23,514 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:23,597 INFO L130 PetriNetUnfolder]: 403/536 cut-off events. [2023-08-30 04:37:23,597 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:23,598 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1095 conditions, 536 events. 403/536 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1185 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-08-30 04:37:23,600 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-08-30 04:37:23,600 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-08-30 04:37:23,600 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:23,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:23,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 400 transitions. [2023-08-30 04:37:23,602 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4884004884004884 [2023-08-30 04:37:23,602 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 400 transitions. [2023-08-30 04:37:23,602 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 400 transitions. [2023-08-30 04:37:23,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:23,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 400 transitions. [2023-08-30 04:37:23,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 133.33333333333334) internal successors, (400), 3 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,604 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,605 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,605 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 400 transitions. [2023-08-30 04:37:23,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-08-30 04:37:23,606 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:23,606 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-08-30 04:37:23,606 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:23,607 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2023-08-30 04:37:23,607 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-08-30 04:37:23,607 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 125.33333333333333) internal successors, (376), 3 states have internal predecessors, (376), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,607 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:23,607 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-08-30 04:37:23,608 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-08-30 04:37:23,608 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-08-30 04:37:23,608 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:23,608 INFO L85 PathProgramCache]: Analyzing trace with hash -1548335375, now seen corresponding path program 1 times [2023-08-30 04:37:23,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:23,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050009317] [2023-08-30 04:37:23,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:23,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:23,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:23,642 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:23,642 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:23,642 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050009317] [2023-08-30 04:37:23,642 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050009317] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:23,643 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:23,643 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:23,643 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435440968] [2023-08-30 04:37:23,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:23,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:23,644 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:23,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:23,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:23,691 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 117 out of 273 [2023-08-30 04:37:23,692 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,692 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:23,692 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 117 of 273 [2023-08-30 04:37:23,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:23,745 INFO L130 PetriNetUnfolder]: 377/500 cut-off events. [2023-08-30 04:37:23,745 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:23,746 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1024 conditions, 500 events. 377/500 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1076 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-08-30 04:37:23,748 INFO L137 encePairwiseOnDemand]: 270/273 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-08-30 04:37:23,748 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-08-30 04:37:23,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:23,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:23,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 380 transitions. [2023-08-30 04:37:23,750 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.463980463980464 [2023-08-30 04:37:23,750 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 380 transitions. [2023-08-30 04:37:23,750 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 380 transitions. [2023-08-30 04:37:23,751 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:23,751 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 380 transitions. [2023-08-30 04:37:23,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,753 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,753 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,753 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 380 transitions. [2023-08-30 04:37:23,753 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-08-30 04:37:23,754 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:23,755 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-08-30 04:37:23,755 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:23,755 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-08-30 04:37:23,756 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-08-30 04:37:23,756 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 119.33333333333333) internal successors, (358), 3 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:23,756 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:23,756 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 04:37:23,756 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-08-30 04:37:23,756 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 04:37:23,757 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:23,757 INFO L85 PathProgramCache]: Analyzing trace with hash -1891601682, now seen corresponding path program 1 times [2023-08-30 04:37:23,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:23,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58845986] [2023-08-30 04:37:23,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:23,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:23,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:23,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:23,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:23,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58845986] [2023-08-30 04:37:23,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [58845986] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:23,961 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:23,962 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:23,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [80704355] [2023-08-30 04:37:23,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:23,962 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:23,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:23,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:23,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:24,001 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 273 [2023-08-30 04:37:24,002 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,002 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:24,002 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 273 [2023-08-30 04:37:24,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:24,051 INFO L130 PetriNetUnfolder]: 313/420 cut-off events. [2023-08-30 04:37:24,052 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:24,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 865 conditions, 420 events. 313/420 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 852 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-08-30 04:37:24,054 INFO L137 encePairwiseOnDemand]: 271/273 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-08-30 04:37:24,054 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-08-30 04:37:24,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:24,055 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:24,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-30 04:37:24,056 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-08-30 04:37:24,056 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,056 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:24,057 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,058 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-08-30 04:37:24,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,060 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,060 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 396 transitions. [2023-08-30 04:37:24,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-08-30 04:37:24,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:24,061 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-08-30 04:37:24,061 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:24,062 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-08-30 04:37:24,062 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-08-30 04:37:24,062 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.0) internal successors, (378), 3 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,062 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:24,063 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-08-30 04:37:24,063 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-08-30 04:37:24,063 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 04:37:24,063 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:24,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1891601683, now seen corresponding path program 1 times [2023-08-30 04:37:24,064 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:24,064 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615314344] [2023-08-30 04:37:24,064 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:24,064 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:24,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:24,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:24,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:24,215 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615314344] [2023-08-30 04:37:24,215 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615314344] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:24,215 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:24,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-08-30 04:37:24,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1220583916] [2023-08-30 04:37:24,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:24,216 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:37:24,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:24,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:37:24,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:37:24,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 105 out of 273 [2023-08-30 04:37:24,314 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,314 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:24,314 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 105 of 273 [2023-08-30 04:37:24,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:24,363 INFO L130 PetriNetUnfolder]: 249/340 cut-off events. [2023-08-30 04:37:24,363 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-08-30 04:37:24,364 INFO L83 FinitePrefix]: Finished finitePrefix Result has 706 conditions, 340 events. 249/340 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 644 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-08-30 04:37:24,365 INFO L137 encePairwiseOnDemand]: 271/273 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-08-30 04:37:24,366 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-08-30 04:37:24,366 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:24,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:24,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 341 transitions. [2023-08-30 04:37:24,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4163614163614164 [2023-08-30 04:37:24,368 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 341 transitions. [2023-08-30 04:37:24,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 341 transitions. [2023-08-30 04:37:24,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:24,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 341 transitions. [2023-08-30 04:37:24,369 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 113.66666666666667) internal successors, (341), 3 states have internal predecessors, (341), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,370 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,371 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 341 transitions. [2023-08-30 04:37:24,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-08-30 04:37:24,371 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:24,372 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-08-30 04:37:24,372 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:24,373 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-08-30 04:37:24,373 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-08-30 04:37:24,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 106.5) internal successors, (639), 6 states have internal predecessors, (639), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,373 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:24,374 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-08-30 04:37:24,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-08-30 04:37:24,374 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-08-30 04:37:24,374 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:24,374 INFO L85 PathProgramCache]: Analyzing trace with hash 235458399, now seen corresponding path program 1 times [2023-08-30 04:37:24,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:24,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1764974170] [2023-08-30 04:37:24,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:24,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:24,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:24,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:24,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1764974170] [2023-08-30 04:37:24,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1764974170] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:24,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:24,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-08-30 04:37:24,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1336072064] [2023-08-30 04:37:24,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:24,606 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-08-30 04:37:24,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:24,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-08-30 04:37:24,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-08-30 04:37:24,645 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:24,645 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-08-30 04:37:24,645 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:24,646 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:24,646 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:24,743 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-08-30 04:37:24,743 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-08-30 04:37:24,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1395 conditions, 677 events. 497/677 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1784 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-08-30 04:37:24,747 INFO L137 encePairwiseOnDemand]: 267/273 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-08-30 04:37:24,747 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-08-30 04:37:24,747 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-08-30 04:37:24,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-08-30 04:37:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-08-30 04:37:24,749 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4835164835164835 [2023-08-30 04:37:24,749 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,749 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,749 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:24,750 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-08-30 04:37:24,750 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-08-30 04:37:24,752 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,752 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 273.0) internal successors, (1092), 4 states have internal predecessors, (1092), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,752 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 396 transitions. [2023-08-30 04:37:24,752 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-08-30 04:37:24,753 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:24,754 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-08-30 04:37:24,754 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, 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-08-30 04:37:24,755 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-08-30 04:37:24,755 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-08-30 04:37:24,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:24,755 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-08-30 04:37:24,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-08-30 04:37:24,756 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-08-30 04:37:24,756 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:24,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1175869988, now seen corresponding path program 1 times [2023-08-30 04:37:24,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:24,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [364874598] [2023-08-30 04:37:24,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:24,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:24,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:24,933 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:24,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:24,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [364874598] [2023-08-30 04:37:24,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [364874598] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:24,933 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:24,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 04:37:24,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122015869] [2023-08-30 04:37:24,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:24,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 04:37:24,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:24,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 04:37:24,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 04:37:24,964 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:24,966 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:24,966 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:24,967 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:24,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:25,131 INFO L130 PetriNetUnfolder]: 693/951 cut-off events. [2023-08-30 04:37:25,131 INFO L131 PetriNetUnfolder]: For 342/342 co-relation queries the response was YES. [2023-08-30 04:37:25,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 951 events. 693/951 cut-off events. For 342/342 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2804 event pairs, 67 based on Foata normal form. 32/983 useless extension candidates. Maximal degree in co-relation 2420. Up to 371 conditions per place. [2023-08-30 04:37:25,136 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 68 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-08-30 04:37:25,137 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 395 flow [2023-08-30 04:37:25,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:25,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:25,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 04:37:25,139 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776556776556777 [2023-08-30 04:37:25,140 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 04:37:25,140 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 04:37:25,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:25,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 04:37:25,142 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:25,143 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:25,144 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:25,144 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 5 states and 652 transitions. [2023-08-30 04:37:25,144 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 78 transitions, 395 flow [2023-08-30 04:37:25,146 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:25,147 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 159 flow [2023-08-30 04:37:25,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=159, PETRI_PLACES=43, PETRI_TRANSITIONS=36} [2023-08-30 04:37:25,148 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-08-30 04:37:25,148 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 159 flow [2023-08-30 04:37:25,149 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:25,149 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:25,149 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-08-30 04:37:25,149 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-08-30 04:37:25,149 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-08-30 04:37:25,150 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:25,150 INFO L85 PathProgramCache]: Analyzing trace with hash 1244741241, now seen corresponding path program 1 times [2023-08-30 04:37:25,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:25,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004926235] [2023-08-30 04:37:25,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:25,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:25,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:25,307 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:25,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:25,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004926235] [2023-08-30 04:37:25,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004926235] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:37:25,309 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [400057282] [2023-08-30 04:37:25,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:25,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:25,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:25,317 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:37:25,342 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-08-30 04:37:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:25,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 04:37:25,419 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:37:25,689 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:25,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:37:25,747 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:25,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [400057282] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:37:25,747 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:37:25,747 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 04:37:25,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1066648585] [2023-08-30 04:37:25,748 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:37:25,748 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:37:25,749 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:25,749 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:37:25,749 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:37:25,855 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:25,856 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 159 flow. Second operand has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:25,856 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:25,856 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:25,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:26,202 INFO L130 PetriNetUnfolder]: 1309/1809 cut-off events. [2023-08-30 04:37:26,203 INFO L131 PetriNetUnfolder]: For 1985/1985 co-relation queries the response was YES. [2023-08-30 04:37:26,207 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 1809 events. 1309/1809 cut-off events. For 1985/1985 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6336 event pairs, 291 based on Foata normal form. 68/1877 useless extension candidates. Maximal degree in co-relation 5610. Up to 757 conditions per place. [2023-08-30 04:37:26,216 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 98 selfloop transitions, 8 changer transitions 0/106 dead transitions. [2023-08-30 04:37:26,216 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 106 transitions, 649 flow [2023-08-30 04:37:26,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:26,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:26,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 662 transitions. [2023-08-30 04:37:26,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.484981684981685 [2023-08-30 04:37:26,219 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 662 transitions. [2023-08-30 04:37:26,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 662 transitions. [2023-08-30 04:37:26,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:26,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 662 transitions. [2023-08-30 04:37:26,221 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-08-30 04:37:26,223 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,223 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,223 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 159 flow. Second operand 5 states and 662 transitions. [2023-08-30 04:37:26,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 106 transitions, 649 flow [2023-08-30 04:37:26,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 106 transitions, 649 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:37:26,231 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 214 flow [2023-08-30 04:37:26,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=214, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-08-30 04:37:26,233 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -1 predicate places. [2023-08-30 04:37:26,233 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 214 flow [2023-08-30 04:37:26,233 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.0) internal successors, (726), 6 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,234 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:26,234 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-08-30 04:37:26,243 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-08-30 04:37:26,439 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,SelfDestructingSolverStorable11 [2023-08-30 04:37:26,440 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-08-30 04:37:26,440 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:26,440 INFO L85 PathProgramCache]: Analyzing trace with hash -898378087, now seen corresponding path program 1 times [2023-08-30 04:37:26,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:26,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042543085] [2023-08-30 04:37:26,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:26,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:26,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:26,614 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:26,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:26,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042543085] [2023-08-30 04:37:26,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042543085] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:26,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:26,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 04:37:26,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077436627] [2023-08-30 04:37:26,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:26,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 04:37:26,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:26,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 04:37:26,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 04:37:26,665 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:26,666 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 214 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,666 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:26,666 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:26,666 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:26,913 INFO L130 PetriNetUnfolder]: 1267/1767 cut-off events. [2023-08-30 04:37:26,913 INFO L131 PetriNetUnfolder]: For 3216/3216 co-relation queries the response was YES. [2023-08-30 04:37:26,916 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6452 conditions, 1767 events. 1267/1767 cut-off events. For 3216/3216 co-relation queries the response was YES. Maximal size of possible extension queue 72. Compared 6486 event pairs, 121 based on Foata normal form. 42/1809 useless extension candidates. Maximal degree in co-relation 6441. Up to 676 conditions per place. [2023-08-30 04:37:26,924 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 96 selfloop transitions, 10 changer transitions 0/106 dead transitions. [2023-08-30 04:37:26,924 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 106 transitions, 713 flow [2023-08-30 04:37:26,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:26,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 656 transitions. [2023-08-30 04:37:26,927 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4805860805860806 [2023-08-30 04:37:26,927 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 656 transitions. [2023-08-30 04:37:26,927 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 656 transitions. [2023-08-30 04:37:26,927 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:26,927 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 656 transitions. [2023-08-30 04:37:26,929 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.2) internal successors, (656), 5 states have internal predecessors, (656), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,930 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,931 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,931 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 214 flow. Second operand 5 states and 656 transitions. [2023-08-30 04:37:26,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 106 transitions, 713 flow [2023-08-30 04:37:26,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 106 transitions, 713 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-08-30 04:37:26,939 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 277 flow [2023-08-30 04:37:26,939 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-08-30 04:37:26,939 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 4 predicate places. [2023-08-30 04:37:26,940 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 277 flow [2023-08-30 04:37:26,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:26,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:26,940 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-08-30 04:37:26,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-08-30 04:37:26,941 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-08-30 04:37:26,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:26,941 INFO L85 PathProgramCache]: Analyzing trace with hash -1636193355, now seen corresponding path program 1 times [2023-08-30 04:37:26,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:26,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225980499] [2023-08-30 04:37:26,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:26,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:26,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:27,048 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:27,048 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:27,048 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225980499] [2023-08-30 04:37:27,048 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225980499] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:37:27,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1442940631] [2023-08-30 04:37:27,049 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:27,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:27,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:27,050 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:37:27,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-08-30 04:37:27,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:27,159 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 04:37:27,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:37:27,249 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:27,250 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:37:27,305 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:27,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1442940631] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:37:27,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:37:27,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 04:37:27,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636287699] [2023-08-30 04:37:27,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:37:27,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:37:27,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:27,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:37:27,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:37:27,362 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:27,363 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 277 flow. Second operand has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:27,363 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:27,363 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:27,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:27,658 INFO L130 PetriNetUnfolder]: 1677/2363 cut-off events. [2023-08-30 04:37:27,658 INFO L131 PetriNetUnfolder]: For 4871/4871 co-relation queries the response was YES. [2023-08-30 04:37:27,663 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9238 conditions, 2363 events. 1677/2363 cut-off events. For 4871/4871 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 9118 event pairs, 347 based on Foata normal form. 90/2453 useless extension candidates. Maximal degree in co-relation 9225. Up to 957 conditions per place. [2023-08-30 04:37:27,675 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 104 selfloop transitions, 10 changer transitions 0/114 dead transitions. [2023-08-30 04:37:27,675 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 114 transitions, 879 flow [2023-08-30 04:37:27,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:27,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:27,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 654 transitions. [2023-08-30 04:37:27,678 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47912087912087914 [2023-08-30 04:37:27,678 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 654 transitions. [2023-08-30 04:37:27,678 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 654 transitions. [2023-08-30 04:37:27,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:27,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 654 transitions. [2023-08-30 04:37:27,680 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.8) internal successors, (654), 5 states have internal predecessors, (654), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:27,682 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:27,683 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:27,683 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 277 flow. Second operand 5 states and 654 transitions. [2023-08-30 04:37:27,683 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 114 transitions, 879 flow [2023-08-30 04:37:27,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 114 transitions, 834 flow, removed 16 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:27,692 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 318 flow [2023-08-30 04:37:27,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=318, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-08-30 04:37:27,693 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 9 predicate places. [2023-08-30 04:37:27,693 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 318 flow [2023-08-30 04:37:27,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 121.66666666666667) internal successors, (730), 6 states have internal predecessors, (730), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:27,694 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:27,694 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-08-30 04:37:27,703 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-08-30 04:37:27,899 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,SelfDestructingSolverStorable13 [2023-08-30 04:37:27,900 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-08-30 04:37:27,900 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:27,901 INFO L85 PathProgramCache]: Analyzing trace with hash -1653076919, now seen corresponding path program 2 times [2023-08-30 04:37:27,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:27,901 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2124138433] [2023-08-30 04:37:27,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:27,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:27,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:28,021 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:28,022 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:28,022 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2124138433] [2023-08-30 04:37:28,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2124138433] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:28,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:28,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 04:37:28,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755252284] [2023-08-30 04:37:28,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:28,023 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 04:37:28,023 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:28,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 04:37:28,024 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 04:37:28,056 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:28,057 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 318 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,057 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:28,058 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:28,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:28,321 INFO L130 PetriNetUnfolder]: 1475/2065 cut-off events. [2023-08-30 04:37:28,322 INFO L131 PetriNetUnfolder]: For 4844/4844 co-relation queries the response was YES. [2023-08-30 04:37:28,327 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8746 conditions, 2065 events. 1475/2065 cut-off events. For 4844/4844 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7808 event pairs, 77 based on Foata normal form. 42/2107 useless extension candidates. Maximal degree in co-relation 8730. Up to 818 conditions per place. [2023-08-30 04:37:28,337 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 100 selfloop transitions, 9 changer transitions 2/111 dead transitions. [2023-08-30 04:37:28,337 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 111 transitions, 849 flow [2023-08-30 04:37:28,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:28,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:28,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 651 transitions. [2023-08-30 04:37:28,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47692307692307695 [2023-08-30 04:37:28,340 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 651 transitions. [2023-08-30 04:37:28,340 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 651 transitions. [2023-08-30 04:37:28,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:28,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 651 transitions. [2023-08-30 04:37:28,341 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.2) internal successors, (651), 5 states have internal predecessors, (651), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,343 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,344 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,344 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 318 flow. Second operand 5 states and 651 transitions. [2023-08-30 04:37:28,344 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 111 transitions, 849 flow [2023-08-30 04:37:28,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 111 transitions, 840 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:28,361 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 322 flow [2023-08-30 04:37:28,361 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=289, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-08-30 04:37:28,361 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-08-30 04:37:28,362 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 322 flow [2023-08-30 04:37:28,362 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,362 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:28,362 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-08-30 04:37:28,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-08-30 04:37:28,362 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-08-30 04:37:28,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:28,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1099899322, now seen corresponding path program 2 times [2023-08-30 04:37:28,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:28,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390401123] [2023-08-30 04:37:28,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:28,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:28,475 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:28,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390401123] [2023-08-30 04:37:28,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390401123] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:37:28,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1453210602] [2023-08-30 04:37:28,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:37:28,476 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:28,476 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:28,477 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:37:28,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-08-30 04:37:28,585 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 04:37:28,585 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:37:28,587 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 04:37:28,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:37:28,695 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:28,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:37:28,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:28,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1453210602] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:37:28,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:37:28,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 04:37:28,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540672921] [2023-08-30 04:37:28,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:37:28,753 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:37:28,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:28,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:37:28,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:37:28,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:28,823 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 322 flow. Second operand has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:28,823 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:28,823 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:28,823 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:29,139 INFO L130 PetriNetUnfolder]: 1719/2393 cut-off events. [2023-08-30 04:37:29,140 INFO L131 PetriNetUnfolder]: For 5907/5907 co-relation queries the response was YES. [2023-08-30 04:37:29,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10668 conditions, 2393 events. 1719/2393 cut-off events. For 5907/5907 co-relation queries the response was YES. Maximal size of possible extension queue 93. Compared 8942 event pairs, 311 based on Foata normal form. 84/2477 useless extension candidates. Maximal degree in co-relation 10651. Up to 1357 conditions per place. [2023-08-30 04:37:29,162 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 101 selfloop transitions, 8 changer transitions 0/109 dead transitions. [2023-08-30 04:37:29,162 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 109 transitions, 869 flow [2023-08-30 04:37:29,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:29,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:29,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 648 transitions. [2023-08-30 04:37:29,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4747252747252747 [2023-08-30 04:37:29,165 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 648 transitions. [2023-08-30 04:37:29,165 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 648 transitions. [2023-08-30 04:37:29,165 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:29,165 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 648 transitions. [2023-08-30 04:37:29,167 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 129.6) internal successors, (648), 5 states have internal predecessors, (648), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,170 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,170 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 322 flow. Second operand 5 states and 648 transitions. [2023-08-30 04:37:29,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 109 transitions, 869 flow [2023-08-30 04:37:29,183 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 109 transitions, 862 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:29,185 INFO L231 Difference]: Finished difference. Result has 69 places, 51 transitions, 369 flow [2023-08-30 04:37:29,185 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=315, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=369, PETRI_PLACES=69, PETRI_TRANSITIONS=51} [2023-08-30 04:37:29,186 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 18 predicate places. [2023-08-30 04:37:29,186 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 51 transitions, 369 flow [2023-08-30 04:37:29,186 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.66666666666667) internal successors, (736), 6 states have internal predecessors, (736), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:29,187 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-08-30 04:37:29,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-08-30 04:37:29,392 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:29,393 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-08-30 04:37:29,393 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:29,393 INFO L85 PathProgramCache]: Analyzing trace with hash 1775166833, now seen corresponding path program 2 times [2023-08-30 04:37:29,393 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:29,393 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193890601] [2023-08-30 04:37:29,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:29,394 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:29,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:29,510 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:29,511 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:29,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193890601] [2023-08-30 04:37:29,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193890601] provided 1 perfect and 0 imperfect interpolant sequences [2023-08-30 04:37:29,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-08-30 04:37:29,512 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-08-30 04:37:29,512 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235885947] [2023-08-30 04:37:29,512 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-08-30 04:37:29,512 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-08-30 04:37:29,514 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:29,514 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-08-30 04:37:29,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-08-30 04:37:29,553 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:29,554 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 51 transitions, 369 flow. Second operand has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,554 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:29,555 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:29,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:29,824 INFO L130 PetriNetUnfolder]: 1441/1985 cut-off events. [2023-08-30 04:37:29,824 INFO L131 PetriNetUnfolder]: For 8603/8603 co-relation queries the response was YES. [2023-08-30 04:37:29,830 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9491 conditions, 1985 events. 1441/1985 cut-off events. For 8603/8603 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 7363 event pairs, 61 based on Foata normal form. 34/2019 useless extension candidates. Maximal degree in co-relation 9471. Up to 818 conditions per place. [2023-08-30 04:37:29,839 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 114 selfloop transitions, 9 changer transitions 4/127 dead transitions. [2023-08-30 04:37:29,840 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 127 transitions, 1146 flow [2023-08-30 04:37:29,840 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:29,840 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:29,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 655 transitions. [2023-08-30 04:37:29,844 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47985347985347987 [2023-08-30 04:37:29,844 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 655 transitions. [2023-08-30 04:37:29,844 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 655 transitions. [2023-08-30 04:37:29,844 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:29,844 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 655 transitions. [2023-08-30 04:37:29,846 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 131.0) internal successors, (655), 5 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,848 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,848 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,848 INFO L175 Difference]: Start difference. First operand has 69 places, 51 transitions, 369 flow. Second operand 5 states and 655 transitions. [2023-08-30 04:37:29,848 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 127 transitions, 1146 flow [2023-08-30 04:37:29,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 127 transitions, 1089 flow, removed 24 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:29,858 INFO L231 Difference]: Finished difference. Result has 73 places, 50 transitions, 367 flow [2023-08-30 04:37:29,858 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=334, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=367, PETRI_PLACES=73, PETRI_TRANSITIONS=50} [2023-08-30 04:37:29,859 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 22 predicate places. [2023-08-30 04:37:29,859 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 50 transitions, 367 flow [2023-08-30 04:37:29,859 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 121.5) internal successors, (486), 4 states have internal predecessors, (486), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:29,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:29,860 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-08-30 04:37:29,860 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-08-30 04:37:29,860 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-08-30 04:37:29,860 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:29,860 INFO L85 PathProgramCache]: Analyzing trace with hash -1772330553, now seen corresponding path program 2 times [2023-08-30 04:37:29,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:29,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484038406] [2023-08-30 04:37:29,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:29,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:29,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:30,013 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:30,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484038406] [2023-08-30 04:37:30,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484038406] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:37:30,013 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1642078400] [2023-08-30 04:37:30,014 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:37:30,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:30,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:30,015 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:37:30,042 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-08-30 04:37:30,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 04:37:30,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:37:30,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-08-30 04:37:30,127 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:37:30,223 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:30,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:37:30,279 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:30,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1642078400] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:37:30,279 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:37:30,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-08-30 04:37:30,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [968099196] [2023-08-30 04:37:30,280 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:37:30,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-08-30 04:37:30,281 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:30,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-08-30 04:37:30,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-08-30 04:37:30,344 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 273 [2023-08-30 04:37:30,345 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 50 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:30,345 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:37:30,345 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 273 [2023-08-30 04:37:30,345 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:37:30,668 INFO L130 PetriNetUnfolder]: 1657/2269 cut-off events. [2023-08-30 04:37:30,669 INFO L131 PetriNetUnfolder]: For 8079/8079 co-relation queries the response was YES. [2023-08-30 04:37:30,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10979 conditions, 2269 events. 1657/2269 cut-off events. For 8079/8079 co-relation queries the response was YES. Maximal size of possible extension queue 92. Compared 8115 event pairs, 481 based on Foata normal form. 68/2337 useless extension candidates. Maximal degree in co-relation 10958. Up to 1331 conditions per place. [2023-08-30 04:37:30,687 INFO L137 encePairwiseOnDemand]: 268/273 looper letters, 117 selfloop transitions, 8 changer transitions 0/125 dead transitions. [2023-08-30 04:37:30,687 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 125 transitions, 1114 flow [2023-08-30 04:37:30,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-08-30 04:37:30,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-08-30 04:37:30,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 652 transitions. [2023-08-30 04:37:30,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4776556776556777 [2023-08-30 04:37:30,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 652 transitions. [2023-08-30 04:37:30,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 652 transitions. [2023-08-30 04:37:30,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:37:30,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 652 transitions. [2023-08-30 04:37:30,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 130.4) internal successors, (652), 5 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:30,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:30,694 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 273.0) internal successors, (1638), 6 states have internal predecessors, (1638), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:30,694 INFO L175 Difference]: Start difference. First operand has 73 places, 50 transitions, 367 flow. Second operand 5 states and 652 transitions. [2023-08-30 04:37:30,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 125 transitions, 1114 flow [2023-08-30 04:37:30,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 125 transitions, 1105 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-08-30 04:37:30,704 INFO L231 Difference]: Finished difference. Result has 78 places, 53 transitions, 408 flow [2023-08-30 04:37:30,704 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=358, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=408, PETRI_PLACES=78, PETRI_TRANSITIONS=53} [2023-08-30 04:37:30,704 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 27 predicate places. [2023-08-30 04:37:30,704 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 53 transitions, 408 flow [2023-08-30 04:37:30,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 122.0) internal successors, (732), 6 states have internal predecessors, (732), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:37:30,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:37:30,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, 1] [2023-08-30 04:37:30,712 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-08-30 04:37:30,912 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-08-30 04:37:30,912 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-08-30 04:37:30,913 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:37:30,913 INFO L85 PathProgramCache]: Analyzing trace with hash 1296094535, now seen corresponding path program 1 times [2023-08-30 04:37:30,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:37:30,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124206196] [2023-08-30 04:37:30,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:30,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:37:30,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:31,443 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:31,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:37:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124206196] [2023-08-30 04:37:31,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124206196] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:37:31,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2138252178] [2023-08-30 04:37:31,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:37:31,444 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:37:31,444 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:37:31,445 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:37:31,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-08-30 04:37:31,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:37:31,796 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 04:37:31,798 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:37:44,424 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:44,424 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:37:53,901 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:37:53,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2138252178] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:37:53,901 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:37:53,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-30 04:37:53,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740040964] [2023-08-30 04:37:53,902 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:37:53,902 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 04:37:53,902 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:37:53,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 04:37:53,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=168, Unknown=6, NotChecked=0, Total=240 [2023-08-30 04:37:56,057 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-08-30 04:37:58,177 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-08-30 04:37:59,701 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:38:01,706 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-08-30 04:38:03,831 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-08-30 04:38:06,179 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-08-30 04:38:08,251 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-08-30 04:38:08,256 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-08-30 04:38:08,257 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 53 transitions, 408 flow. Second operand has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:38:08,258 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:38:08,258 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-08-30 04:38:08,258 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:39:43,271 WARN L222 SmtUtils]: Spent 1.54m on a formula simplification. DAG size of input: 93 DAG size of output: 53 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:39:45,298 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-08-30 04:39:54,868 WARN L222 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 56 DAG size of output: 30 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:39:56,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:40:02,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:40:11,088 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-08-30 04:40:12,529 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:40:14,565 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-08-30 04:40:16,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-08-30 04:40:18,971 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-08-30 04:40:21,891 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-08-30 04:40:23,940 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-08-30 04:40:26,539 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-08-30 04:40:28,547 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-08-30 04:40:30,551 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-08-30 04:40:32,560 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-08-30 04:40:34,572 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-08-30 04:40:36,587 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-08-30 04:40:38,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-08-30 04:40:40,612 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-08-30 04:40:42,615 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-08-30 04:40:44,620 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-08-30 04:40:46,839 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-08-30 04:41:01,869 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-08-30 04:41:05,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-08-30 04:41:07,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:41:08,945 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-08-30 04:41:10,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.29s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:41:12,015 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-08-30 04:41:14,026 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (mod c_~x3~0 4294967296)) (.cse0 (mod c_~n~0 4294967296)) (.cse1 (mod (div (- c_~x1~0) (- 2)) 4294967296))) (and (= (mod c_~x2~0 2) 0) (<= .cse0 (mod c_~x1~0 4294967296)) (< .cse1 .cse0) (= .cse2 (mod c_~x4~0 4294967296)) (< 0 .cse2) (= (mod c_~x1~0 2) 0) (= (mod (div (- c_~x2~0) (- 2)) 4294967296) .cse1) (or (let ((.cse5 (* 2 c_~x2~0))) (let ((.cse4 (+ (* 4294967296 (div c_~x1~0 4294967296)) .cse5)) (.cse3 (* (div .cse5 4294967296) 4294967296))) (and (<= (+ c_~x1~0 .cse3) .cse4) (= (+ (* 4294967296 (div c_~x3~0 4294967296)) c_~x4~0) (+ c_~x3~0 (* (div c_~x4~0 4294967296) 4294967296))) (< .cse4 (+ c_~x1~0 .cse3 1))))) (< (* (mod c_~x2~0 2147483648) 2) .cse0)) (<= (+ .cse1 1) (mod c_~x2~0 4294967296)))) is different from false [2023-08-30 04:41:16,497 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-08-30 04:41:18,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-08-30 04:41:20,510 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-08-30 04:41:22,518 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-08-30 04:41:24,961 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-08-30 04:41:27,209 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-08-30 04:41:32,012 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-08-30 04:41:35,791 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-08-30 04:41:37,836 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-08-30 04:41:41,980 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-08-30 04:41:44,648 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-08-30 04:41:46,582 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:41:49,284 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-08-30 04:41:52,293 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-08-30 04:41:54,612 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-08-30 04:41:57,896 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-08-30 04:42:00,913 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-08-30 04:42:02,921 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-08-30 04:42:04,864 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:42:06,929 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-08-30 04:42:09,407 INFO L130 PetriNetUnfolder]: 3241/4538 cut-off events. [2023-08-30 04:42:09,407 INFO L131 PetriNetUnfolder]: For 15479/15479 co-relation queries the response was YES. [2023-08-30 04:42:09,425 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22220 conditions, 4538 events. 3241/4538 cut-off events. For 15479/15479 co-relation queries the response was YES. Maximal size of possible extension queue 176. Compared 19837 event pairs, 232 based on Foata normal form. 26/4564 useless extension candidates. Maximal degree in co-relation 22196. Up to 2535 conditions per place. [2023-08-30 04:42:09,454 INFO L137 encePairwiseOnDemand]: 255/273 looper letters, 229 selfloop transitions, 118 changer transitions 10/357 dead transitions. [2023-08-30 04:42:09,455 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 357 transitions, 2876 flow [2023-08-30 04:42:09,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-08-30 04:42:09,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2023-08-30 04:42:09,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 2033 transitions. [2023-08-30 04:42:09,461 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4380521439344969 [2023-08-30 04:42:09,461 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 2033 transitions. [2023-08-30 04:42:09,461 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 2033 transitions. [2023-08-30 04:42:09,462 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:42:09,462 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 2033 transitions. [2023-08-30 04:42:09,466 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 119.58823529411765) internal successors, (2033), 17 states have internal predecessors, (2033), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:42:09,472 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:42:09,473 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 273.0) internal successors, (4914), 18 states have internal predecessors, (4914), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:42:09,473 INFO L175 Difference]: Start difference. First operand has 78 places, 53 transitions, 408 flow. Second operand 17 states and 2033 transitions. [2023-08-30 04:42:09,473 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 357 transitions, 2876 flow [2023-08-30 04:42:09,495 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 357 transitions, 2826 flow, removed 20 selfloop flow, removed 2 redundant places. [2023-08-30 04:42:09,499 INFO L231 Difference]: Finished difference. Result has 103 places, 168 transitions, 1764 flow [2023-08-30 04:42:09,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=384, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=19, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=1764, PETRI_PLACES=103, PETRI_TRANSITIONS=168} [2023-08-30 04:42:09,499 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 52 predicate places. [2023-08-30 04:42:09,500 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 168 transitions, 1764 flow [2023-08-30 04:42:09,501 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 107.8125) internal successors, (1725), 16 states have internal predecessors, (1725), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:42:09,501 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:42:09,501 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-08-30 04:42:09,508 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-08-30 04:42:09,708 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-08-30 04:42:09,708 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-08-30 04:42:09,708 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:42:09,708 INFO L85 PathProgramCache]: Analyzing trace with hash 1939873210, now seen corresponding path program 1 times [2023-08-30 04:42:09,709 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:42:09,709 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [999830150] [2023-08-30 04:42:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:42:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:42:09,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:42:10,258 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:42:10,258 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:42:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [999830150] [2023-08-30 04:42:10,258 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [999830150] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:42:10,258 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1493664] [2023-08-30 04:42:10,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:42:10,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:42:10,259 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:42:10,261 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:42:10,287 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-08-30 04:42:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:42:10,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-08-30 04:42:10,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:42:23,605 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:42:23,605 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:42:32,957 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:42:32,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1493664] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:42:32,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:42:32,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-30 04:42:32,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [187704424] [2023-08-30 04:42:32,959 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:42:32,959 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 04:42:32,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:42:32,960 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 04:42:32,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=167, Unknown=8, NotChecked=0, Total=240 [2023-08-30 04:42:35,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-08-30 04:42:37,497 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-08-30 04:42:39,776 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-08-30 04:42:42,072 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-08-30 04:42:44,100 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-08-30 04:42:44,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-08-30 04:42:44,107 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 168 transitions, 1764 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-08-30 04:42:44,107 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:42:44,107 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-08-30 04:42:44,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:42:45,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.75s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:42:47,979 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-08-30 04:43:03,132 WARN L222 SmtUtils]: Spent 11.02s on a formula simplification. DAG size of input: 66 DAG size of output: 27 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:44:18,009 WARN L222 SmtUtils]: Spent 1.17m on a formula simplification. DAG size of input: 88 DAG size of output: 74 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:44:20,018 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-08-30 04:44:23,449 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-08-30 04:44:25,466 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-08-30 04:44:30,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-08-30 04:44:32,722 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-08-30 04:44:35,394 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-08-30 04:44:38,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:44:40,490 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-08-30 04:44:41,803 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-08-30 04:44:45,842 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-08-30 04:44:49,811 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-08-30 04:44:51,822 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-08-30 04:45:02,502 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-08-30 04:45:04,860 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-08-30 04:45:07,647 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-08-30 04:45:10,285 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-08-30 04:45:12,955 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-08-30 04:45:14,961 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-08-30 04:45:17,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:45:19,214 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-08-30 04:45:21,995 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-08-30 04:45:24,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-08-30 04:45:26,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-08-30 04:45:28,849 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-08-30 04:45:34,794 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-08-30 04:45:37,578 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-08-30 04:45:40,781 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-08-30 04:45:42,836 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-08-30 04:45:45,199 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-08-30 04:45:48,721 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-08-30 04:45:50,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:45:52,242 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-08-30 04:45:53,395 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:45:56,821 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-08-30 04:45:58,825 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-08-30 04:46:00,956 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-08-30 04:46:01,970 INFO L130 PetriNetUnfolder]: 4619/6474 cut-off events. [2023-08-30 04:46:01,971 INFO L131 PetriNetUnfolder]: For 34873/34873 co-relation queries the response was YES. [2023-08-30 04:46:01,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39484 conditions, 6474 events. 4619/6474 cut-off events. For 34873/34873 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 30259 event pairs, 410 based on Foata normal form. 19/6493 useless extension candidates. Maximal degree in co-relation 39449. Up to 4588 conditions per place. [2023-08-30 04:46:02,027 INFO L137 encePairwiseOnDemand]: 256/273 looper letters, 323 selfloop transitions, 109 changer transitions 34/466 dead transitions. [2023-08-30 04:46:02,028 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 466 transitions, 4981 flow [2023-08-30 04:46:02,028 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-08-30 04:46:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-08-30 04:46:02,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 2132 transitions. [2023-08-30 04:46:02,034 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43386243386243384 [2023-08-30 04:46:02,035 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 2132 transitions. [2023-08-30 04:46:02,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 2132 transitions. [2023-08-30 04:46:02,036 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:46:02,036 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 2132 transitions. [2023-08-30 04:46:02,041 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 118.44444444444444) internal successors, (2132), 18 states have internal predecessors, (2132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:46:02,046 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 273.0) internal successors, (5187), 19 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:46:02,047 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 273.0) internal successors, (5187), 19 states have internal predecessors, (5187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:46:02,047 INFO L175 Difference]: Start difference. First operand has 103 places, 168 transitions, 1764 flow. Second operand 18 states and 2132 transitions. [2023-08-30 04:46:02,047 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 466 transitions, 4981 flow [2023-08-30 04:46:02,149 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 466 transitions, 4757 flow, removed 112 selfloop flow, removed 0 redundant places. [2023-08-30 04:46:02,156 INFO L231 Difference]: Finished difference. Result has 131 places, 277 transitions, 3061 flow [2023-08-30 04:46:02,156 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=1540, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=168, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=137, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3061, PETRI_PLACES=131, PETRI_TRANSITIONS=277} [2023-08-30 04:46:02,158 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 80 predicate places. [2023-08-30 04:46:02,158 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 277 transitions, 3061 flow [2023-08-30 04:46:02,158 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-08-30 04:46:02,159 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:46:02,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-08-30 04:46:02,167 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-08-30 04:46:02,365 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-08-30 04:46:02,365 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-08-30 04:46:02,366 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:46:02,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1467567366, now seen corresponding path program 2 times [2023-08-30 04:46:02,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:46:02,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1770036469] [2023-08-30 04:46:02,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:46:02,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:46:02,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:46:02,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:46:02,889 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:46:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1770036469] [2023-08-30 04:46:02,889 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1770036469] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:46:02,889 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395973604] [2023-08-30 04:46:02,890 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:46:02,890 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:46:02,890 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:46:02,891 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:46:02,897 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-08-30 04:46:03,186 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 04:46:03,186 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:46:03,188 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 18 conjunts are in the unsatisfiable core [2023-08-30 04:46:03,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:46:29,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:46:29,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:46:55,174 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:46:55,174 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395973604] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:46:55,174 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:46:55,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 6, 6] total 16 [2023-08-30 04:46:55,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [771134303] [2023-08-30 04:46:55,175 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:46:55,175 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-08-30 04:46:55,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:46:55,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-08-30 04:46:55,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=216, Unknown=4, NotChecked=0, Total=306 [2023-08-30 04:46:56,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:46:59,113 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-08-30 04:47:01,636 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-08-30 04:47:03,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:47:05,604 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-08-30 04:47:07,836 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-08-30 04:47:09,663 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-08-30 04:47:09,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-08-30 04:47:09,804 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 277 transitions, 3061 flow. Second operand has 18 states, 18 states have (on average 107.61111111111111) internal successors, (1937), 18 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:47:09,804 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:47:09,804 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-08-30 04:47:09,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:47:12,207 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-08-30 04:47:14,213 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-08-30 04:47:16,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:47:18,951 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-08-30 04:47:22,756 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-08-30 04:47:24,778 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-08-30 04:47:28,406 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-08-30 04:47:30,420 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-08-30 04:47:32,426 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-08-30 04:47:34,430 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-08-30 04:47:35,948 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:47:37,952 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-08-30 04:47:40,020 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.07s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:47:44,076 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-08-30 04:47:46,594 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-08-30 04:47:48,641 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-08-30 04:47:50,644 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-08-30 04:48:18,284 WARN L222 SmtUtils]: Spent 15.73s on a formula simplification. DAG size of input: 52 DAG size of output: 26 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-08-30 04:48:19,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:48:21,683 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-08-30 04:48:23,832 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-08-30 04:48:26,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-08-30 04:48:28,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:48:30,957 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-08-30 04:48:34,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:48:36,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:48:38,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:48:39,610 INFO L130 PetriNetUnfolder]: 6839/9966 cut-off events. [2023-08-30 04:48:39,610 INFO L131 PetriNetUnfolder]: For 77409/77409 co-relation queries the response was YES. [2023-08-30 04:48:39,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67129 conditions, 9966 events. 6839/9966 cut-off events. For 77409/77409 co-relation queries the response was YES. Maximal size of possible extension queue 455. Compared 54732 event pairs, 273 based on Foata normal form. 25/9991 useless extension candidates. Maximal degree in co-relation 67082. Up to 4659 conditions per place. [2023-08-30 04:48:39,694 INFO L137 encePairwiseOnDemand]: 261/273 looper letters, 453 selfloop transitions, 249 changer transitions 73/775 dead transitions. [2023-08-30 04:48:39,694 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 153 places, 775 transitions, 9455 flow [2023-08-30 04:48:39,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-08-30 04:48:39,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-08-30 04:48:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 2705 transitions. [2023-08-30 04:48:39,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43080108297499603 [2023-08-30 04:48:39,707 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 2705 transitions. [2023-08-30 04:48:39,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 2705 transitions. [2023-08-30 04:48:39,709 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-08-30 04:48:39,709 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 2705 transitions. [2023-08-30 04:48:39,714 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 117.6086956521739) internal successors, (2705), 23 states have internal predecessors, (2705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:48:39,724 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:48:39,725 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 273.0) internal successors, (6552), 24 states have internal predecessors, (6552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:48:39,726 INFO L175 Difference]: Start difference. First operand has 131 places, 277 transitions, 3061 flow. Second operand 23 states and 2705 transitions. [2023-08-30 04:48:39,726 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 153 places, 775 transitions, 9455 flow [2023-08-30 04:48:40,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 152 places, 775 transitions, 8808 flow, removed 319 selfloop flow, removed 1 redundant places. [2023-08-30 04:48:40,017 INFO L231 Difference]: Finished difference. Result has 165 places, 464 transitions, 5503 flow [2023-08-30 04:48:40,018 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=273, PETRI_DIFFERENCE_MINUEND_FLOW=2646, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=277, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=98, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=139, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=5503, PETRI_PLACES=165, PETRI_TRANSITIONS=464} [2023-08-30 04:48:40,018 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 114 predicate places. [2023-08-30 04:48:40,018 INFO L495 AbstractCegarLoop]: Abstraction has has 165 places, 464 transitions, 5503 flow [2023-08-30 04:48:40,019 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 107.61111111111111) internal successors, (1937), 18 states have internal predecessors, (1937), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:48:40,019 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-08-30 04:48:40,019 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-08-30 04:48:40,026 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2023-08-30 04:48:40,226 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:48:40,227 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-08-30 04:48:40,227 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-08-30 04:48:40,227 INFO L85 PathProgramCache]: Analyzing trace with hash -391939901, now seen corresponding path program 2 times [2023-08-30 04:48:40,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-08-30 04:48:40,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1527578747] [2023-08-30 04:48:40,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-08-30 04:48:40,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-08-30 04:48:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-08-30 04:48:40,712 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:48:40,713 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-08-30 04:48:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1527578747] [2023-08-30 04:48:40,713 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1527578747] provided 0 perfect and 1 imperfect interpolant sequences [2023-08-30 04:48:40,713 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [274384448] [2023-08-30 04:48:40,713 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-08-30 04:48:40,713 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-08-30 04:48:40,713 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-08-30 04:48:40,717 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-08-30 04:48:40,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-08-30 04:48:40,904 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-08-30 04:48:40,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-08-30 04:48:40,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 32 conjunts are in the unsatisfiable core [2023-08-30 04:48:40,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-08-30 04:49:05,055 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:49:05,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-08-30 04:50:03,522 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-08-30 04:50:03,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [274384448] provided 0 perfect and 2 imperfect interpolant sequences [2023-08-30 04:50:03,522 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-08-30 04:50:03,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-08-30 04:50:03,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232154682] [2023-08-30 04:50:03,522 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-08-30 04:50:03,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-08-30 04:50:03,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-08-30 04:50:03,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-08-30 04:50:03,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=151, Unknown=3, NotChecked=0, Total=240 [2023-08-30 04:50:05,442 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-08-30 04:50:07,473 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-08-30 04:50:09,480 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-08-30 04:50:11,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:50:14,518 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-08-30 04:50:16,111 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:50:18,172 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-08-30 04:50:20,225 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-08-30 04:50:22,279 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-08-30 04:50:22,289 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 273 [2023-08-30 04:50:22,290 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 165 places, 464 transitions, 5503 flow. Second operand has 16 states, 16 states have (on average 107.6875) internal successors, (1723), 16 states have internal predecessors, (1723), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-08-30 04:50:22,290 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-08-30 04:50:22,290 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 273 [2023-08-30 04:50:22,290 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-08-30 04:50:24,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:50:27,722 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-08-30 04:50:30,085 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-08-30 04:50:32,103 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-08-30 04:50:34,199 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-08-30 04:50:37,040 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-08-30 04:50:38,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:50:40,387 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-08-30 04:50:42,694 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-08-30 04:50:44,753 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-08-30 04:50:47,737 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-08-30 04:50:49,745 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-08-30 04:50:52,349 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-08-30 04:50:55,358 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-08-30 04:50:57,370 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-08-30 04:50:59,383 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-08-30 04:51:01,469 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:51:03,550 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-08-30 04:51:06,832 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-08-30 04:51:09,740 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-08-30 04:51:11,832 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-08-30 04:51:13,908 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-08-30 04:51:17,021 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-08-30 04:51:19,428 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-08-30 04:51:21,441 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-08-30 04:51:23,019 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-08-30 04:51:25,116 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-08-30 04:51:27,815 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-08-30 04:51:30,424 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-08-30 04:51:35,486 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-08-30 04:51:36,670 INFO L130 PetriNetUnfolder]: 11114/16421 cut-off events. [2023-08-30 04:51:36,670 INFO L131 PetriNetUnfolder]: For 178428/178428 co-relation queries the response was YES. Killed by 15