./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c --full-output --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version b8dbc81d Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/weaver/bench-exp2x9.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 d6a1dd92aa2998cfb1326128fd549d301e029b328accb048c4d2ec692e416e63 --traceabstraction.when.to.check.the.insufficient.erros.location.relative.to.the.other.error.locations BEFORE --- Real Ultimate output --- This is Ultimate 0.2.3-?-b8dbc81 [2023-09-01 01:15:44,426 INFO L177 SettingsManager]: Resetting all preferences to default values... [2023-09-01 01:15:44,429 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2023-09-01 01:15:44,473 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2023-09-01 01:15:44,475 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2023-09-01 01:15:44,479 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2023-09-01 01:15:44,481 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2023-09-01 01:15:44,483 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2023-09-01 01:15:44,485 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2023-09-01 01:15:44,490 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2023-09-01 01:15:44,491 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2023-09-01 01:15:44,493 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2023-09-01 01:15:44,493 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2023-09-01 01:15:44,495 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2023-09-01 01:15:44,496 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2023-09-01 01:15:44,501 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2023-09-01 01:15:44,503 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2023-09-01 01:15:44,504 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2023-09-01 01:15:44,505 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2023-09-01 01:15:44,510 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2023-09-01 01:15:44,519 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2023-09-01 01:15:44,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2023-09-01 01:15:44,521 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2023-09-01 01:15:44,522 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2023-09-01 01:15:44,529 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2023-09-01 01:15:44,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2023-09-01 01:15:44,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2023-09-01 01:15:44,531 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2023-09-01 01:15:44,532 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2023-09-01 01:15:44,533 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2023-09-01 01:15:44,533 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2023-09-01 01:15:44,539 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2023-09-01 01:15:44,541 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2023-09-01 01:15:44,542 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2023-09-01 01:15:44,543 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2023-09-01 01:15:44,543 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2023-09-01 01:15:44,543 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2023-09-01 01:15:44,544 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2023-09-01 01:15:44,544 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2023-09-01 01:15:44,545 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2023-09-01 01:15:44,545 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2023-09-01 01:15:44,547 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-09-01 01:15:44,581 INFO L113 SettingsManager]: Loading preferences was successful [2023-09-01 01:15:44,581 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2023-09-01 01:15:44,582 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-09-01 01:15:44,582 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-09-01 01:15:44,583 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-09-01 01:15:44,583 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-09-01 01:15:44,584 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-09-01 01:15:44,584 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2023-09-01 01:15:44,584 INFO L138 SettingsManager]: * Use SBE=true [2023-09-01 01:15:44,585 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * sizeof long=4 [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * sizeof POINTER=4 [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2023-09-01 01:15:44,586 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-09-01 01:15:44,587 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2023-09-01 01:15:44,587 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-09-01 01:15:44,587 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-09-01 01:15:44,587 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-09-01 01:15:44,587 INFO L138 SettingsManager]: * sizeof long double=12 [2023-09-01 01:15:44,588 INFO L138 SettingsManager]: * Use constant arrays=true [2023-09-01 01:15:44,588 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-09-01 01:15:44,588 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-09-01 01:15:44,588 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2023-09-01 01:15:44,588 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:15:44,589 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-09-01 01:15:44,589 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-09-01 01:15:44,589 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2023-09-01 01:15:44,589 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-09-01 01:15:44,589 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-09-01 01:15:44,590 INFO L138 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-09-01 01:15:44,590 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-09-01 01:15:44,590 INFO L138 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-09-01 01:15:44,590 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 -> d6a1dd92aa2998cfb1326128fd549d301e029b328accb048c4d2ec692e416e63 Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: When to check the insufficient erros location relative to the other error locations -> BEFORE [2023-09-01 01:15:44,917 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-09-01 01:15:44,937 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-09-01 01:15:44,940 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-09-01 01:15:44,941 INFO L271 PluginConnector]: Initializing CDTParser... [2023-09-01 01:15:44,942 INFO L275 PluginConnector]: CDTParser initialized [2023-09-01 01:15:44,943 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-09-01 01:15:46,229 INFO L500 CDTParser]: Created temporary CDT project at NULL [2023-09-01 01:15:46,442 INFO L351 CDTParser]: Found 1 translation units. [2023-09-01 01:15:46,443 INFO L172 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/weaver/bench-exp2x9.wvr.c [2023-09-01 01:15:46,451 INFO L394 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fac4c38/aff29fe938b140598f122c92128906d8/FLAGdefbbf2e1 [2023-09-01 01:15:46,462 INFO L402 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d4fac4c38/aff29fe938b140598f122c92128906d8 [2023-09-01 01:15:46,465 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-09-01 01:15:46,466 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2023-09-01 01:15:46,467 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-09-01 01:15:46,467 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-09-01 01:15:46,470 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2023-09-01 01:15:46,470 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,471 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29fd7ef8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46, skipping insertion in model container [2023-09-01 01:15:46,472 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,477 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2023-09-01 01:15:46,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2023-09-01 01:15:46,628 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-exp2x9.wvr.c[2669,2682] [2023-09-01 01:15:46,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:15:46,640 INFO L203 MainTranslator]: Completed pre-run [2023-09-01 01:15:46,658 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-exp2x9.wvr.c[2669,2682] [2023-09-01 01:15:46,659 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-09-01 01:15:46,671 INFO L208 MainTranslator]: Completed translation [2023-09-01 01:15:46,672 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46 WrapperNode [2023-09-01 01:15:46,672 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-09-01 01:15:46,673 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-09-01 01:15:46,673 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-09-01 01:15:46,673 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2023-09-01 01:15:46,677 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,683 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,703 INFO L138 Inliner]: procedures = 20, calls = 32, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 96 [2023-09-01 01:15:46,704 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-09-01 01:15:46,704 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-09-01 01:15:46,704 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2023-09-01 01:15:46,705 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2023-09-01 01:15:46,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,722 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,722 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,728 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,739 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,740 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,744 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-09-01 01:15:46,744 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-09-01 01:15:46,745 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2023-09-01 01:15:46,745 INFO L275 PluginConnector]: RCFGBuilder initialized [2023-09-01 01:15:46,746 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (1/1) ... [2023-09-01 01:15:46,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-09-01 01:15:46,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:15:46,778 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-09-01 01:15:46,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-09-01 01:15:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-09-01 01:15:46,803 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-09-01 01:15:46,803 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-09-01 01:15:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-09-01 01:15:46,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-09-01 01:15:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-09-01 01:15:46,804 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-09-01 01:15:46,804 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-09-01 01:15:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-09-01 01:15:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-09-01 01:15:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-09-01 01:15:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-09-01 01:15:46,805 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-09-01 01:15:46,805 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-09-01 01:15:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-09-01 01:15:46,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-09-01 01:15:46,807 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-09-01 01:15:46,886 INFO L236 CfgBuilder]: Building ICFG [2023-09-01 01:15:46,888 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-09-01 01:15:47,359 INFO L277 CfgBuilder]: Performing block encoding [2023-09-01 01:15:47,370 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-09-01 01:15:47,371 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-09-01 01:15:47,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:15:47 BoogieIcfgContainer [2023-09-01 01:15:47,373 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-09-01 01:15:47,378 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-09-01 01:15:47,379 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2023-09-01 01:15:47,381 INFO L275 PluginConnector]: TraceAbstraction initialized [2023-09-01 01:15:47,381 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.09 01:15:46" (1/3) ... [2023-09-01 01:15:47,382 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:15:47, skipping insertion in model container [2023-09-01 01:15:47,382 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.09 01:15:46" (2/3) ... [2023-09-01 01:15:47,383 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6e0b071 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.09 01:15:47, skipping insertion in model container [2023-09-01 01:15:47,383 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.09 01:15:47" (3/3) ... [2023-09-01 01:15:47,384 INFO L112 eAbstractionObserver]: Analyzing ICFG bench-exp2x9.wvr.c [2023-09-01 01:15:47,398 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-09-01 01:15:47,399 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 18 error locations. [2023-09-01 01:15:47,399 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-09-01 01:15:47,508 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-09-01 01:15:47,551 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 170 places, 167 transitions, 366 flow [2023-09-01 01:15:47,646 INFO L130 PetriNetUnfolder]: 10/163 cut-off events. [2023-09-01 01:15:47,646 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:15:47,651 INFO L83 FinitePrefix]: Finished finitePrefix Result has 180 conditions, 163 events. 10/163 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 193 event pairs, 0 based on Foata normal form. 0/135 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-09-01 01:15:47,651 INFO L82 GeneralOperation]: Start removeDead. Operand has 170 places, 167 transitions, 366 flow [2023-09-01 01:15:47,656 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 162 places, 159 transitions, 342 flow [2023-09-01 01:15:47,660 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-09-01 01:15:47,670 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 159 transitions, 342 flow [2023-09-01 01:15:47,674 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 162 places, 159 transitions, 342 flow [2023-09-01 01:15:47,675 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 159 transitions, 342 flow [2023-09-01 01:15:47,715 INFO L130 PetriNetUnfolder]: 10/159 cut-off events. [2023-09-01 01:15:47,718 INFO L131 PetriNetUnfolder]: For 4/4 co-relation queries the response was YES. [2023-09-01 01:15:47,720 INFO L83 FinitePrefix]: Finished finitePrefix Result has 176 conditions, 159 events. 10/159 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 191 event pairs, 0 based on Foata normal form. 0/132 useless extension candidates. Maximal degree in co-relation 111. Up to 2 conditions per place. [2023-09-01 01:15:47,722 INFO L119 LiptonReduction]: Number of co-enabled transitions 4080 [2023-09-01 01:15:52,654 INFO L134 LiptonReduction]: Checked pairs total: 3972 [2023-09-01 01:15:52,655 INFO L136 LiptonReduction]: Total number of compositions: 158 [2023-09-01 01:15:52,667 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-09-01 01:15:52,672 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;@44217a5, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-09-01 01:15:52,673 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-09-01 01:15:52,674 INFO L130 PetriNetUnfolder]: 0/0 cut-off events. [2023-09-01 01:15:52,674 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:52,675 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:52,675 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-09-01 01:15:52,676 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:52,680 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:52,680 INFO L85 PathProgramCache]: Analyzing trace with hash 616, now seen corresponding path program 1 times [2023-09-01 01:15:52,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:52,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [771975914] [2023-09-01 01:15:52,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:52,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:52,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:52,762 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:52,762 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:52,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [771975914] [2023-09-01 01:15:52,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [771975914] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:52,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:52,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-09-01 01:15:52,765 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642605997] [2023-09-01 01:15:52,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:52,772 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-09-01 01:15:52,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:52,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-09-01 01:15:52,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-09-01 01:15:52,797 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 152 out of 325 [2023-09-01 01:15:52,799 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 108 flow. Second operand has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:52,799 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:52,799 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 152 of 325 [2023-09-01 01:15:52,800 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:52,956 INFO L130 PetriNetUnfolder]: 513/692 cut-off events. [2023-09-01 01:15:52,956 INFO L131 PetriNetUnfolder]: For 17/17 co-relation queries the response was YES. [2023-09-01 01:15:52,960 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1435 conditions, 692 events. 513/692 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1645 event pairs, 249 based on Foata normal form. 0/340 useless extension candidates. Maximal degree in co-relation 1020. Up to 693 conditions per place. [2023-09-01 01:15:52,966 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 39 selfloop transitions, 0 changer transitions 0/39 dead transitions. [2023-09-01 01:15:52,966 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 39 transitions, 180 flow [2023-09-01 01:15:52,968 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-09-01 01:15:52,970 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-09-01 01:15:52,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 346 transitions. [2023-09-01 01:15:52,980 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5323076923076923 [2023-09-01 01:15:52,981 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 346 transitions. [2023-09-01 01:15:52,981 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 346 transitions. [2023-09-01 01:15:52,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:52,985 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 346 transitions. [2023-09-01 01:15:52,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 173.0) internal successors, (346), 2 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:52,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:52,993 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 325.0) internal successors, (975), 3 states have internal predecessors, (975), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:52,994 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 108 flow. Second operand 2 states and 346 transitions. [2023-09-01 01:15:52,995 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 39 transitions, 180 flow [2023-09-01 01:15:52,998 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 39 transitions, 164 flow, removed 0 selfloop flow, removed 8 redundant places. [2023-09-01 01:15:53,000 INFO L231 Difference]: Finished difference. Result has 41 places, 39 transitions, 86 flow [2023-09-01 01:15:53,002 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=86, PETRI_PLACES=41, PETRI_TRANSITIONS=39} [2023-09-01 01:15:53,004 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:15:53,005 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 39 transitions, 86 flow [2023-09-01 01:15:53,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 152.5) internal successors, (305), 2 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,005 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:53,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:15:53,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-09-01 01:15:53,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:53,007 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:53,007 INFO L85 PathProgramCache]: Analyzing trace with hash 604619, now seen corresponding path program 1 times [2023-09-01 01:15:53,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:53,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [746189060] [2023-09-01 01:15:53,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:53,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:53,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:53,381 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:53,381 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:53,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [746189060] [2023-09-01 01:15:53,382 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [746189060] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:53,382 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:53,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:53,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337928754] [2023-09-01 01:15:53,382 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:53,383 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:53,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:53,384 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:53,384 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:53,443 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 325 [2023-09-01 01:15:53,443 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 39 transitions, 86 flow. Second operand has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,444 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:53,444 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 325 [2023-09-01 01:15:53,444 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:53,532 INFO L130 PetriNetUnfolder]: 487/656 cut-off events. [2023-09-01 01:15:53,533 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:53,533 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 1534 event pairs, 236 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 1327. Up to 656 conditions per place. [2023-09-01 01:15:53,536 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 36 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-09-01 01:15:53,536 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 156 flow [2023-09-01 01:15:53,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:53,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:53,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 462 transitions. [2023-09-01 01:15:53,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47384615384615386 [2023-09-01 01:15:53,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 462 transitions. [2023-09-01 01:15:53,540 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 462 transitions. [2023-09-01 01:15:53,540 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:53,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 462 transitions. [2023-09-01 01:15:53,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,544 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,545 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,545 INFO L175 Difference]: Start difference. First operand has 41 places, 39 transitions, 86 flow. Second operand 3 states and 462 transitions. [2023-09-01 01:15:53,545 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 156 flow [2023-09-01 01:15:53,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 37 transitions, 156 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:15:53,547 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 84 flow [2023-09-01 01:15:53,547 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=82, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-09-01 01:15:53,548 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -10 predicate places. [2023-09-01 01:15:53,548 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 84 flow [2023-09-01 01:15:53,548 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.0) internal successors, (426), 3 states have internal predecessors, (426), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:53,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-09-01 01:15:53,549 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-09-01 01:15:53,549 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:53,550 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 604621, now seen corresponding path program 1 times [2023-09-01 01:15:53,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:53,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1008325390] [2023-09-01 01:15:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:53,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:53,748 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:53,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:53,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1008325390] [2023-09-01 01:15:53,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1008325390] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:53,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:53,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:53,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1757815575] [2023-09-01 01:15:53,750 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:53,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:53,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:53,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:53,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:53,792 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 325 [2023-09-01 01:15:53,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:53,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 325 [2023-09-01 01:15:53,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:53,867 INFO L130 PetriNetUnfolder]: 461/620 cut-off events. [2023-09-01 01:15:53,868 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:53,869 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 1425 event pairs, 223 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 1256. Up to 620 conditions per place. [2023-09-01 01:15:53,871 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 34 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-09-01 01:15:53,872 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 35 transitions, 150 flow [2023-09-01 01:15:53,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:53,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:53,874 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 478 transitions. [2023-09-01 01:15:53,874 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49025641025641026 [2023-09-01 01:15:53,874 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 478 transitions. [2023-09-01 01:15:53,874 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 478 transitions. [2023-09-01 01:15:53,875 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:53,875 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 478 transitions. [2023-09-01 01:15:53,876 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 159.33333333333334) internal successors, (478), 3 states have internal predecessors, (478), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,878 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,879 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,879 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 84 flow. Second operand 3 states and 478 transitions. [2023-09-01 01:15:53,880 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 35 transitions, 150 flow [2023-09-01 01:15:53,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 35 transitions, 149 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:53,881 INFO L231 Difference]: Finished difference. Result has 40 places, 35 transitions, 81 flow [2023-09-01 01:15:53,881 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=79, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=81, PETRI_PLACES=40, PETRI_TRANSITIONS=35} [2023-09-01 01:15:53,882 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -11 predicate places. [2023-09-01 01:15:53,882 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 35 transitions, 81 flow [2023-09-01 01:15:53,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.0) internal successors, (444), 3 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:53,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:53,883 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:15:53,883 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-09-01 01:15:53,884 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:53,884 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:53,884 INFO L85 PathProgramCache]: Analyzing trace with hash 581053299, now seen corresponding path program 1 times [2023-09-01 01:15:53,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:53,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656858126] [2023-09-01 01:15:53,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:53,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:53,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:53,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:53,993 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:53,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656858126] [2023-09-01 01:15:53,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656858126] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:53,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:53,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:53,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826196634] [2023-09-01 01:15:53,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:53,994 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:53,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:53,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:53,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:54,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 325 [2023-09-01 01:15:54,035 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 35 transitions, 81 flow. Second operand has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,035 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:54,036 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 325 [2023-09-01 01:15:54,036 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:54,104 INFO L130 PetriNetUnfolder]: 445/596 cut-off events. [2023-09-01 01:15:54,104 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:54,105 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 1355 event pairs, 215 based on Foata normal form. 0/306 useless extension candidates. Maximal degree in co-relation 1209. Up to 596 conditions per place. [2023-09-01 01:15:54,108 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 32 selfloop transitions, 1 changer transitions 0/33 dead transitions. [2023-09-01 01:15:54,108 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 33 transitions, 143 flow [2023-09-01 01:15:54,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:54,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:54,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 476 transitions. [2023-09-01 01:15:54,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4882051282051282 [2023-09-01 01:15:54,110 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 476 transitions. [2023-09-01 01:15:54,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 476 transitions. [2023-09-01 01:15:54,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:54,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 476 transitions. [2023-09-01 01:15:54,112 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 158.66666666666666) internal successors, (476), 3 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,114 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,114 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,115 INFO L175 Difference]: Start difference. First operand has 40 places, 35 transitions, 81 flow. Second operand 3 states and 476 transitions. [2023-09-01 01:15:54,115 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 33 transitions, 143 flow [2023-09-01 01:15:54,115 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 33 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:54,116 INFO L231 Difference]: Finished difference. Result has 39 places, 33 transitions, 78 flow [2023-09-01 01:15:54,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=37, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=78, PETRI_PLACES=39, PETRI_TRANSITIONS=33} [2023-09-01 01:15:54,117 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -12 predicate places. [2023-09-01 01:15:54,117 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 33 transitions, 78 flow [2023-09-01 01:15:54,118 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 148.66666666666666) internal successors, (446), 3 states have internal predecessors, (446), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,118 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:54,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-09-01 01:15:54,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-09-01 01:15:54,118 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:54,119 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:54,119 INFO L85 PathProgramCache]: Analyzing trace with hash 581053297, now seen corresponding path program 1 times [2023-09-01 01:15:54,119 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:54,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1342259964] [2023-09-01 01:15:54,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:54,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:54,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:54,162 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:54,162 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:54,162 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1342259964] [2023-09-01 01:15:54,162 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1342259964] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:54,163 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:54,163 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:54,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923889886] [2023-09-01 01:15:54,163 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:54,164 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:54,164 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:54,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:54,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:54,215 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 325 [2023-09-01 01:15:54,216 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 33 transitions, 78 flow. Second operand has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,216 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:54,216 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 325 [2023-09-01 01:15:54,216 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:54,279 INFO L130 PetriNetUnfolder]: 429/572 cut-off events. [2023-09-01 01:15:54,280 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:54,280 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 1285 event pairs, 207 based on Foata normal form. 0/298 useless extension candidates. Maximal degree in co-relation 1162. Up to 572 conditions per place. [2023-09-01 01:15:54,283 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 30 selfloop transitions, 1 changer transitions 0/31 dead transitions. [2023-09-01 01:15:54,283 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 31 transitions, 136 flow [2023-09-01 01:15:54,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:54,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:54,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 456 transitions. [2023-09-01 01:15:54,285 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4676923076923077 [2023-09-01 01:15:54,285 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 456 transitions. [2023-09-01 01:15:54,285 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 456 transitions. [2023-09-01 01:15:54,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:54,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 456 transitions. [2023-09-01 01:15:54,287 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 152.0) internal successors, (456), 3 states have internal predecessors, (456), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,289 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,289 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,289 INFO L175 Difference]: Start difference. First operand has 39 places, 33 transitions, 78 flow. Second operand 3 states and 456 transitions. [2023-09-01 01:15:54,290 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 31 transitions, 136 flow [2023-09-01 01:15:54,290 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 31 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:54,291 INFO L231 Difference]: Finished difference. Result has 38 places, 31 transitions, 75 flow [2023-09-01 01:15:54,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=73, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=75, PETRI_PLACES=38, PETRI_TRANSITIONS=31} [2023-09-01 01:15:54,292 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:15:54,292 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 31 transitions, 75 flow [2023-09-01 01:15:54,292 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 142.66666666666666) internal successors, (428), 3 states have internal predecessors, (428), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:54,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:54,293 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-09-01 01:15:54,293 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:54,294 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:54,294 INFO L85 PathProgramCache]: Analyzing trace with hash 46484572, now seen corresponding path program 1 times [2023-09-01 01:15:54,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:54,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [537847192] [2023-09-01 01:15:54,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:54,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:54,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:54,332 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:54,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:54,332 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [537847192] [2023-09-01 01:15:54,333 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [537847192] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:54,333 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:54,333 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:54,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937604993] [2023-09-01 01:15:54,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:54,334 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:54,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:54,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:54,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:54,379 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 141 out of 325 [2023-09-01 01:15:54,380 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 31 transitions, 75 flow. Second operand has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,380 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:54,380 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 141 of 325 [2023-09-01 01:15:54,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:54,448 INFO L130 PetriNetUnfolder]: 403/536 cut-off events. [2023-09-01 01:15:54,448 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:54,449 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 1176 event pairs, 194 based on Foata normal form. 0/285 useless extension candidates. Maximal degree in co-relation 1091. Up to 536 conditions per place. [2023-09-01 01:15:54,451 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 28 selfloop transitions, 1 changer transitions 0/29 dead transitions. [2023-09-01 01:15:54,451 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 29 transitions, 129 flow [2023-09-01 01:15:54,451 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 454 transitions. [2023-09-01 01:15:54,453 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46564102564102566 [2023-09-01 01:15:54,453 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 454 transitions. [2023-09-01 01:15:54,453 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 454 transitions. [2023-09-01 01:15:54,453 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:54,453 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 454 transitions. [2023-09-01 01:15:54,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.33333333333334) internal successors, (454), 3 states have internal predecessors, (454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,457 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,457 INFO L175 Difference]: Start difference. First operand has 38 places, 31 transitions, 75 flow. Second operand 3 states and 454 transitions. [2023-09-01 01:15:54,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 29 transitions, 129 flow [2023-09-01 01:15:54,458 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 29 transitions, 128 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:54,459 INFO L231 Difference]: Finished difference. Result has 37 places, 29 transitions, 72 flow [2023-09-01 01:15:54,459 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=72, PETRI_PLACES=37, PETRI_TRANSITIONS=29} [2023-09-01 01:15:54,459 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -14 predicate places. [2023-09-01 01:15:54,460 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 29 transitions, 72 flow [2023-09-01 01:15:54,460 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 143.33333333333334) internal successors, (430), 3 states have internal predecessors, (430), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,460 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:54,460 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:54,461 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-09-01 01:15:54,461 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:54,461 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:54,461 INFO L85 PathProgramCache]: Analyzing trace with hash 46484571, now seen corresponding path program 1 times [2023-09-01 01:15:54,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:54,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852375819] [2023-09-01 01:15:54,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:54,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:54,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:54,514 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:54,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:54,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852375819] [2023-09-01 01:15:54,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [852375819] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:54,515 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:54,515 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:54,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33342593] [2023-09-01 01:15:54,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:54,516 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:54,516 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:54,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:54,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:54,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 147 out of 325 [2023-09-01 01:15:54,556 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 29 transitions, 72 flow. Second operand has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,556 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:54,556 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 147 of 325 [2023-09-01 01:15:54,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:54,615 INFO L130 PetriNetUnfolder]: 377/500 cut-off events. [2023-09-01 01:15:54,616 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:54,617 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 1074 event pairs, 181 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 1020. Up to 500 conditions per place. [2023-09-01 01:15:54,619 INFO L137 encePairwiseOnDemand]: 322/325 looper letters, 26 selfloop transitions, 1 changer transitions 0/27 dead transitions. [2023-09-01 01:15:54,619 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 27 transitions, 122 flow [2023-09-01 01:15:54,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:54,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:54,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 470 transitions. [2023-09-01 01:15:54,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48205128205128206 [2023-09-01 01:15:54,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 470 transitions. [2023-09-01 01:15:54,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 470 transitions. [2023-09-01 01:15:54,621 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:54,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 470 transitions. [2023-09-01 01:15:54,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 156.66666666666666) internal successors, (470), 3 states have internal predecessors, (470), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,625 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,625 INFO L175 Difference]: Start difference. First operand has 37 places, 29 transitions, 72 flow. Second operand 3 states and 470 transitions. [2023-09-01 01:15:54,626 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 27 transitions, 122 flow [2023-09-01 01:15:54,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 27 transitions, 121 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:54,628 INFO L231 Difference]: Finished difference. Result has 36 places, 27 transitions, 69 flow [2023-09-01 01:15:54,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=67, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=27, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=69, PETRI_PLACES=36, PETRI_TRANSITIONS=27} [2023-09-01 01:15:54,629 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:15:54,629 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 27 transitions, 69 flow [2023-09-01 01:15:54,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 149.33333333333334) internal successors, (448), 3 states have internal predecessors, (448), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:54,629 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:54,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-09-01 01:15:54,630 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-09-01 01:15:54,630 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:54,630 INFO L85 PathProgramCache]: Analyzing trace with hash 1722015191, now seen corresponding path program 1 times [2023-09-01 01:15:54,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:54,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1889566440] [2023-09-01 01:15:54,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:54,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:54,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:54,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:54,665 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:54,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1889566440] [2023-09-01 01:15:54,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1889566440] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:54,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:54,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:54,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220310876] [2023-09-01 01:15:54,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:54,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:54,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:54,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:54,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:54,721 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 142 out of 325 [2023-09-01 01:15:54,722 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 27 transitions, 69 flow. Second operand has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,722 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:54,722 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 142 of 325 [2023-09-01 01:15:54,722 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:54,780 INFO L130 PetriNetUnfolder]: 313/420 cut-off events. [2023-09-01 01:15:54,781 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:54,781 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-09-01 01:15:54,783 INFO L137 encePairwiseOnDemand]: 323/325 looper letters, 25 selfloop transitions, 1 changer transitions 0/26 dead transitions. [2023-09-01 01:15:54,783 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 26 transitions, 119 flow [2023-09-01 01:15:54,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:54,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:54,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 453 transitions. [2023-09-01 01:15:54,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4646153846153846 [2023-09-01 01:15:54,786 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 453 transitions. [2023-09-01 01:15:54,786 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 453 transitions. [2023-09-01 01:15:54,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:54,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 453 transitions. [2023-09-01 01:15:54,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.0) internal successors, (453), 3 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,790 INFO L175 Difference]: Start difference. First operand has 36 places, 27 transitions, 69 flow. Second operand 3 states and 453 transitions. [2023-09-01 01:15:54,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 26 transitions, 119 flow [2023-09-01 01:15:54,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 26 transitions, 118 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:54,792 INFO L231 Difference]: Finished difference. Result has 36 places, 26 transitions, 68 flow [2023-09-01 01:15:54,792 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=68, PETRI_PLACES=36, PETRI_TRANSITIONS=26} [2023-09-01 01:15:54,795 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:15:54,795 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 26 transitions, 68 flow [2023-09-01 01:15:54,796 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 145.0) internal successors, (435), 3 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:54,796 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:54,796 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:54,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-09-01 01:15:54,796 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-09-01 01:15:54,800 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:54,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1722015190, now seen corresponding path program 1 times [2023-09-01 01:15:54,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:54,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1893922399] [2023-09-01 01:15:54,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:54,801 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:54,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:54,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:54,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1893922399] [2023-09-01 01:15:54,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1893922399] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:54,953 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:54,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-09-01 01:15:54,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1253964836] [2023-09-01 01:15:54,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:54,956 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:15:54,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:54,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:15:54,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:15:55,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 129 out of 325 [2023-09-01 01:15:55,076 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 26 transitions, 68 flow. Second operand has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,076 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:55,076 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 129 of 325 [2023-09-01 01:15:55,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:55,139 INFO L130 PetriNetUnfolder]: 249/340 cut-off events. [2023-09-01 01:15:55,140 INFO L131 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2023-09-01 01:15:55,140 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 641 event pairs, 117 based on Foata normal form. 0/208 useless extension candidates. Maximal degree in co-relation 702. Up to 340 conditions per place. [2023-09-01 01:15:55,141 INFO L137 encePairwiseOnDemand]: 323/325 looper letters, 24 selfloop transitions, 1 changer transitions 0/25 dead transitions. [2023-09-01 01:15:55,142 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 37 places, 25 transitions, 116 flow [2023-09-01 01:15:55,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:55,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:55,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 413 transitions. [2023-09-01 01:15:55,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4235897435897436 [2023-09-01 01:15:55,144 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 413 transitions. [2023-09-01 01:15:55,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 413 transitions. [2023-09-01 01:15:55,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:55,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 413 transitions. [2023-09-01 01:15:55,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 137.66666666666666) internal successors, (413), 3 states have internal predecessors, (413), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,147 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,147 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,147 INFO L175 Difference]: Start difference. First operand has 36 places, 26 transitions, 68 flow. Second operand 3 states and 413 transitions. [2023-09-01 01:15:55,147 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 37 places, 25 transitions, 116 flow [2023-09-01 01:15:55,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 25 transitions, 115 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:55,149 INFO L231 Difference]: Finished difference. Result has 36 places, 25 transitions, 67 flow [2023-09-01 01:15:55,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=65, PETRI_DIFFERENCE_MINUEND_PLACES=34, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=67, PETRI_PLACES=36, PETRI_TRANSITIONS=25} [2023-09-01 01:15:55,149 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -15 predicate places. [2023-09-01 01:15:55,150 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 25 transitions, 67 flow [2023-09-01 01:15:55,150 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 130.5) internal successors, (783), 6 states have internal predecessors, (783), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,150 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:55,150 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:55,150 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-09-01 01:15:55,151 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:55,151 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:55,151 INFO L85 PathProgramCache]: Analyzing trace with hash 338698627, now seen corresponding path program 1 times [2023-09-01 01:15:55,151 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:55,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2107325223] [2023-09-01 01:15:55,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:55,152 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:55,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:55,355 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:55,356 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:55,356 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2107325223] [2023-09-01 01:15:55,356 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2107325223] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:55,356 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:55,356 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-09-01 01:15:55,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749287887] [2023-09-01 01:15:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:55,357 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-09-01 01:15:55,357 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:55,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-09-01 01:15:55,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-09-01 01:15:55,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 325 [2023-09-01 01:15:55,461 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 25 transitions, 67 flow. Second operand has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,461 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:55,461 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 325 [2023-09-01 01:15:55,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:55,556 INFO L130 PetriNetUnfolder]: 497/677 cut-off events. [2023-09-01 01:15:55,556 INFO L131 PetriNetUnfolder]: For 14/14 co-relation queries the response was YES. [2023-09-01 01:15:55,558 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 1780 event pairs, 117 based on Foata normal form. 1/414 useless extension candidates. Maximal degree in co-relation 1391. Up to 471 conditions per place. [2023-09-01 01:15:55,560 INFO L137 encePairwiseOnDemand]: 319/325 looper letters, 41 selfloop transitions, 5 changer transitions 1/47 dead transitions. [2023-09-01 01:15:55,560 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 38 places, 47 transitions, 212 flow [2023-09-01 01:15:55,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-09-01 01:15:55,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-09-01 01:15:55,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 396 transitions. [2023-09-01 01:15:55,562 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40615384615384614 [2023-09-01 01:15:55,562 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 396 transitions. [2023-09-01 01:15:55,562 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 396 transitions. [2023-09-01 01:15:55,563 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:55,563 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 396 transitions. [2023-09-01 01:15:55,564 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 132.0) internal successors, (396), 3 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,565 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,566 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 325.0) internal successors, (1300), 4 states have internal predecessors, (1300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,566 INFO L175 Difference]: Start difference. First operand has 36 places, 25 transitions, 67 flow. Second operand 3 states and 396 transitions. [2023-09-01 01:15:55,566 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 38 places, 47 transitions, 212 flow [2023-09-01 01:15:55,567 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 37 places, 47 transitions, 211 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:55,567 INFO L231 Difference]: Finished difference. Result has 38 places, 29 transitions, 99 flow [2023-09-01 01:15:55,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=66, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=25, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=20, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=99, PETRI_PLACES=38, PETRI_TRANSITIONS=29} [2023-09-01 01:15:55,568 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -13 predicate places. [2023-09-01 01:15:55,568 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 29 transitions, 99 flow [2023-09-01 01:15:55,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 123.0) internal successors, (369), 3 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,569 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:55,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:55,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-09-01 01:15:55,569 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:55,570 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:55,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1857867788, now seen corresponding path program 1 times [2023-09-01 01:15:55,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:55,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977971903] [2023-09-01 01:15:55,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:55,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:55,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:55,760 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:55,761 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:55,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977971903] [2023-09-01 01:15:55,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977971903] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:55,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:55,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:15:55,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [689807805] [2023-09-01 01:15:55,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:55,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:15:55,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:55,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:15:55,763 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:15:55,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 325 [2023-09-01 01:15:55,821 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 29 transitions, 99 flow. Second operand has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:55,821 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:55,821 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 325 [2023-09-01 01:15:55,821 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:55,988 INFO L130 PetriNetUnfolder]: 693/951 cut-off events. [2023-09-01 01:15:55,989 INFO L131 PetriNetUnfolder]: For 343/343 co-relation queries the response was YES. [2023-09-01 01:15:55,990 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2425 conditions, 951 events. 693/951 cut-off events. For 343/343 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2820 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-09-01 01:15:55,995 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 68 selfloop transitions, 10 changer transitions 0/78 dead transitions. [2023-09-01 01:15:55,995 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 78 transitions, 395 flow [2023-09-01 01:15:55,995 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:15:55,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:15:55,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 712 transitions. [2023-09-01 01:15:55,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43815384615384617 [2023-09-01 01:15:55,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 712 transitions. [2023-09-01 01:15:55,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 712 transitions. [2023-09-01 01:15:55,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:55,998 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 712 transitions. [2023-09-01 01:15:56,000 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.4) internal successors, (712), 5 states have internal predecessors, (712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:56,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:56,003 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:56,003 INFO L175 Difference]: Start difference. First operand has 38 places, 29 transitions, 99 flow. Second operand 5 states and 712 transitions. [2023-09-01 01:15:56,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 78 transitions, 395 flow [2023-09-01 01:15:56,004 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 78 transitions, 387 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:56,005 INFO L231 Difference]: Finished difference. Result has 43 places, 36 transitions, 159 flow [2023-09-01 01:15:56,006 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, 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-09-01 01:15:56,006 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, -8 predicate places. [2023-09-01 01:15:56,006 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 36 transitions, 159 flow [2023-09-01 01:15:56,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 133.5) internal successors, (534), 4 states have internal predecessors, (534), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:56,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:56,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:56,007 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-09-01 01:15:56,007 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:56,008 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:56,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1983965395, now seen corresponding path program 1 times [2023-09-01 01:15:56,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:56,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1782016196] [2023-09-01 01:15:56,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:56,009 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:56,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:56,166 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:56,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1782016196] [2023-09-01 01:15:56,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1782016196] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:15:56,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1273683689] [2023-09-01 01:15:56,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:15:56,168 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:15:56,171 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:15:56,192 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-09-01 01:15:56,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:56,276 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:15:56,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:15:56,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:56,635 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:15:56,704 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:56,704 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1273683689] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:15:56,704 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:15:56,704 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2023-09-01 01:15:56,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [599897153] [2023-09-01 01:15:56,705 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:15:56,705 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-09-01 01:15:56,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:56,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-09-01 01:15:56,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-09-01 01:15:56,933 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 325 [2023-09-01 01:15:56,934 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 36 transitions, 159 flow. Second operand has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:56,934 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:56,934 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 325 [2023-09-01 01:15:56,934 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:57,352 INFO L130 PetriNetUnfolder]: 1309/1809 cut-off events. [2023-09-01 01:15:57,352 INFO L131 PetriNetUnfolder]: For 1750/1750 co-relation queries the response was YES. [2023-09-01 01:15:57,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5617 conditions, 1809 events. 1309/1809 cut-off events. For 1750/1750 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6452 event pairs, 179 based on Foata normal form. 68/1877 useless extension candidates. Maximal degree in co-relation 5610. Up to 757 conditions per place. [2023-09-01 01:15:57,365 INFO L137 encePairwiseOnDemand]: 318/325 looper letters, 105 selfloop transitions, 11 changer transitions 3/119 dead transitions. [2023-09-01 01:15:57,365 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 119 transitions, 708 flow [2023-09-01 01:15:57,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-09-01 01:15:57,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-09-01 01:15:57,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 760 transitions. [2023-09-01 01:15:57,368 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38974358974358975 [2023-09-01 01:15:57,368 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 760 transitions. [2023-09-01 01:15:57,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 760 transitions. [2023-09-01 01:15:57,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:57,369 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 760 transitions. [2023-09-01 01:15:57,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 126.66666666666667) internal successors, (760), 6 states have internal predecessors, (760), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:57,373 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:57,374 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 325.0) internal successors, (2275), 7 states have internal predecessors, (2275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:57,374 INFO L175 Difference]: Start difference. First operand has 43 places, 36 transitions, 159 flow. Second operand 6 states and 760 transitions. [2023-09-01 01:15:57,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 119 transitions, 708 flow [2023-09-01 01:15:57,378 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 119 transitions, 708 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-09-01 01:15:57,380 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 220 flow [2023-09-01 01:15:57,380 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=220, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-09-01 01:15:57,381 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 0 predicate places. [2023-09-01 01:15:57,381 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 220 flow [2023-09-01 01:15:57,382 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 114.71428571428571) internal successors, (803), 7 states have internal predecessors, (803), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:57,382 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:57,382 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:57,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-09-01 01:15:57,588 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-09-01 01:15:57,588 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:57,588 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:57,589 INFO L85 PathProgramCache]: Analyzing trace with hash 922617435, now seen corresponding path program 1 times [2023-09-01 01:15:57,589 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:57,589 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2050536875] [2023-09-01 01:15:57,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:57,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:57,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:57,779 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:57,780 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:57,780 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2050536875] [2023-09-01 01:15:57,780 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2050536875] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:57,780 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:57,780 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:15:57,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474358921] [2023-09-01 01:15:57,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:57,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:15:57,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:57,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:15:57,782 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:15:57,893 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 325 [2023-09-01 01:15:57,894 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 220 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:57,894 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:57,894 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 325 [2023-09-01 01:15:57,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:58,130 INFO L130 PetriNetUnfolder]: 1187/1637 cut-off events. [2023-09-01 01:15:58,130 INFO L131 PetriNetUnfolder]: For 3146/3146 co-relation queries the response was YES. [2023-09-01 01:15:58,133 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6025 conditions, 1637 events. 1187/1637 cut-off events. For 3146/3146 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 5711 event pairs, 177 based on Foata normal form. 36/1673 useless extension candidates. Maximal degree in co-relation 6014. Up to 1431 conditions per place. [2023-09-01 01:15:58,141 INFO L137 encePairwiseOnDemand]: 318/325 looper letters, 60 selfloop transitions, 11 changer transitions 6/77 dead transitions. [2023-09-01 01:15:58,141 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 77 transitions, 516 flow [2023-09-01 01:15:58,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:15:58,142 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:15:58,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 502 transitions. [2023-09-01 01:15:58,144 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3861538461538462 [2023-09-01 01:15:58,144 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 502 transitions. [2023-09-01 01:15:58,144 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 502 transitions. [2023-09-01 01:15:58,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:58,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 502 transitions. [2023-09-01 01:15:58,146 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.5) internal successors, (502), 4 states have internal predecessors, (502), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:58,148 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:58,148 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:58,148 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 220 flow. Second operand 4 states and 502 transitions. [2023-09-01 01:15:58,148 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 77 transitions, 516 flow [2023-09-01 01:15:58,156 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 77 transitions, 507 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:58,159 INFO L231 Difference]: Finished difference. Result has 54 places, 46 transitions, 285 flow [2023-09-01 01:15:58,160 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, 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=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=285, PETRI_PLACES=54, PETRI_TRANSITIONS=46} [2023-09-01 01:15:58,161 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 3 predicate places. [2023-09-01 01:15:58,161 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 46 transitions, 285 flow [2023-09-01 01:15:58,161 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:58,161 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:58,161 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:58,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-09-01 01:15:58,162 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:58,162 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:58,162 INFO L85 PathProgramCache]: Analyzing trace with hash -1961194123, now seen corresponding path program 1 times [2023-09-01 01:15:58,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:58,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [666149758] [2023-09-01 01:15:58,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:58,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:58,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:58,334 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:58,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [666149758] [2023-09-01 01:15:58,334 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [666149758] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:15:58,334 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356035949] [2023-09-01 01:15:58,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:58,335 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:15:58,335 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:15:58,337 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:15:58,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-09-01 01:15:58,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:58,440 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:15:58,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:15:58,593 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:58,593 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:15:58,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:58,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356035949] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:15:58,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:15:58,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:15:58,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045534000] [2023-09-01 01:15:58,673 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:15:58,673 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:15:58,674 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:58,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:15:58,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:15:58,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 325 [2023-09-01 01:15:58,775 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 46 transitions, 285 flow. Second operand has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:58,775 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:58,775 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 325 [2023-09-01 01:15:58,775 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:59,095 INFO L130 PetriNetUnfolder]: 1613/2249 cut-off events. [2023-09-01 01:15:59,095 INFO L131 PetriNetUnfolder]: For 4966/4966 co-relation queries the response was YES. [2023-09-01 01:15:59,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8794 conditions, 2249 events. 1613/2249 cut-off events. For 4966/4966 co-relation queries the response was YES. Maximal size of possible extension queue 98. Compared 8365 event pairs, 351 based on Foata normal form. 90/2339 useless extension candidates. Maximal degree in co-relation 8781. Up to 936 conditions per place. [2023-09-01 01:15:59,111 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 90 selfloop transitions, 13 changer transitions 0/103 dead transitions. [2023-09-01 01:15:59,112 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 103 transitions, 761 flow [2023-09-01 01:15:59,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:15:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:15:59,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 714 transitions. [2023-09-01 01:15:59,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4393846153846154 [2023-09-01 01:15:59,114 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 714 transitions. [2023-09-01 01:15:59,114 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 714 transitions. [2023-09-01 01:15:59,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:59,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 714 transitions. [2023-09-01 01:15:59,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 142.8) internal successors, (714), 5 states have internal predecessors, (714), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,119 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,119 INFO L175 Difference]: Start difference. First operand has 54 places, 46 transitions, 285 flow. Second operand 5 states and 714 transitions. [2023-09-01 01:15:59,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 103 transitions, 761 flow [2023-09-01 01:15:59,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 103 transitions, 737 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-09-01 01:15:59,127 INFO L231 Difference]: Finished difference. Result has 58 places, 49 transitions, 325 flow [2023-09-01 01:15:59,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=325, PETRI_PLACES=58, PETRI_TRANSITIONS=49} [2023-09-01 01:15:59,128 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 7 predicate places. [2023-09-01 01:15:59,128 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 49 transitions, 325 flow [2023-09-01 01:15:59,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 134.66666666666666) internal successors, (808), 6 states have internal predecessors, (808), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,129 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:59,129 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:59,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-09-01 01:15:59,339 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-09-01 01:15:59,340 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:59,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:59,341 INFO L85 PathProgramCache]: Analyzing trace with hash -589359287, now seen corresponding path program 2 times [2023-09-01 01:15:59,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:59,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435604724] [2023-09-01 01:15:59,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:59,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:15:59,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:15:59,503 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:15:59,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:15:59,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435604724] [2023-09-01 01:15:59,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435604724] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:15:59,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:15:59,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:15:59,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191506079] [2023-09-01 01:15:59,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:15:59,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:15:59,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:15:59,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:15:59,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:15:59,655 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 110 out of 325 [2023-09-01 01:15:59,656 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 49 transitions, 325 flow. Second operand has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,656 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:15:59,656 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 110 of 325 [2023-09-01 01:15:59,656 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:15:59,941 INFO L130 PetriNetUnfolder]: 1519/2103 cut-off events. [2023-09-01 01:15:59,941 INFO L131 PetriNetUnfolder]: For 5939/5939 co-relation queries the response was YES. [2023-09-01 01:15:59,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8952 conditions, 2103 events. 1519/2103 cut-off events. For 5939/5939 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 7657 event pairs, 313 based on Foata normal form. 14/2103 useless extension candidates. Maximal degree in co-relation 8937. Up to 1897 conditions per place. [2023-09-01 01:15:59,958 INFO L137 encePairwiseOnDemand]: 318/325 looper letters, 58 selfloop transitions, 11 changer transitions 11/80 dead transitions. [2023-09-01 01:15:59,958 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 80 transitions, 585 flow [2023-09-01 01:15:59,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:15:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:15:59,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 501 transitions. [2023-09-01 01:15:59,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3853846153846154 [2023-09-01 01:15:59,961 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 501 transitions. [2023-09-01 01:15:59,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 501 transitions. [2023-09-01 01:15:59,961 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:15:59,961 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 501 transitions. [2023-09-01 01:15:59,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 125.25) internal successors, (501), 4 states have internal predecessors, (501), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,964 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,965 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,965 INFO L175 Difference]: Start difference. First operand has 58 places, 49 transitions, 325 flow. Second operand 4 states and 501 transitions. [2023-09-01 01:15:59,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 80 transitions, 585 flow [2023-09-01 01:15:59,986 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 573 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-09-01 01:15:59,988 INFO L231 Difference]: Finished difference. Result has 61 places, 51 transitions, 348 flow [2023-09-01 01:15:59,988 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=288, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=348, PETRI_PLACES=61, PETRI_TRANSITIONS=51} [2023-09-01 01:15:59,988 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 10 predicate places. [2023-09-01 01:15:59,988 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 51 transitions, 348 flow [2023-09-01 01:15:59,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 115.5) internal successors, (462), 4 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:15:59,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:15:59,989 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:15:59,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-09-01 01:15:59,989 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:15:59,990 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:15:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash -536498310, now seen corresponding path program 2 times [2023-09-01 01:15:59,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:15:59,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29716443] [2023-09-01 01:15:59,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:15:59,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:16:00,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:16:00,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:00,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:16:00,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29716443] [2023-09-01 01:16:00,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29716443] provided 1 perfect and 0 imperfect interpolant sequences [2023-09-01 01:16:00,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-09-01 01:16:00,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-09-01 01:16:00,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514930510] [2023-09-01 01:16:00,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-09-01 01:16:00,138 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-09-01 01:16:00,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:16:00,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-09-01 01:16:00,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-09-01 01:16:00,275 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 111 out of 325 [2023-09-01 01:16:00,275 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 51 transitions, 348 flow. Second operand has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:00,275 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:16:00,275 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 111 of 325 [2023-09-01 01:16:00,275 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:16:00,563 INFO L130 PetriNetUnfolder]: 1771/2439 cut-off events. [2023-09-01 01:16:00,564 INFO L131 PetriNetUnfolder]: For 6747/6747 co-relation queries the response was YES. [2023-09-01 01:16:00,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10588 conditions, 2439 events. 1771/2439 cut-off events. For 6747/6747 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 8934 event pairs, 425 based on Foata normal form. 84/2523 useless extension candidates. Maximal degree in co-relation 10571. Up to 1967 conditions per place. [2023-09-01 01:16:00,614 INFO L137 encePairwiseOnDemand]: 319/325 looper letters, 73 selfloop transitions, 10 changer transitions 3/86 dead transitions. [2023-09-01 01:16:00,615 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 86 transitions, 678 flow [2023-09-01 01:16:00,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-09-01 01:16:00,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-09-01 01:16:00,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 504 transitions. [2023-09-01 01:16:00,617 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38769230769230767 [2023-09-01 01:16:00,617 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 504 transitions. [2023-09-01 01:16:00,618 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 504 transitions. [2023-09-01 01:16:00,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:16:00,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 504 transitions. [2023-09-01 01:16:00,619 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:00,621 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:00,621 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 325.0) internal successors, (1625), 5 states have internal predecessors, (1625), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:00,622 INFO L175 Difference]: Start difference. First operand has 61 places, 51 transitions, 348 flow. Second operand 4 states and 504 transitions. [2023-09-01 01:16:00,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 86 transitions, 678 flow [2023-09-01 01:16:00,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 86 transitions, 669 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-09-01 01:16:00,645 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 374 flow [2023-09-01 01:16:00,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=339, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=374, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-09-01 01:16:00,645 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 13 predicate places. [2023-09-01 01:16:00,646 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 374 flow [2023-09-01 01:16:00,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 116.5) internal successors, (466), 4 states have internal predecessors, (466), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:00,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:16:00,646 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:16:00,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-09-01 01:16:00,647 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:16:00,647 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:16:00,647 INFO L85 PathProgramCache]: Analyzing trace with hash -1854870497, now seen corresponding path program 2 times [2023-09-01 01:16:00,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:16:00,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2035419159] [2023-09-01 01:16:00,647 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:16:00,648 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:16:00,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:16:00,755 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:00,756 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:16:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2035419159] [2023-09-01 01:16:00,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2035419159] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:16:00,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [817327577] [2023-09-01 01:16:00,756 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-09-01 01:16:00,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:16:00,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:16:00,761 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:16:00,772 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-09-01 01:16:00,877 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-09-01 01:16:00,877 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-09-01 01:16:00,879 INFO L263 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 7 conjunts are in the unsatisfiable core [2023-09-01 01:16:00,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:16:00,962 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:00,962 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:16:01,008 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:01,008 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [817327577] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:16:01,008 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:16:01,008 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2023-09-01 01:16:01,009 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2056046852] [2023-09-01 01:16:01,009 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:16:01,009 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-09-01 01:16:01,010 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:16:01,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-09-01 01:16:01,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-09-01 01:16:01,077 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 128 out of 325 [2023-09-01 01:16:01,078 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 374 flow. Second operand has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:01,078 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:16:01,078 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 128 of 325 [2023-09-01 01:16:01,078 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:16:01,521 INFO L130 PetriNetUnfolder]: 2241/3081 cut-off events. [2023-09-01 01:16:01,522 INFO L131 PetriNetUnfolder]: For 11106/11106 co-relation queries the response was YES. [2023-09-01 01:16:01,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13927 conditions, 3081 events. 2241/3081 cut-off events. For 11106/11106 co-relation queries the response was YES. Maximal size of possible extension queue 128. Compared 11914 event pairs, 535 based on Foata normal form. 76/3157 useless extension candidates. Maximal degree in co-relation 13909. Up to 1757 conditions per place. [2023-09-01 01:16:01,549 INFO L137 encePairwiseOnDemand]: 320/325 looper letters, 120 selfloop transitions, 10 changer transitions 0/130 dead transitions. [2023-09-01 01:16:01,549 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 130 transitions, 1079 flow [2023-09-01 01:16:01,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-09-01 01:16:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-09-01 01:16:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 722 transitions. [2023-09-01 01:16:01,552 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4443076923076923 [2023-09-01 01:16:01,552 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 722 transitions. [2023-09-01 01:16:01,552 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 722 transitions. [2023-09-01 01:16:01,552 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:16:01,552 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 722 transitions. [2023-09-01 01:16:01,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 144.4) internal successors, (722), 5 states have internal predecessors, (722), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:01,556 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:01,556 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 325.0) internal successors, (1950), 6 states have internal predecessors, (1950), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:01,556 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 374 flow. Second operand 5 states and 722 transitions. [2023-09-01 01:16:01,557 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 130 transitions, 1079 flow [2023-09-01 01:16:01,577 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 130 transitions, 1051 flow, removed 4 selfloop flow, removed 2 redundant places. [2023-09-01 01:16:01,579 INFO L231 Difference]: Finished difference. Result has 68 places, 55 transitions, 410 flow [2023-09-01 01:16:01,579 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=355, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=410, PETRI_PLACES=68, PETRI_TRANSITIONS=55} [2023-09-01 01:16:01,579 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 17 predicate places. [2023-09-01 01:16:01,580 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 55 transitions, 410 flow [2023-09-01 01:16:01,580 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 133.66666666666666) internal successors, (802), 6 states have internal predecessors, (802), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:16:01,580 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:16:01,580 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:16:01,588 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-09-01 01:16:01,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:16:01,786 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:16:01,787 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:16:01,787 INFO L85 PathProgramCache]: Analyzing trace with hash 1253372309, now seen corresponding path program 1 times [2023-09-01 01:16:01,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:16:01,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661958086] [2023-09-01 01:16:01,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:16:01,787 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:16:01,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:16:02,329 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:16:02,329 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:16:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661958086] [2023-09-01 01:16:02,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661958086] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:16:02,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118164205] [2023-09-01 01:16:02,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:16:02,329 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:16:02,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:16:02,331 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:16:02,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-09-01 01:17:00,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:17:00,936 INFO L263 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 17 conjunts are in the unsatisfiable core [2023-09-01 01:17:00,938 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2023-09-01 01:18:06,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:18:06,455 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2023-09-01 01:18:16,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:18:16,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118164205] provided 0 perfect and 2 imperfect interpolant sequences [2023-09-01 01:18:16,866 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-09-01 01:18:16,866 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 14 [2023-09-01 01:18:16,866 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1958947694] [2023-09-01 01:18:16,866 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-09-01 01:18:16,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-09-01 01:18:16,867 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-09-01 01:18:16,867 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-09-01 01:18:16,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=61, Invalid=168, Unknown=11, NotChecked=0, Total=240 [2023-09-01 01:18:18,907 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:20,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:23,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:25,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-09-01 01:18:27,865 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:29,902 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:31,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:31,971 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 104 out of 325 [2023-09-01 01:18:31,972 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 55 transitions, 410 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-09-01 01:18:31,972 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-09-01 01:18:31,972 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 104 of 325 [2023-09-01 01:18:31,972 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-09-01 01:18:34,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:36,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:38,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:40,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:42,800 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:18:44,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-09-01 01:19:01,761 WARN L222 SmtUtils]: Spent 8.52s on a formula simplification. DAG size of input: 53 DAG size of output: 51 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:19:03,784 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:05,807 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:08,027 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:10,069 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:12,079 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:13,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:35,151 WARN L222 SmtUtils]: Spent 17.25s on a formula simplification. DAG size of input: 72 DAG size of output: 22 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:19:37,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:39,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:40,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.55s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:43,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:45,507 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:48,128 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:56,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-09-01 01:19:58,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:19:59,680 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:01,687 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:03,123 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:05,132 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:12,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:14,233 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:16,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:18,351 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:20,367 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:22,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:28,448 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:30,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:32,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:34,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:36,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:39,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:41,030 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:20:43,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:39,346 WARN L222 SmtUtils]: Spent 47.87s on a formula simplification. DAG size of input: 55 DAG size of output: 50 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:21:41,435 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:43,459 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:45,553 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:47,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.68s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:49,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:51,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-09-01 01:21:53,279 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:55,372 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:21:58,407 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:04,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-09-01 01:22:06,595 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:16,328 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:18,332 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:20,336 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:22,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:24,509 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:26,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:22:28,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:09,831 WARN L222 SmtUtils]: Spent 38.70s on a formula simplification. DAG size of input: 70 DAG size of output: 52 (called from [L 376] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-09-01 01:23:12,464 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:14,493 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:16,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:18,511 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:22,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:25,157 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:27,176 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:29,181 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:31,189 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:33,315 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:35,661 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:38,683 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:40,971 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:43,853 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:45,921 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:48,646 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:50,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:53,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:23:55,304 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:06,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:08,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-09-01 01:24:11,127 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:13,130 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:15,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:17,932 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:19,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:22,043 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:24,049 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:26,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:28,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:30,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:32,547 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:34,597 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:36,870 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:38,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:40,089 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:42,703 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:44,709 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:46,717 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:48,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-09-01 01:24:50,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:52,734 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:55,206 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:57,337 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:24:59,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:01,481 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:04,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:06,243 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.21s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:08,248 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:10,878 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:12,884 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:14,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:16,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:18,954 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:21,052 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:22,692 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:24,787 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:28,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:32,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:34,348 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:36,356 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:38,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:41,273 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:43,283 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:45,442 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:47,472 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:49,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:53,729 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:55,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:57,747 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:25:59,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:01,768 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:03,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:06,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:08,317 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:10,322 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:12,366 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:14,682 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:16,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:18,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:20,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:22,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:25,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:27,877 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:29,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:31,904 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:34,589 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:36,598 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:38,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:41,341 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:44,244 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:47,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:49,997 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:53,967 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:57,771 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:26:59,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:02,510 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:03,537 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:06,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-09-01 01:27:08,541 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:10,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=false, quantifiers [] [2023-09-01 01:27:10,796 INFO L130 PetriNetUnfolder]: 4827/6710 cut-off events. [2023-09-01 01:27:10,796 INFO L131 PetriNetUnfolder]: For 24137/24137 co-relation queries the response was YES. [2023-09-01 01:27:10,820 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30992 conditions, 6710 events. 4827/6710 cut-off events. For 24137/24137 co-relation queries the response was YES. Maximal size of possible extension queue 257. Compared 30884 event pairs, 500 based on Foata normal form. 69/6779 useless extension candidates. Maximal degree in co-relation 30972. Up to 3684 conditions per place. [2023-09-01 01:27:10,859 INFO L137 encePairwiseOnDemand]: 305/325 looper letters, 262 selfloop transitions, 144 changer transitions 28/434 dead transitions. [2023-09-01 01:27:10,860 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 434 transitions, 3350 flow [2023-09-01 01:27:10,860 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-09-01 01:27:10,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-09-01 01:27:10,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 2517 transitions. [2023-09-01 01:27:10,867 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3687912087912088 [2023-09-01 01:27:10,868 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 2517 transitions. [2023-09-01 01:27:10,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 2517 transitions. [2023-09-01 01:27:10,869 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-09-01 01:27:10,869 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 2517 transitions. [2023-09-01 01:27:10,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 119.85714285714286) internal successors, (2517), 21 states have internal predecessors, (2517), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:27:10,883 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 325.0) internal successors, (7150), 22 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:27:10,885 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 325.0) internal successors, (7150), 22 states have internal predecessors, (7150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-09-01 01:27:10,885 INFO L175 Difference]: Start difference. First operand has 68 places, 55 transitions, 410 flow. Second operand 21 states and 2517 transitions. [2023-09-01 01:27:10,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 434 transitions, 3350 flow [2023-09-01 01:27:10,950 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 434 transitions, 3293 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-09-01 01:27:10,955 INFO L231 Difference]: Finished difference. Result has 98 places, 194 transitions, 1965 flow [2023-09-01 01:27:10,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=325, PETRI_DIFFERENCE_MINUEND_FLOW=385, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=1965, PETRI_PLACES=98, PETRI_TRANSITIONS=194} [2023-09-01 01:27:10,956 INFO L281 CegarLoopForPetriNet]: 51 programPoint places, 47 predicate places. [2023-09-01 01:27:10,956 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 194 transitions, 1965 flow [2023-09-01 01:27:10,957 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has 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-09-01 01:27:10,957 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-09-01 01:27:10,957 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-09-01 01:27:10,977 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-09-01 01:27:11,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-09-01 01:27:11,170 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-09-01 01:27:11,171 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-09-01 01:27:11,171 INFO L85 PathProgramCache]: Analyzing trace with hash 767085218, now seen corresponding path program 1 times [2023-09-01 01:27:11,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-09-01 01:27:11,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860393191] [2023-09-01 01:27:11,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:27:11,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-09-01 01:27:11,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-09-01 01:27:12,077 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-09-01 01:27:12,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-09-01 01:27:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860393191] [2023-09-01 01:27:12,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860393191] provided 0 perfect and 1 imperfect interpolant sequences [2023-09-01 01:27:12,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [268481763] [2023-09-01 01:27:12,077 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-09-01 01:27:12,078 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-09-01 01:27:12,078 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2023-09-01 01:27:12,079 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-09-01 01:27:12,085 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process Killed by 15