./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:37:51,684 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:37:51,737 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:37:51,742 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:37:51,742 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:37:51,765 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:37:51,769 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:37:51,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:37:51,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:37:51,771 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:37:51,771 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:37:51,772 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:37:51,772 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:37:51,772 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:37:51,774 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:37:51,774 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:37:51,774 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:37:51,774 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:37:51,775 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:37:51,775 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:37:51,778 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:37:51,778 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:37:51,778 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:37:51,778 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:37:51,779 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:37:51,779 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:51,780 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:37:51,780 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:37:51,781 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:37:51,781 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:37:51,781 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:37:51,781 INFO L153 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 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2024-11-19 09:37:51,998 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:37:52,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:37:52,020 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:37:52,021 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:37:52,021 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:37:52,022 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-11-19 09:37:53,317 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:37:53,516 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:37:53,517 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-11-19 09:37:53,537 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7202637/119380be772d4765b5bd61f1e3242c27/FLAGdb96bb194 [2024-11-19 09:37:53,547 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7202637/119380be772d4765b5bd61f1e3242c27 [2024-11-19 09:37:53,550 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:37:53,551 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:37:53,552 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:53,552 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:37:53,556 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:37:53,557 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:53" (1/1) ... [2024-11-19 09:37:53,558 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@75c560d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:53, skipping insertion in model container [2024-11-19 09:37:53,558 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:37:53" (1/1) ... [2024-11-19 09:37:53,592 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:37:54,109 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:54,129 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:37:54,172 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:37:54,229 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:37:54,229 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54 WrapperNode [2024-11-19 09:37:54,229 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:37:54,230 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:54,230 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:37:54,231 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:37:54,236 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,251 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,273 INFO L138 Inliner]: procedures = 368, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 89 [2024-11-19 09:37:54,275 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:37:54,275 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:37:54,277 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:37:54,277 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:37:54,285 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,285 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,292 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,309 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [5, 5, 20]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [5, 5, 0]. The 12 writes are split as follows [0, 0, 12]. [2024-11-19 09:37:54,309 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,309 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,316 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,317 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,318 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,319 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,322 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:37:54,322 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:37:54,322 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:37:54,322 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:37:54,323 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (1/1) ... [2024-11-19 09:37:54,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:37:54,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:37:54,354 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:37:54,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:37:54,385 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:37:54,386 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:37:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-19 09:37:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:37:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:37:54,387 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:37:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:37:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:37:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:37:54,388 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:37:54,388 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:37:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:37:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:37:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 09:37:54,389 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:37:54,389 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:37:54,390 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:37:54,528 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:37:54,531 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:37:54,832 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:37:54,832 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:37:54,953 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:37:54,953 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:37:54,953 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:54 BoogieIcfgContainer [2024-11-19 09:37:54,954 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:37:54,955 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:37:54,955 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:37:54,958 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:37:54,958 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:37:53" (1/3) ... [2024-11-19 09:37:54,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ac39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:54, skipping insertion in model container [2024-11-19 09:37:54,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:37:54" (2/3) ... [2024-11-19 09:37:54,959 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@384ac39b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:37:54, skipping insertion in model container [2024-11-19 09:37:54,959 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:54" (3/3) ... [2024-11-19 09:37:54,960 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2024-11-19 09:37:54,972 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:37:54,972 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 09:37:54,972 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:37:55,021 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:37:55,052 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2024-11-19 09:37:55,106 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2024-11-19 09:37:55,106 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:55,109 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-19 09:37:55,109 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2024-11-19 09:37:55,113 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2024-11-19 09:37:55,120 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:37:55,125 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@627a13b2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:37:55,125 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-19 09:37:55,127 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:37:55,127 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-19 09:37:55,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:55,127 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:55,127 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:37:55,128 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:55,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:55,132 INFO L85 PathProgramCache]: Analyzing trace with hash 11284, now seen corresponding path program 1 times [2024-11-19 09:37:55,140 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:55,140 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040056726] [2024-11-19 09:37:55,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:55,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:55,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:55,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:55,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040056726] [2024-11-19 09:37:55,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040056726] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:55,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:55,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:37:55,356 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [763711391] [2024-11-19 09:37:55,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:55,364 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:55,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:55,397 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:55,398 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:55,468 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-11-19 09:37:55,471 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:55,471 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:55,471 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-11-19 09:37:55,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:55,597 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2024-11-19 09:37:55,598 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:55,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2024-11-19 09:37:55,603 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-11-19 09:37:55,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2024-11-19 09:37:55,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:55,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:55,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-11-19 09:37:55,615 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2024-11-19 09:37:55,616 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2024-11-19 09:37:55,617 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2024-11-19 09:37:55,619 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:55,621 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2024-11-19 09:37:55,624 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-11-19 09:37:55,627 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2024-11-19 09:37:55,629 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2024-11-19 09:37:55,629 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:55,629 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:55,630 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:37:55,630 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:37:55,630 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:55,631 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:55,631 INFO L85 PathProgramCache]: Analyzing trace with hash 11285, now seen corresponding path program 1 times [2024-11-19 09:37:55,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:55,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [238851899] [2024-11-19 09:37:55,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:55,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:55,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:55,739 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:55,739 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:55,739 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [238851899] [2024-11-19 09:37:55,739 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [238851899] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:55,740 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:55,748 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:37:55,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1229454432] [2024-11-19 09:37:55,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:55,749 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:37:55,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:55,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:37:55,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:37:55,824 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-11-19 09:37:55,825 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:55,825 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:55,825 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-11-19 09:37:55,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:55,937 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2024-11-19 09:37:55,937 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:37:55,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2024-11-19 09:37:55,940 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-11-19 09:37:55,941 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2024-11-19 09:37:55,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:55,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:55,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-11-19 09:37:55,942 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-11-19 09:37:55,942 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2024-11-19 09:37:55,943 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2024-11-19 09:37:55,943 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:55,944 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2024-11-19 09:37:55,944 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-19 09:37:55,945 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2024-11-19 09:37:55,945 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2024-11-19 09:37:55,945 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:55,945 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:55,946 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:37:55,946 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:37:55,946 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:55,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:55,946 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858293, now seen corresponding path program 1 times [2024-11-19 09:37:55,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:55,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639628808] [2024-11-19 09:37:55,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:55,947 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:56,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:56,054 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:56,054 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639628808] [2024-11-19 09:37:56,054 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [639628808] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:56,054 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:56,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:37:56,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825969273] [2024-11-19 09:37:56,055 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:56,055 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:37:56,055 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:56,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:37:56,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:37:56,167 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 83 [2024-11-19 09:37:56,167 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,169 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:56,169 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 83 [2024-11-19 09:37:56,169 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:56,268 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2024-11-19 09:37:56,268 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:56,269 INFO L83 FinitePrefix]: Finished finitePrefix Result has 654 conditions, 392 events. 110/392 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1982 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 249 conditions per place. [2024-11-19 09:37:56,271 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2024-11-19 09:37:56,271 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 63 transitions, 202 flow [2024-11-19 09:37:56,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:37:56,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:37:56,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2024-11-19 09:37:56,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5783132530120482 [2024-11-19 09:37:56,273 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 4 states and 192 transitions. [2024-11-19 09:37:56,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 63 transitions, 202 flow [2024-11-19 09:37:56,273 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 63 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:56,274 INFO L231 Difference]: Finished difference. Result has 69 places, 63 transitions, 132 flow [2024-11-19 09:37:56,274 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=132, PETRI_PLACES=69, PETRI_TRANSITIONS=63} [2024-11-19 09:37:56,275 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -17 predicate places. [2024-11-19 09:37:56,275 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 63 transitions, 132 flow [2024-11-19 09:37:56,275 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.2) internal successors, (201), 5 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,275 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:56,276 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:37:56,276 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:37:56,276 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:56,276 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:56,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1840858294, now seen corresponding path program 1 times [2024-11-19 09:37:56,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:56,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1828670427] [2024-11-19 09:37:56,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:56,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:56,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:56,384 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:56,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:56,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1828670427] [2024-11-19 09:37:56,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1828670427] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:56,384 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:56,384 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:56,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367103264] [2024-11-19 09:37:56,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:56,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:37:56,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:56,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:37:56,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:37:56,488 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-11-19 09:37:56,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 63 transitions, 132 flow. Second operand has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,489 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:56,489 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-11-19 09:37:56,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:56,614 INFO L124 PetriNetUnfolderBase]: 110/387 cut-off events. [2024-11-19 09:37:56,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:37:56,616 INFO L83 FinitePrefix]: Finished finitePrefix Result has 643 conditions, 387 events. 110/387 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1977 event pairs, 110 based on Foata normal form. 0/332 useless extension candidates. Maximal degree in co-relation 630. Up to 247 conditions per place. [2024-11-19 09:37:56,618 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 27 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-19 09:37:56,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 60 transitions, 184 flow [2024-11-19 09:37:56,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:37:56,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:37:56,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 236 transitions. [2024-11-19 09:37:56,621 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-11-19 09:37:56,622 INFO L175 Difference]: Start difference. First operand has 69 places, 63 transitions, 132 flow. Second operand 4 states and 236 transitions. [2024-11-19 09:37:56,622 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 60 transitions, 184 flow [2024-11-19 09:37:56,622 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 60 transitions, 181 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:56,623 INFO L231 Difference]: Finished difference. Result has 67 places, 60 transitions, 127 flow [2024-11-19 09:37:56,623 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=127, PETRI_PLACES=67, PETRI_TRANSITIONS=60} [2024-11-19 09:37:56,624 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -19 predicate places. [2024-11-19 09:37:56,624 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 60 transitions, 127 flow [2024-11-19 09:37:56,624 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 52.0) internal successors, (208), 4 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,624 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:56,625 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:56,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:37:56,625 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:56,625 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:56,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543333, now seen corresponding path program 1 times [2024-11-19 09:37:56,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:56,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338533720] [2024-11-19 09:37:56,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:56,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:56,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:56,806 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:56,806 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:56,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338533720] [2024-11-19 09:37:56,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338533720] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:56,807 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:56,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:37:56,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529562636] [2024-11-19 09:37:56,807 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:56,808 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:37:56,808 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:56,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:37:56,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:37:56,876 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-11-19 09:37:56,876 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 60 transitions, 127 flow. Second operand has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,876 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:56,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-11-19 09:37:56,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:56,946 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2024-11-19 09:37:56,946 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:56,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 618 conditions, 357 events. 110/357 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1692 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 602. Up to 248 conditions per place. [2024-11-19 09:37:56,949 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 32 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2024-11-19 09:37:56,949 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 187 flow [2024-11-19 09:37:56,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:37:56,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:37:56,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-11-19 09:37:56,951 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-11-19 09:37:56,951 INFO L175 Difference]: Start difference. First operand has 67 places, 60 transitions, 127 flow. Second operand 3 states and 177 transitions. [2024-11-19 09:37:56,951 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 187 flow [2024-11-19 09:37:56,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 184 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:56,953 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2024-11-19 09:37:56,953 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-19 09:37:56,955 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2024-11-19 09:37:56,955 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2024-11-19 09:37:56,956 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 49.75) internal successors, (199), 4 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:56,956 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:56,956 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:56,956 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:37:56,956 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:56,956 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:56,956 INFO L85 PathProgramCache]: Analyzing trace with hash -1865543332, now seen corresponding path program 1 times [2024-11-19 09:37:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [856398000] [2024-11-19 09:37:56,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:56,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:56,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:57,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:57,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:57,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [856398000] [2024-11-19 09:37:57,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [856398000] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:57,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:57,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:37:57,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211549361] [2024-11-19 09:37:57,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:57,147 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:37:57,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:57,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:37:57,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:37:57,277 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 83 [2024-11-19 09:37:57,277 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:57,277 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:57,278 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 83 [2024-11-19 09:37:57,278 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:57,354 INFO L124 PetriNetUnfolderBase]: 110/344 cut-off events. [2024-11-19 09:37:57,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:57,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 344 events. 110/344 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1577 event pairs, 110 based on Foata normal form. 0/314 useless extension candidates. Maximal degree in co-relation 590. Up to 246 conditions per place. [2024-11-19 09:37:57,357 INFO L140 encePairwiseOnDemand]: 78/83 looper letters, 31 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2024-11-19 09:37:57,357 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 54 transitions, 180 flow [2024-11-19 09:37:57,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:37:57,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:37:57,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 180 transitions. [2024-11-19 09:37:57,358 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5421686746987951 [2024-11-19 09:37:57,358 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 4 states and 180 transitions. [2024-11-19 09:37:57,358 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 54 transitions, 180 flow [2024-11-19 09:37:57,358 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 54 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:37:57,359 INFO L231 Difference]: Finished difference. Result has 63 places, 54 transitions, 117 flow [2024-11-19 09:37:57,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=63, PETRI_TRANSITIONS=54} [2024-11-19 09:37:57,359 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -23 predicate places. [2024-11-19 09:37:57,359 INFO L471 AbstractCegarLoop]: Abstraction has has 63 places, 54 transitions, 117 flow [2024-11-19 09:37:57,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:57,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:57,360 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:57,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:37:57,360 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:57,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:57,362 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825083, now seen corresponding path program 1 times [2024-11-19 09:37:57,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:57,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [172176948] [2024-11-19 09:37:57,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:57,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:57,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:57,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:57,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:57,952 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [172176948] [2024-11-19 09:37:57,952 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [172176948] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:57,952 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:57,952 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:37:57,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157422020] [2024-11-19 09:37:57,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:57,953 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:37:57,953 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:57,953 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:37:57,953 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:37:58,637 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-11-19 09:37:58,638 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 54 transitions, 117 flow. Second operand has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:58,638 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:37:58,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-11-19 09:37:58,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:37:58,925 INFO L124 PetriNetUnfolderBase]: 167/488 cut-off events. [2024-11-19 09:37:58,925 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:37:58,926 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 488 events. 167/488 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 2508 event pairs, 6 based on Foata normal form. 0/453 useless extension candidates. Maximal degree in co-relation 857. Up to 180 conditions per place. [2024-11-19 09:37:58,927 INFO L140 encePairwiseOnDemand]: 70/83 looper letters, 61 selfloop transitions, 14 changer transitions 0/91 dead transitions. [2024-11-19 09:37:58,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 91 transitions, 341 flow [2024-11-19 09:37:58,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:37:58,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:37:58,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 456 transitions. [2024-11-19 09:37:58,929 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4994523548740416 [2024-11-19 09:37:58,929 INFO L175 Difference]: Start difference. First operand has 63 places, 54 transitions, 117 flow. Second operand 11 states and 456 transitions. [2024-11-19 09:37:58,929 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 91 transitions, 341 flow [2024-11-19 09:37:58,930 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 91 transitions, 338 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:37:58,932 INFO L231 Difference]: Finished difference. Result has 72 places, 58 transitions, 171 flow [2024-11-19 09:37:58,932 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=171, PETRI_PLACES=72, PETRI_TRANSITIONS=58} [2024-11-19 09:37:58,933 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -14 predicate places. [2024-11-19 09:37:58,933 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 58 transitions, 171 flow [2024-11-19 09:37:58,933 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.15384615384615) internal successors, (457), 13 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:37:58,933 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:37:58,934 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:37:58,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:37:58,934 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:37:58,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:37:58,934 INFO L85 PathProgramCache]: Analyzing trace with hash -2094825082, now seen corresponding path program 1 times [2024-11-19 09:37:58,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:37:58,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034907862] [2024-11-19 09:37:58,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:37:58,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:37:58,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:37:59,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:37:59,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:37:59,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034907862] [2024-11-19 09:37:59,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2034907862] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:37:59,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:37:59,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:37:59,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731154811] [2024-11-19 09:37:59,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:37:59,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:37:59,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:37:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:37:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:00,000 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2024-11-19 09:38:00,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 58 transitions, 171 flow. Second operand has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:00,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:00,001 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2024-11-19 09:38:00,001 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:00,306 INFO L124 PetriNetUnfolderBase]: 176/487 cut-off events. [2024-11-19 09:38:00,306 INFO L125 PetriNetUnfolderBase]: For 88/88 co-relation queries the response was YES. [2024-11-19 09:38:00,307 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1014 conditions, 487 events. 176/487 cut-off events. For 88/88 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2507 event pairs, 2 based on Foata normal form. 15/445 useless extension candidates. Maximal degree in co-relation 993. Up to 247 conditions per place. [2024-11-19 09:38:00,309 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 65 selfloop transitions, 13 changer transitions 0/91 dead transitions. [2024-11-19 09:38:00,309 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 91 transitions, 403 flow [2024-11-19 09:38:00,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:38:00,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:38:00,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 448 transitions. [2024-11-19 09:38:00,311 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5997322623828648 [2024-11-19 09:38:00,311 INFO L175 Difference]: Start difference. First operand has 72 places, 58 transitions, 171 flow. Second operand 9 states and 448 transitions. [2024-11-19 09:38:00,311 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 91 transitions, 403 flow [2024-11-19 09:38:00,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 91 transitions, 395 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:00,313 INFO L231 Difference]: Finished difference. Result has 74 places, 59 transitions, 201 flow [2024-11-19 09:38:00,313 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=201, PETRI_PLACES=74, PETRI_TRANSITIONS=59} [2024-11-19 09:38:00,314 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -12 predicate places. [2024-11-19 09:38:00,314 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 59 transitions, 201 flow [2024-11-19 09:38:00,314 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:00,314 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:00,314 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:00,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:38:00,315 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:00,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:00,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2128602727, now seen corresponding path program 1 times [2024-11-19 09:38:00,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:00,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507610127] [2024-11-19 09:38:00,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:00,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:00,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:00,825 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:00,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:00,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507610127] [2024-11-19 09:38:00,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507610127] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:00,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:00,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:00,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642141969] [2024-11-19 09:38:00,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:00,827 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:00,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:00,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:00,827 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:01,097 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-11-19 09:38:01,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 59 transitions, 201 flow. Second operand has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-11-19 09:38:01,098 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,331 INFO L124 PetriNetUnfolderBase]: 166/466 cut-off events. [2024-11-19 09:38:01,332 INFO L125 PetriNetUnfolderBase]: For 160/160 co-relation queries the response was YES. [2024-11-19 09:38:01,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1008 conditions, 466 events. 166/466 cut-off events. For 160/160 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2378 event pairs, 42 based on Foata normal form. 0/417 useless extension candidates. Maximal degree in co-relation 986. Up to 184 conditions per place. [2024-11-19 09:38:01,334 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 70 selfloop transitions, 16 changer transitions 0/99 dead transitions. [2024-11-19 09:38:01,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 465 flow [2024-11-19 09:38:01,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:38:01,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:38:01,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 516 transitions. [2024-11-19 09:38:01,336 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6216867469879518 [2024-11-19 09:38:01,336 INFO L175 Difference]: Start difference. First operand has 74 places, 59 transitions, 201 flow. Second operand 10 states and 516 transitions. [2024-11-19 09:38:01,336 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 465 flow [2024-11-19 09:38:01,338 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 99 transitions, 452 flow, removed 2 selfloop flow, removed 3 redundant places. [2024-11-19 09:38:01,339 INFO L231 Difference]: Finished difference. Result has 82 places, 62 transitions, 244 flow [2024-11-19 09:38:01,340 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=189, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=82, PETRI_TRANSITIONS=62} [2024-11-19 09:38:01,341 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-11-19 09:38:01,341 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 62 transitions, 244 flow [2024-11-19 09:38:01,341 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.77777777777778) internal successors, (403), 9 states have internal predecessors, (403), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,342 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,342 INFO L204 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] [2024-11-19 09:38:01,342 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:38:01,342 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:01,342 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1460892621, now seen corresponding path program 1 times [2024-11-19 09:38:01,342 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,343 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1995683185] [2024-11-19 09:38:01,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:01,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:01,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:01,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1995683185] [2024-11-19 09:38:01,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1995683185] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:01,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:01,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:01,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79754313] [2024-11-19 09:38:01,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:01,451 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:01,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:01,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:01,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:01,451 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2024-11-19 09:38:01,452 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 62 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,452 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,452 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2024-11-19 09:38:01,452 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,522 INFO L124 PetriNetUnfolderBase]: 105/347 cut-off events. [2024-11-19 09:38:01,522 INFO L125 PetriNetUnfolderBase]: For 183/183 co-relation queries the response was YES. [2024-11-19 09:38:01,523 INFO L83 FinitePrefix]: Finished finitePrefix Result has 771 conditions, 347 events. 105/347 cut-off events. For 183/183 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1757 event pairs, 43 based on Foata normal form. 6/335 useless extension candidates. Maximal degree in co-relation 750. Up to 174 conditions per place. [2024-11-19 09:38:01,524 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 48 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2024-11-19 09:38:01,524 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 78 transitions, 390 flow [2024-11-19 09:38:01,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:01,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:01,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-19 09:38:01,525 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2024-11-19 09:38:01,525 INFO L175 Difference]: Start difference. First operand has 82 places, 62 transitions, 244 flow. Second operand 3 states and 213 transitions. [2024-11-19 09:38:01,525 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 78 transitions, 390 flow [2024-11-19 09:38:01,528 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 78 transitions, 356 flow, removed 3 selfloop flow, removed 7 redundant places. [2024-11-19 09:38:01,530 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 226 flow [2024-11-19 09:38:01,531 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=226, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2024-11-19 09:38:01,531 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2024-11-19 09:38:01,533 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 226 flow [2024-11-19 09:38:01,533 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,533 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,533 INFO L204 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] [2024-11-19 09:38:01,533 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:38:01,533 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:01,534 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,534 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614886, now seen corresponding path program 1 times [2024-11-19 09:38:01,534 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,534 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1763172158] [2024-11-19 09:38:01,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:01,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:01,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:01,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1763172158] [2024-11-19 09:38:01,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1763172158] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:01,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:01,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:01,721 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657545174] [2024-11-19 09:38:01,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:01,721 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:38:01,721 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:01,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:38:01,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:38:01,781 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-11-19 09:38:01,781 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 226 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,782 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:01,782 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-11-19 09:38:01,782 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:01,898 INFO L124 PetriNetUnfolderBase]: 140/446 cut-off events. [2024-11-19 09:38:01,898 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2024-11-19 09:38:01,899 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1010 conditions, 446 events. 140/446 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 2392 event pairs, 14 based on Foata normal form. 0/419 useless extension candidates. Maximal degree in co-relation 987. Up to 183 conditions per place. [2024-11-19 09:38:01,900 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 12 changer transitions 0/88 dead transitions. [2024-11-19 09:38:01,900 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 449 flow [2024-11-19 09:38:01,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:01,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:01,901 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-11-19 09:38:01,901 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2024-11-19 09:38:01,902 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 226 flow. Second operand 5 states and 305 transitions. [2024-11-19 09:38:01,902 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 449 flow [2024-11-19 09:38:01,903 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 436 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:01,903 INFO L231 Difference]: Finished difference. Result has 82 places, 66 transitions, 273 flow [2024-11-19 09:38:01,904 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=273, PETRI_PLACES=82, PETRI_TRANSITIONS=66} [2024-11-19 09:38:01,904 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-11-19 09:38:01,904 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 66 transitions, 273 flow [2024-11-19 09:38:01,905 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:01,905 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:01,905 INFO L204 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] [2024-11-19 09:38:01,905 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:38:01,905 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:01,906 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:01,906 INFO L85 PathProgramCache]: Analyzing trace with hash -1711614887, now seen corresponding path program 1 times [2024-11-19 09:38:01,906 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:01,906 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115061937] [2024-11-19 09:38:01,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:01,907 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:01,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,015 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,016 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,016 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115061937] [2024-11-19 09:38:02,016 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115061937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:02,016 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:02,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:38:02,016 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [966918397] [2024-11-19 09:38:02,016 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:38:02,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,017 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:38:02,017 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:38:02,122 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 83 [2024-11-19 09:38:02,123 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 66 transitions, 273 flow. Second operand has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,123 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:02,123 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 83 [2024-11-19 09:38:02,123 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:02,239 INFO L124 PetriNetUnfolderBase]: 140/436 cut-off events. [2024-11-19 09:38:02,240 INFO L125 PetriNetUnfolderBase]: For 246/246 co-relation queries the response was YES. [2024-11-19 09:38:02,241 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1074 conditions, 436 events. 140/436 cut-off events. For 246/246 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 2274 event pairs, 58 based on Foata normal form. 0/413 useless extension candidates. Maximal degree in co-relation 1048. Up to 191 conditions per place. [2024-11-19 09:38:02,242 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 48 selfloop transitions, 19 changer transitions 0/85 dead transitions. [2024-11-19 09:38:02,242 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 85 transitions, 463 flow [2024-11-19 09:38:02,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:38:02,243 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:38:02,244 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 303 transitions. [2024-11-19 09:38:02,244 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.608433734939759 [2024-11-19 09:38:02,244 INFO L175 Difference]: Start difference. First operand has 82 places, 66 transitions, 273 flow. Second operand 6 states and 303 transitions. [2024-11-19 09:38:02,244 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 85 transitions, 463 flow [2024-11-19 09:38:02,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 85 transitions, 463 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:38:02,247 INFO L231 Difference]: Finished difference. Result has 90 places, 67 transitions, 349 flow [2024-11-19 09:38:02,247 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=273, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=349, PETRI_PLACES=90, PETRI_TRANSITIONS=67} [2024-11-19 09:38:02,249 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 4 predicate places. [2024-11-19 09:38:02,249 INFO L471 AbstractCegarLoop]: Abstraction has has 90 places, 67 transitions, 349 flow [2024-11-19 09:38:02,249 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 44.333333333333336) internal successors, (266), 6 states have internal predecessors, (266), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:02,249 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:02,249 INFO L204 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, 1] [2024-11-19 09:38:02,250 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:38:02,250 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:02,250 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:02,250 INFO L85 PathProgramCache]: Analyzing trace with hash -38564856, now seen corresponding path program 1 times [2024-11-19 09:38:02,250 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:02,250 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2001693517] [2024-11-19 09:38:02,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:02,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:02,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:02,673 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:02,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:02,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2001693517] [2024-11-19 09:38:02,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2001693517] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:02,676 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:02,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2024-11-19 09:38:02,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103283453] [2024-11-19 09:38:02,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:02,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:38:02,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:02,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:38:02,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:38:03,361 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-11-19 09:38:03,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 67 transitions, 349 flow. Second operand has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:03,362 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-11-19 09:38:03,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:03,971 INFO L124 PetriNetUnfolderBase]: 167/474 cut-off events. [2024-11-19 09:38:03,971 INFO L125 PetriNetUnfolderBase]: For 638/638 co-relation queries the response was YES. [2024-11-19 09:38:03,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1397 conditions, 474 events. 167/474 cut-off events. For 638/638 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 2446 event pairs, 12 based on Foata normal form. 6/468 useless extension candidates. Maximal degree in co-relation 1365. Up to 76 conditions per place. [2024-11-19 09:38:03,974 INFO L140 encePairwiseOnDemand]: 67/83 looper letters, 73 selfloop transitions, 49 changer transitions 2/137 dead transitions. [2024-11-19 09:38:03,974 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 137 transitions, 893 flow [2024-11-19 09:38:03,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:38:03,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:38:03,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 834 transitions. [2024-11-19 09:38:03,977 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45673603504928806 [2024-11-19 09:38:03,977 INFO L175 Difference]: Start difference. First operand has 90 places, 67 transitions, 349 flow. Second operand 22 states and 834 transitions. [2024-11-19 09:38:03,978 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 137 transitions, 893 flow [2024-11-19 09:38:03,979 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 137 transitions, 856 flow, removed 3 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:03,981 INFO L231 Difference]: Finished difference. Result has 109 places, 88 transitions, 550 flow [2024-11-19 09:38:03,981 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=550, PETRI_PLACES=109, PETRI_TRANSITIONS=88} [2024-11-19 09:38:03,982 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 23 predicate places. [2024-11-19 09:38:03,982 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 88 transitions, 550 flow [2024-11-19 09:38:03,982 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 34.5) internal successors, (483), 14 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:03,982 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:03,982 INFO L204 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, 1] [2024-11-19 09:38:03,983 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:38:03,983 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:03,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:03,983 INFO L85 PathProgramCache]: Analyzing trace with hash 2004021681, now seen corresponding path program 1 times [2024-11-19 09:38:03,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:03,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581353045] [2024-11-19 09:38:03,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:03,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:04,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:04,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:04,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:04,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581353045] [2024-11-19 09:38:04,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581353045] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:04,399 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:04,399 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:38:04,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792281214] [2024-11-19 09:38:04,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:04,399 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:04,399 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:04,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:04,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=121, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:04,903 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 83 [2024-11-19 09:38:04,904 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 88 transitions, 550 flow. Second operand has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 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) [2024-11-19 09:38:04,904 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:04,904 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 83 [2024-11-19 09:38:04,904 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:05,208 INFO L124 PetriNetUnfolderBase]: 147/453 cut-off events. [2024-11-19 09:38:05,208 INFO L125 PetriNetUnfolderBase]: For 754/754 co-relation queries the response was YES. [2024-11-19 09:38:05,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1416 conditions, 453 events. 147/453 cut-off events. For 754/754 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2412 event pairs, 27 based on Foata normal form. 6/443 useless extension candidates. Maximal degree in co-relation 1380. Up to 72 conditions per place. [2024-11-19 09:38:05,211 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 62 selfloop transitions, 40 changer transitions 0/117 dead transitions. [2024-11-19 09:38:05,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 117 transitions, 846 flow [2024-11-19 09:38:05,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-19 09:38:05,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-19 09:38:05,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 499 transitions. [2024-11-19 09:38:05,213 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.501004016064257 [2024-11-19 09:38:05,213 INFO L175 Difference]: Start difference. First operand has 109 places, 88 transitions, 550 flow. Second operand 12 states and 499 transitions. [2024-11-19 09:38:05,213 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 117 transitions, 846 flow [2024-11-19 09:38:05,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 117 transitions, 797 flow, removed 3 selfloop flow, removed 10 redundant places. [2024-11-19 09:38:05,218 INFO L231 Difference]: Finished difference. Result has 112 places, 88 transitions, 602 flow [2024-11-19 09:38:05,218 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=501, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=40, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=602, PETRI_PLACES=112, PETRI_TRANSITIONS=88} [2024-11-19 09:38:05,219 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 26 predicate places. [2024-11-19 09:38:05,219 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 88 transitions, 602 flow [2024-11-19 09:38:05,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 36.61538461538461) internal successors, (476), 13 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) [2024-11-19 09:38:05,219 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:05,220 INFO L204 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, 1] [2024-11-19 09:38:05,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:38:05,220 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:05,220 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:05,220 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081057, now seen corresponding path program 1 times [2024-11-19 09:38:05,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:05,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537290417] [2024-11-19 09:38:05,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:05,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:05,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:05,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:05,657 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:05,657 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537290417] [2024-11-19 09:38:05,657 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537290417] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:05,657 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:05,658 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:38:05,658 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1143892077] [2024-11-19 09:38:05,658 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:05,658 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:05,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:05,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:05,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:06,380 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-11-19 09:38:06,381 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 88 transitions, 602 flow. Second operand has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 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) [2024-11-19 09:38:06,381 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:06,381 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-11-19 09:38:06,381 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:06,787 INFO L124 PetriNetUnfolderBase]: 185/545 cut-off events. [2024-11-19 09:38:06,788 INFO L125 PetriNetUnfolderBase]: For 1222/1222 co-relation queries the response was YES. [2024-11-19 09:38:06,789 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1808 conditions, 545 events. 185/545 cut-off events. For 1222/1222 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 3026 event pairs, 17 based on Foata normal form. 31/574 useless extension candidates. Maximal degree in co-relation 1767. Up to 97 conditions per place. [2024-11-19 09:38:06,791 INFO L140 encePairwiseOnDemand]: 66/83 looper letters, 98 selfloop transitions, 38 changer transitions 0/148 dead transitions. [2024-11-19 09:38:06,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 148 transitions, 1183 flow [2024-11-19 09:38:06,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:38:06,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:38:06,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 658 transitions. [2024-11-19 09:38:06,793 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4954819277108434 [2024-11-19 09:38:06,793 INFO L175 Difference]: Start difference. First operand has 112 places, 88 transitions, 602 flow. Second operand 16 states and 658 transitions. [2024-11-19 09:38:06,793 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 148 transitions, 1183 flow [2024-11-19 09:38:06,796 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 148 transitions, 1067 flow, removed 1 selfloop flow, removed 12 redundant places. [2024-11-19 09:38:06,798 INFO L231 Difference]: Finished difference. Result has 116 places, 95 transitions, 687 flow [2024-11-19 09:38:06,798 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=512, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=687, PETRI_PLACES=116, PETRI_TRANSITIONS=95} [2024-11-19 09:38:06,798 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 30 predicate places. [2024-11-19 09:38:06,798 INFO L471 AbstractCegarLoop]: Abstraction has has 116 places, 95 transitions, 687 flow [2024-11-19 09:38:06,799 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 35.53846153846154) internal successors, (462), 13 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) [2024-11-19 09:38:06,799 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:06,799 INFO L204 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, 1] [2024-11-19 09:38:06,799 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:38:06,799 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:06,799 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:06,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1245081056, now seen corresponding path program 1 times [2024-11-19 09:38:06,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:06,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [376514670] [2024-11-19 09:38:06,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:06,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:06,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:07,295 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:07,296 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:38:07,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [376514670] [2024-11-19 09:38:07,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [376514670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:07,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:07,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-19 09:38:07,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1739939590] [2024-11-19 09:38:07,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:07,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:38:07,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:38:07,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:38:07,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:38:07,987 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-11-19 09:38:07,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 95 transitions, 687 flow. Second operand has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:07,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:07,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-11-19 09:38:07,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:08,357 INFO L124 PetriNetUnfolderBase]: 201/525 cut-off events. [2024-11-19 09:38:08,357 INFO L125 PetriNetUnfolderBase]: For 1370/1370 co-relation queries the response was YES. [2024-11-19 09:38:08,359 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1901 conditions, 525 events. 201/525 cut-off events. For 1370/1370 co-relation queries the response was YES. Maximal size of possible extension queue 37. Compared 2677 event pairs, 20 based on Foata normal form. 25/548 useless extension candidates. Maximal degree in co-relation 1859. Up to 168 conditions per place. [2024-11-19 09:38:08,360 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 87 selfloop transitions, 30 changer transitions 11/136 dead transitions. [2024-11-19 09:38:08,360 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 136 transitions, 1143 flow [2024-11-19 09:38:08,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 09:38:08,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-19 09:38:08,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 608 transitions. [2024-11-19 09:38:08,365 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4578313253012048 [2024-11-19 09:38:08,365 INFO L175 Difference]: Start difference. First operand has 116 places, 95 transitions, 687 flow. Second operand 16 states and 608 transitions. [2024-11-19 09:38:08,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 136 transitions, 1143 flow [2024-11-19 09:38:08,368 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 136 transitions, 1114 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:38:08,370 INFO L231 Difference]: Finished difference. Result has 121 places, 85 transitions, 619 flow [2024-11-19 09:38:08,370 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=654, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=619, PETRI_PLACES=121, PETRI_TRANSITIONS=85} [2024-11-19 09:38:08,371 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 35 predicate places. [2024-11-19 09:38:08,371 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 85 transitions, 619 flow [2024-11-19 09:38:08,371 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 33.53846153846154) internal successors, (436), 13 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:08,372 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:08,372 INFO L204 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, 1, 1, 1] [2024-11-19 09:38:08,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-19 09:38:08,372 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:08,372 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:08,373 INFO L85 PathProgramCache]: Analyzing trace with hash -866987548, now seen corresponding path program 1 times [2024-11-19 09:38:08,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:38:08,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105724553] [2024-11-19 09:38:08,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:08,374 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:38:08,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:08,402 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:38:08,418 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:08,450 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:38:08,450 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:38:08,452 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-11-19 09:38:08,453 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-11-19 09:38:08,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-11-19 09:38:08,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-11-19 09:38:08,454 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-11-19 09:38:08,455 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-11-19 09:38:08,456 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2024-11-19 09:38:08,457 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-11-19 09:38:08,458 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-11-19 09:38:08,459 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-11-19 09:38:08,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-11-19 09:38:08,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-11-19 09:38:08,460 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-11-19 09:38:08,460 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-19 09:38:08,460 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:08,500 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:38:08,501 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:38:08,504 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:38:08 BasicIcfg [2024-11-19 09:38:08,505 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:38:08,505 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:38:08,505 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:38:08,506 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:38:08,506 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:37:54" (3/4) ... [2024-11-19 09:38:08,507 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:38:08,508 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:38:08,509 INFO L158 Benchmark]: Toolchain (without parser) took 14958.03ms. Allocated memory was 178.3MB in the beginning and 427.8MB in the end (delta: 249.6MB). Free memory was 107.6MB in the beginning and 266.8MB in the end (delta: -159.2MB). Peak memory consumption was 91.0MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,510 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:08,510 INFO L158 Benchmark]: CACSL2BoogieTranslator took 677.86ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 119.2MB in the end (delta: -11.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,510 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.82ms. Allocated memory is still 178.3MB. Free memory was 119.2MB in the beginning and 116.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,511 INFO L158 Benchmark]: Boogie Preprocessor took 46.34ms. Allocated memory is still 178.3MB. Free memory was 116.3MB in the beginning and 112.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,511 INFO L158 Benchmark]: RCFGBuilder took 631.44ms. Allocated memory is still 178.3MB. Free memory was 112.9MB in the beginning and 64.0MB in the end (delta: 48.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,511 INFO L158 Benchmark]: TraceAbstraction took 13549.90ms. Allocated memory was 178.3MB in the beginning and 427.8MB in the end (delta: 249.6MB). Free memory was 63.3MB in the beginning and 266.8MB in the end (delta: -203.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. [2024-11-19 09:38:08,511 INFO L158 Benchmark]: Witness Printer took 2.90ms. Allocated memory is still 427.8MB. Free memory is still 266.8MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:08,512 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 104.9MB. Free memory is still 66.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 677.86ms. Allocated memory is still 178.3MB. Free memory was 107.4MB in the beginning and 119.2MB in the end (delta: -11.8MB). Peak memory consumption was 12.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.82ms. Allocated memory is still 178.3MB. Free memory was 119.2MB in the beginning and 116.3MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 46.34ms. Allocated memory is still 178.3MB. Free memory was 116.3MB in the beginning and 112.9MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.44ms. Allocated memory is still 178.3MB. Free memory was 112.9MB in the beginning and 64.0MB in the end (delta: 48.9MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 13549.90ms. Allocated memory was 178.3MB in the beginning and 427.8MB in the end (delta: 249.6MB). Free memory was 63.3MB in the beginning and 266.8MB in the end (delta: -203.5MB). Peak memory consumption was 46.7MB. Max. memory is 16.1GB. * Witness Printer took 2.90ms. Allocated memory is still 427.8MB. Free memory is still 266.8MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, p={-5:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-3:0}, A_mutex={1:0}, B={-4:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={-5:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 13.4s, OverallIterations: 17, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 4882 SdHoareTripleChecker+Valid, 6.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3934 mSDsluCounter, 2168 SdHoareTripleChecker+Invalid, 5.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1972 mSDsCounter, 330 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 14077 IncrementalHoareTripleChecker+Invalid, 14407 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 330 mSolverCounterUnsat, 196 mSDtfsCounter, 14077 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 155 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 531 ImplicationChecksByTransitivity, 1.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=687occurred in iteration=15, InterpolantAutomatonStates: 131, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 4.3s InterpolantComputationTime, 280 NumberOfCodeBlocks, 280 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 238 ConstructedInterpolants, 0 QuantifiedInterpolants, 3257 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:38:08,538 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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 ../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:38:10,367 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:38:10,430 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:38:10,434 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:38:10,434 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:38:10,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:38:10,465 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:38:10,465 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:38:10,466 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:38:10,466 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:38:10,466 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:38:10,467 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:38:10,467 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:38:10,467 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:38:10,469 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:38:10,469 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:38:10,469 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:38:10,469 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:38:10,470 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:38:10,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:38:10,470 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:38:10,473 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:38:10,473 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:38:10,473 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:38:10,473 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:38:10,473 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:38:10,474 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:38:10,474 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:38:10,474 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:38:10,474 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:38:10,474 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:38:10,475 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:38:10,475 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:38:10,475 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:38:10,476 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:38:10,476 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:38:10,476 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:38:10,477 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:38:10,478 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:38:10,478 INFO L153 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 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 -> 22e95fa30ebde8538537e9926c639bef97cab57433fef0bd6d73df06023fa7d1 [2024-11-19 09:38:10,733 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:38:10,752 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:38:10,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:38:10,755 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:38:10,759 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:38:10,760 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-11-19 09:38:12,026 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:38:12,262 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:38:12,263 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/goblint-regression/09-regions_04-list2_nr.i [2024-11-19 09:38:12,283 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e07d828/e6c67d4395084256bcd2ad38a0d1928f/FLAG6008f9d63 [2024-11-19 09:38:12,296 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52e07d828/e6c67d4395084256bcd2ad38a0d1928f [2024-11-19 09:38:12,299 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:38:12,300 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:38:12,302 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:38:12,302 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:38:12,306 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:38:12,307 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,307 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@48cb329b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12, skipping insertion in model container [2024-11-19 09:38:12,307 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,354 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:38:12,759 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:12,778 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:38:12,828 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:38:12,891 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:38:12,892 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12 WrapperNode [2024-11-19 09:38:12,892 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:38:12,892 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:12,892 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:38:12,893 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:38:12,898 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,920 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,937 INFO L138 Inliner]: procedures = 369, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 90 [2024-11-19 09:38:12,937 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:38:12,938 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:38:12,938 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:38:12,938 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:38:12,946 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,947 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,950 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,961 INFO L175 MemorySlicer]: Split 30 memory accesses to 3 slices as follows [20, 5, 5]. 67 percent of accesses are in the largest equivalence class. The 10 initializations are split as follows [0, 5, 5]. The 12 writes are split as follows [12, 0, 0]. [2024-11-19 09:38:12,961 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,961 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,968 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,973 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,975 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,976 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,979 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:38:12,980 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:38:12,980 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:38:12,980 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:38:12,980 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (1/1) ... [2024-11-19 09:38:12,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:38:12,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:38:13,010 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:38:13,013 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 09:38:13,047 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#0 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#1 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE4#2 [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:38:13,048 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:38:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:38:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:38:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 09:38:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-19 09:38:13,049 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-19 09:38:13,049 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:38:13,049 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:38:13,050 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:38:13,184 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:38:13,186 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:38:13,677 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:38:13,677 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:38:13,835 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:38:13,835 INFO L316 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-19 09:38:13,835 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:13 BoogieIcfgContainer [2024-11-19 09:38:13,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:38:13,837 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:38:13,837 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:38:13,840 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:38:13,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:38:12" (1/3) ... [2024-11-19 09:38:13,840 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4403c645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:13, skipping insertion in model container [2024-11-19 09:38:13,840 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:38:12" (2/3) ... [2024-11-19 09:38:13,841 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4403c645 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:38:13, skipping insertion in model container [2024-11-19 09:38:13,841 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:13" (3/3) ... [2024-11-19 09:38:13,842 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_04-list2_nr.i [2024-11-19 09:38:13,855 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:38:13,856 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 41 error locations. [2024-11-19 09:38:13,856 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:38:13,920 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-19 09:38:13,954 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 87 places, 83 transitions, 170 flow [2024-11-19 09:38:13,982 INFO L124 PetriNetUnfolderBase]: 0/82 cut-off events. [2024-11-19 09:38:13,983 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:13,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 86 conditions, 82 events. 0/82 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 181 event pairs, 0 based on Foata normal form. 0/41 useless extension candidates. Maximal degree in co-relation 0. Up to 1 conditions per place. [2024-11-19 09:38:13,985 INFO L82 GeneralOperation]: Start removeDead. Operand has 87 places, 83 transitions, 170 flow [2024-11-19 09:38:13,988 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 86 places, 82 transitions, 167 flow [2024-11-19 09:38:13,999 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:38:14,004 INFO L333 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, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, 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;@a7e4e9f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:38:14,005 INFO L334 AbstractCegarLoop]: Starting to check reachability of 54 error locations. [2024-11-19 09:38:14,009 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:38:14,009 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-19 09:38:14,009 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:14,009 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:14,010 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:38:14,010 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:14,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:14,015 INFO L85 PathProgramCache]: Analyzing trace with hash 11348, now seen corresponding path program 1 times [2024-11-19 09:38:14,026 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:14,026 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065087700] [2024-11-19 09:38:14,026 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:14,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:14,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:14,029 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:14,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:38:14,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:14,119 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:38:14,122 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:14,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:14,181 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:14,181 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:14,182 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:14,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065087700] [2024-11-19 09:38:14,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065087700] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:14,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:14,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:38:14,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609517929] [2024-11-19 09:38:14,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:14,191 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:14,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:14,215 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:14,215 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:14,319 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 83 [2024-11-19 09:38:14,321 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 86 places, 82 transitions, 167 flow. Second operand has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:14,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:14,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 83 [2024-11-19 09:38:14,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:14,538 INFO L124 PetriNetUnfolderBase]: 99/370 cut-off events. [2024-11-19 09:38:14,539 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:14,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 605 conditions, 370 events. 99/370 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1819 event pairs, 99 based on Foata normal form. 0/313 useless extension candidates. Maximal degree in co-relation 564. Up to 223 conditions per place. [2024-11-19 09:38:14,551 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 28 selfloop transitions, 4 changer transitions 0/74 dead transitions. [2024-11-19 09:38:14,551 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 74 transitions, 215 flow [2024-11-19 09:38:14,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:14,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:14,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 169 transitions. [2024-11-19 09:38:14,560 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.678714859437751 [2024-11-19 09:38:14,561 INFO L175 Difference]: Start difference. First operand has 86 places, 82 transitions, 167 flow. Second operand 3 states and 169 transitions. [2024-11-19 09:38:14,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 74 transitions, 215 flow [2024-11-19 09:38:14,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 74 transitions, 214 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:14,570 INFO L231 Difference]: Finished difference. Result has 79 places, 74 transitions, 158 flow [2024-11-19 09:38:14,571 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=79, PETRI_TRANSITIONS=74} [2024-11-19 09:38:14,575 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -7 predicate places. [2024-11-19 09:38:14,575 INFO L471 AbstractCegarLoop]: Abstraction has has 79 places, 74 transitions, 158 flow [2024-11-19 09:38:14,576 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 43.666666666666664) internal successors, (131), 3 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:14,576 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:14,576 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-19 09:38:14,580 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:14,777 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:14,777 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:14,778 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:14,778 INFO L85 PathProgramCache]: Analyzing trace with hash 11349, now seen corresponding path program 1 times [2024-11-19 09:38:14,778 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:14,779 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [887572166] [2024-11-19 09:38:14,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:14,779 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:14,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:14,781 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:14,782 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:38:14,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:14,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:38:14,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:14,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:14,885 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:14,885 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:14,885 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:14,885 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [887572166] [2024-11-19 09:38:14,885 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [887572166] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:14,886 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:14,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:38:14,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299570142] [2024-11-19 09:38:14,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:14,887 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:14,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:14,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:14,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:15,003 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 47 out of 83 [2024-11-19 09:38:15,004 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 74 transitions, 158 flow. Second operand has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:15,004 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:15,004 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 47 of 83 [2024-11-19 09:38:15,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:15,151 INFO L124 PetriNetUnfolderBase]: 99/362 cut-off events. [2024-11-19 09:38:15,151 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:38:15,153 INFO L83 FinitePrefix]: Finished finitePrefix Result has 597 conditions, 362 events. 99/362 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1810 event pairs, 99 based on Foata normal form. 6/311 useless extension candidates. Maximal degree in co-relation 572. Up to 223 conditions per place. [2024-11-19 09:38:15,156 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 24 selfloop transitions, 4 changer transitions 0/66 dead transitions. [2024-11-19 09:38:15,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 66 transitions, 198 flow [2024-11-19 09:38:15,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:15,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:15,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2024-11-19 09:38:15,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7108433734939759 [2024-11-19 09:38:15,158 INFO L175 Difference]: Start difference. First operand has 79 places, 74 transitions, 158 flow. Second operand 3 states and 177 transitions. [2024-11-19 09:38:15,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 66 transitions, 198 flow [2024-11-19 09:38:15,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 66 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:15,159 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 142 flow [2024-11-19 09:38:15,160 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=142, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2024-11-19 09:38:15,161 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -15 predicate places. [2024-11-19 09:38:15,161 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 142 flow [2024-11-19 09:38:15,161 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:15,161 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:15,162 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:38:15,165 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:15,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:15,364 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:15,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:15,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025205, now seen corresponding path program 1 times [2024-11-19 09:38:15,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:15,366 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382947849] [2024-11-19 09:38:15,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:15,366 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:15,366 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:15,368 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:15,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:38:15,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:15,452 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:38:15,452 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:15,459 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:15,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:15,470 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:15,470 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:15,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382947849] [2024-11-19 09:38:15,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382947849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:15,470 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:15,470 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:15,470 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987338478] [2024-11-19 09:38:15,471 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:15,471 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:15,471 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:15,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:15,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:15,543 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-11-19 09:38:15,543 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 142 flow. Second operand has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:15,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:15,544 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-11-19 09:38:15,544 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:15,634 INFO L124 PetriNetUnfolderBase]: 110/392 cut-off events. [2024-11-19 09:38:15,634 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:38:15,635 INFO L83 FinitePrefix]: Finished finitePrefix Result has 650 conditions, 392 events. 110/392 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1994 event pairs, 110 based on Foata normal form. 1/338 useless extension candidates. Maximal degree in co-relation 626. Up to 248 conditions per place. [2024-11-19 09:38:15,636 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/63 dead transitions. [2024-11-19 09:38:15,636 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 63 transitions, 194 flow [2024-11-19 09:38:15,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:15,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:15,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-11-19 09:38:15,637 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2024-11-19 09:38:15,637 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 142 flow. Second operand 3 states and 185 transitions. [2024-11-19 09:38:15,638 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 63 transitions, 194 flow [2024-11-19 09:38:15,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 63 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:15,639 INFO L231 Difference]: Finished difference. Result has 68 places, 63 transitions, 130 flow [2024-11-19 09:38:15,639 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=68, PETRI_TRANSITIONS=63} [2024-11-19 09:38:15,639 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -18 predicate places. [2024-11-19 09:38:15,639 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 63 transitions, 130 flow [2024-11-19 09:38:15,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:15,640 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:15,640 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:38:15,643 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:15,843 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:15,843 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:15,844 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:15,844 INFO L85 PathProgramCache]: Analyzing trace with hash 1900025206, now seen corresponding path program 1 times [2024-11-19 09:38:15,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:15,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1030186947] [2024-11-19 09:38:15,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:15,844 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:15,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:15,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:15,847 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:38:15,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:15,934 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:38:15,935 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:15,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:15,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:15,969 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:15,969 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:15,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1030186947] [2024-11-19 09:38:15,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1030186947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:15,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:15,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:15,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1837991373] [2024-11-19 09:38:15,970 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:15,970 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:15,971 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:15,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:15,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:16,065 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-11-19 09:38:16,065 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 63 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:16,065 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:16,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-11-19 09:38:16,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:16,164 INFO L124 PetriNetUnfolderBase]: 99/352 cut-off events. [2024-11-19 09:38:16,165 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:38:16,165 INFO L83 FinitePrefix]: Finished finitePrefix Result has 584 conditions, 352 events. 99/352 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 1744 event pairs, 99 based on Foata normal form. 11/312 useless extension candidates. Maximal degree in co-relation 575. Up to 225 conditions per place. [2024-11-19 09:38:16,166 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/60 dead transitions. [2024-11-19 09:38:16,166 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 60 transitions, 180 flow [2024-11-19 09:38:16,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:16,169 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:16,170 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-19 09:38:16,170 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2024-11-19 09:38:16,170 INFO L175 Difference]: Start difference. First operand has 68 places, 63 transitions, 130 flow. Second operand 3 states and 187 transitions. [2024-11-19 09:38:16,170 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 60 transitions, 180 flow [2024-11-19 09:38:16,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 60 transitions, 179 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:16,171 INFO L231 Difference]: Finished difference. Result has 66 places, 60 transitions, 125 flow [2024-11-19 09:38:16,172 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=125, PETRI_PLACES=66, PETRI_TRANSITIONS=60} [2024-11-19 09:38:16,172 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-11-19 09:38:16,172 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 60 transitions, 125 flow [2024-11-19 09:38:16,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:16,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:16,172 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:16,176 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-19 09:38:16,373 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:16,373 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:16,374 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:16,374 INFO L85 PathProgramCache]: Analyzing trace with hash 147380253, now seen corresponding path program 1 times [2024-11-19 09:38:16,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:16,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [318553320] [2024-11-19 09:38:16,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:16,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:16,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:16,377 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:16,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:38:16,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:16,505 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:38:16,506 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:16,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:16,542 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:38:16,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:38:16,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:16,555 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:16,555 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:16,555 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [318553320] [2024-11-19 09:38:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [318553320] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:16,555 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:16,555 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:16,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534914416] [2024-11-19 09:38:16,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:16,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:16,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:16,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:16,556 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:16,641 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 51 out of 83 [2024-11-19 09:38:16,641 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 60 transitions, 125 flow. Second operand has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:16,641 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:16,641 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 51 of 83 [2024-11-19 09:38:16,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:16,737 INFO L124 PetriNetUnfolderBase]: 110/357 cut-off events. [2024-11-19 09:38:16,737 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:38:16,738 INFO L83 FinitePrefix]: Finished finitePrefix Result has 613 conditions, 357 events. 110/357 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1702 event pairs, 110 based on Foata normal form. 0/327 useless extension candidates. Maximal degree in co-relation 603. Up to 246 conditions per place. [2024-11-19 09:38:16,739 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 28 selfloop transitions, 1 changer transitions 0/57 dead transitions. [2024-11-19 09:38:16,739 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 57 transitions, 177 flow [2024-11-19 09:38:16,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:16,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:16,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-11-19 09:38:16,741 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7429718875502008 [2024-11-19 09:38:16,741 INFO L175 Difference]: Start difference. First operand has 66 places, 60 transitions, 125 flow. Second operand 3 states and 185 transitions. [2024-11-19 09:38:16,741 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 57 transitions, 177 flow [2024-11-19 09:38:16,741 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 176 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:16,744 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 120 flow [2024-11-19 09:38:16,744 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-19 09:38:16,744 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -22 predicate places. [2024-11-19 09:38:16,744 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 120 flow [2024-11-19 09:38:16,745 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:16,745 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:16,745 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:16,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:16,945 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:16,946 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:16,946 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:16,946 INFO L85 PathProgramCache]: Analyzing trace with hash 147380254, now seen corresponding path program 1 times [2024-11-19 09:38:16,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:16,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [75149955] [2024-11-19 09:38:16,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:16,950 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:16,950 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:16,951 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:16,952 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:38:17,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:17,080 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-19 09:38:17,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:17,094 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:17,128 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 09:38:17,128 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 09:38:17,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:17,154 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:17,154 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:17,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [75149955] [2024-11-19 09:38:17,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [75149955] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:17,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:17,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:38:17,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578311261] [2024-11-19 09:38:17,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:17,155 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:17,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:17,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:17,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:17,255 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 83 [2024-11-19 09:38:17,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:17,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:17,256 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 83 [2024-11-19 09:38:17,256 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:17,353 INFO L124 PetriNetUnfolderBase]: 99/326 cut-off events. [2024-11-19 09:38:17,354 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:17,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 560 conditions, 326 events. 99/326 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1516 event pairs, 99 based on Foata normal form. 12/308 useless extension candidates. Maximal degree in co-relation 550. Up to 223 conditions per place. [2024-11-19 09:38:17,355 INFO L140 encePairwiseOnDemand]: 79/83 looper letters, 27 selfloop transitions, 1 changer transitions 0/54 dead transitions. [2024-11-19 09:38:17,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 54 transitions, 170 flow [2024-11-19 09:38:17,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:17,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2024-11-19 09:38:17,356 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.751004016064257 [2024-11-19 09:38:17,356 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 120 flow. Second operand 3 states and 187 transitions. [2024-11-19 09:38:17,356 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 54 transitions, 170 flow [2024-11-19 09:38:17,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 54 transitions, 169 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:17,357 INFO L231 Difference]: Finished difference. Result has 62 places, 54 transitions, 115 flow [2024-11-19 09:38:17,357 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=113, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=115, PETRI_PLACES=62, PETRI_TRANSITIONS=54} [2024-11-19 09:38:17,358 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -24 predicate places. [2024-11-19 09:38:17,358 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 54 transitions, 115 flow [2024-11-19 09:38:17,358 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 54.333333333333336) internal successors, (163), 3 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:17,358 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:17,358 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:17,363 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-19 09:38:17,558 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:17,559 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:17,559 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:17,559 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971961, now seen corresponding path program 1 times [2024-11-19 09:38:17,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:17,560 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108994560] [2024-11-19 09:38:17,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:17,560 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:17,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:17,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:17,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:38:17,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:17,735 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 09:38:17,738 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:17,757 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:38:17,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-19 09:38:17,815 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-19 09:38:17,815 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-19 09:38:17,976 INFO L349 Elim1Store]: treesize reduction 110, result has 29.5 percent of original size [2024-11-19 09:38:17,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 82 [2024-11-19 09:38:18,020 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:18,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:18,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:18,229 INFO L349 Elim1Store]: treesize reduction 142, result has 28.6 percent of original size [2024-11-19 09:38:18,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 60 treesize of output 101 [2024-11-19 09:38:18,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-11-19 09:38:18,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-11-19 09:38:18,788 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 09:38:18,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 187 treesize of output 177 [2024-11-19 09:38:20,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:20,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 274 treesize of output 210 [2024-11-19 09:38:20,797 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:20,797 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:20,798 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:20,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108994560] [2024-11-19 09:38:20,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108994560] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:20,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:20,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:20,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814579966] [2024-11-19 09:38:20,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:20,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:20,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:20,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:20,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:26,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 09:38:26,199 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2024-11-19 09:38:26,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 54 transitions, 115 flow. Second operand has 9 states, 9 states have (on average 32.666666666666664) internal successors, (294), 9 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:26,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:26,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2024-11-19 09:38:26,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:27,294 INFO L124 PetriNetUnfolderBase]: 140/463 cut-off events. [2024-11-19 09:38:27,295 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:38:27,296 INFO L83 FinitePrefix]: Finished finitePrefix Result has 788 conditions, 463 events. 140/463 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 25. Compared 2415 event pairs, 14 based on Foata normal form. 0/399 useless extension candidates. Maximal degree in co-relation 777. Up to 204 conditions per place. [2024-11-19 09:38:27,297 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 57 selfloop transitions, 7 changer transitions 0/80 dead transitions. [2024-11-19 09:38:27,298 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 80 transitions, 295 flow [2024-11-19 09:38:27,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:38:27,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:38:27,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 314 transitions. [2024-11-19 09:38:27,299 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47289156626506024 [2024-11-19 09:38:27,299 INFO L175 Difference]: Start difference. First operand has 62 places, 54 transitions, 115 flow. Second operand 8 states and 314 transitions. [2024-11-19 09:38:27,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 80 transitions, 295 flow [2024-11-19 09:38:27,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 80 transitions, 294 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:27,301 INFO L231 Difference]: Finished difference. Result has 66 places, 52 transitions, 124 flow [2024-11-19 09:38:27,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=124, PETRI_PLACES=66, PETRI_TRANSITIONS=52} [2024-11-19 09:38:27,302 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-11-19 09:38:27,303 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 52 transitions, 124 flow [2024-11-19 09:38:27,303 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 32.666666666666664) internal successors, (294), 9 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:27,303 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:27,303 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:27,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:38:27,503 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:27,504 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:27,504 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:27,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1015971960, now seen corresponding path program 1 times [2024-11-19 09:38:27,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:27,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [474954509] [2024-11-19 09:38:27,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:27,505 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:27,505 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:27,507 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:27,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:38:27,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:27,719 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 09:38:27,722 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:27,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:27,737 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:27,775 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:38:27,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:38:27,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:38:27,866 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-11-19 09:38:27,867 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-11-19 09:38:27,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:27,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2024-11-19 09:38:27,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:27,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2024-11-19 09:38:27,995 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:28,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2024-11-19 09:38:28,049 INFO L349 Elim1Store]: treesize reduction 46, result has 27.0 percent of original size [2024-11-19 09:38:28,049 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:38:28,086 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-11-19 09:38:28,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-19 09:38:28,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:28,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:28,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:28,206 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:28,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:28,300 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:28,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:28,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-19 09:38:28,546 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:38:28,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:28,591 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:28,591 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:28,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [474954509] [2024-11-19 09:38:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [474954509] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:28,591 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:28,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:28,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [441292774] [2024-11-19 09:38:28,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:28,591 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:28,592 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:28,592 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:29,912 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 83 [2024-11-19 09:38:29,912 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 52 transitions, 124 flow. Second operand has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:29,912 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:29,912 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 83 [2024-11-19 09:38:29,912 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:30,872 INFO L124 PetriNetUnfolderBase]: 150/395 cut-off events. [2024-11-19 09:38:30,873 INFO L125 PetriNetUnfolderBase]: For 29/29 co-relation queries the response was YES. [2024-11-19 09:38:30,873 INFO L83 FinitePrefix]: Finished finitePrefix Result has 778 conditions, 395 events. 150/395 cut-off events. For 29/29 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1782 event pairs, 2 based on Foata normal form. 16/360 useless extension candidates. Maximal degree in co-relation 765. Up to 183 conditions per place. [2024-11-19 09:38:30,874 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 65 selfloop transitions, 12 changer transitions 0/90 dead transitions. [2024-11-19 09:38:30,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 90 transitions, 358 flow [2024-11-19 09:38:30,875 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:38:30,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:38:30,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 381 transitions. [2024-11-19 09:38:30,876 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.45903614457831327 [2024-11-19 09:38:30,876 INFO L175 Difference]: Start difference. First operand has 66 places, 52 transitions, 124 flow. Second operand 10 states and 381 transitions. [2024-11-19 09:38:30,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 90 transitions, 358 flow [2024-11-19 09:38:30,877 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 90 transitions, 340 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-19 09:38:30,877 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 138 flow [2024-11-19 09:38:30,878 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=138, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2024-11-19 09:38:30,878 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -20 predicate places. [2024-11-19 09:38:30,878 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 138 flow [2024-11-19 09:38:30,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 31.666666666666668) internal successors, (285), 9 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:30,878 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:30,878 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:30,886 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-19 09:38:31,079 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:31,079 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:31,079 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:31,080 INFO L85 PathProgramCache]: Analyzing trace with hash -1049749605, now seen corresponding path program 1 times [2024-11-19 09:38:31,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:31,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508241323] [2024-11-19 09:38:31,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:31,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:31,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:31,081 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:31,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:38:31,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:31,267 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-19 09:38:31,270 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:31,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:31,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:31,304 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 09:38:31,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 09:38:31,323 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:38:31,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:38:31,372 INFO L349 Elim1Store]: treesize reduction 33, result has 25.0 percent of original size [2024-11-19 09:38:31,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 20 [2024-11-19 09:38:31,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:31,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:31,415 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-11-19 09:38:31,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-11-19 09:38:31,473 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2024-11-19 09:38:31,487 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:31,512 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:31,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 42 [2024-11-19 09:38:31,543 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-11-19 09:38:31,543 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-19 09:38:31,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 28 [2024-11-19 09:38:31,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:31,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:31,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:31,672 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:31,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 39 [2024-11-19 09:38:31,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:31,985 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 21 [2024-11-19 09:38:31,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:38:32,032 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:32,032 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:32,032 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:32,032 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508241323] [2024-11-19 09:38:32,033 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508241323] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:32,033 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:32,033 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:32,033 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592666928] [2024-11-19 09:38:32,033 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:32,033 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:32,033 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:32,034 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:32,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:33,296 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-11-19 09:38:33,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:33,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:33,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-11-19 09:38:33,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:34,279 INFO L124 PetriNetUnfolderBase]: 163/515 cut-off events. [2024-11-19 09:38:34,279 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 09:38:34,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 934 conditions, 515 events. 163/515 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2774 event pairs, 4 based on Foata normal form. 0/436 useless extension candidates. Maximal degree in co-relation 921. Up to 184 conditions per place. [2024-11-19 09:38:34,281 INFO L140 encePairwiseOnDemand]: 73/83 looper letters, 67 selfloop transitions, 16 changer transitions 0/98 dead transitions. [2024-11-19 09:38:34,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 98 transitions, 396 flow [2024-11-19 09:38:34,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 09:38:34,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2024-11-19 09:38:34,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 513 transitions. [2024-11-19 09:38:34,282 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47544022242817424 [2024-11-19 09:38:34,282 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 138 flow. Second operand 13 states and 513 transitions. [2024-11-19 09:38:34,282 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 98 transitions, 396 flow [2024-11-19 09:38:34,283 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 98 transitions, 385 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:34,285 INFO L231 Difference]: Finished difference. Result has 76 places, 60 transitions, 189 flow [2024-11-19 09:38:34,285 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=129, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=189, PETRI_PLACES=76, PETRI_TRANSITIONS=60} [2024-11-19 09:38:34,286 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -10 predicate places. [2024-11-19 09:38:34,286 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 60 transitions, 189 flow [2024-11-19 09:38:34,286 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:34,286 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:34,286 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:34,293 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-19 09:38:34,487 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:34,487 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:34,487 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:34,487 INFO L85 PathProgramCache]: Analyzing trace with hash -1049749606, now seen corresponding path program 1 times [2024-11-19 09:38:34,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:34,488 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1237063592] [2024-11-19 09:38:34,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:34,488 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:34,488 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:34,489 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:34,490 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:38:34,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:34,657 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-19 09:38:34,659 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:34,669 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:38:34,669 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-19 09:38:34,701 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-19 09:38:34,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-19 09:38:34,791 INFO L349 Elim1Store]: treesize reduction 116, result has 28.4 percent of original size [2024-11-19 09:38:34,792 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 52 treesize of output 75 [2024-11-19 09:38:34,821 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:34,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:34,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:34,942 INFO L349 Elim1Store]: treesize reduction 100, result has 35.9 percent of original size [2024-11-19 09:38:34,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 53 treesize of output 95 [2024-11-19 09:38:35,033 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-11-19 09:38:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 63 [2024-11-19 09:38:35,272 INFO L349 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2024-11-19 09:38:35,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 167 treesize of output 157 [2024-11-19 09:38:35,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:38:35,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 143 treesize of output 103 [2024-11-19 09:38:36,135 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:36,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:36,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:36,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1237063592] [2024-11-19 09:38:36,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1237063592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:36,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:36,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 09:38:36,136 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018841635] [2024-11-19 09:38:36,136 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:36,136 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:38:36,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:36,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:38:36,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:38:41,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-19 09:38:41,585 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 83 [2024-11-19 09:38:41,585 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 60 transitions, 189 flow. Second operand has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:41,585 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:41,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 83 [2024-11-19 09:38:41,586 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:42,880 INFO L124 PetriNetUnfolderBase]: 194/557 cut-off events. [2024-11-19 09:38:42,880 INFO L125 PetriNetUnfolderBase]: For 114/114 co-relation queries the response was YES. [2024-11-19 09:38:42,881 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1120 conditions, 557 events. 194/557 cut-off events. For 114/114 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 2928 event pairs, 20 based on Foata normal form. 12/513 useless extension candidates. Maximal degree in co-relation 1104. Up to 200 conditions per place. [2024-11-19 09:38:42,882 INFO L140 encePairwiseOnDemand]: 72/83 looper letters, 55 selfloop transitions, 16 changer transitions 0/86 dead transitions. [2024-11-19 09:38:42,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 86 transitions, 386 flow [2024-11-19 09:38:42,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-19 09:38:42,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-19 09:38:42,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 366 transitions. [2024-11-19 09:38:42,884 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4899598393574297 [2024-11-19 09:38:42,884 INFO L175 Difference]: Start difference. First operand has 76 places, 60 transitions, 189 flow. Second operand 9 states and 366 transitions. [2024-11-19 09:38:42,884 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 86 transitions, 386 flow [2024-11-19 09:38:42,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 86 transitions, 370 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:42,888 INFO L231 Difference]: Finished difference. Result has 81 places, 64 transitions, 243 flow [2024-11-19 09:38:42,888 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=243, PETRI_PLACES=81, PETRI_TRANSITIONS=64} [2024-11-19 09:38:42,889 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -5 predicate places. [2024-11-19 09:38:42,890 INFO L471 AbstractCegarLoop]: Abstraction has has 81 places, 64 transitions, 243 flow [2024-11-19 09:38:42,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 34.77777777777778) internal successors, (313), 9 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:42,890 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:42,891 INFO L204 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] [2024-11-19 09:38:42,899 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:43,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:43,091 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:43,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:43,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1978687744, now seen corresponding path program 1 times [2024-11-19 09:38:43,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:43,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1234558005] [2024-11-19 09:38:43,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:43,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:43,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:43,093 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:43,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-19 09:38:43,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:43,211 INFO L255 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:38:43,212 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:43,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 9 [2024-11-19 09:38:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:43,223 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:43,223 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:43,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1234558005] [2024-11-19 09:38:43,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1234558005] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:43,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:43,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:43,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2071052086] [2024-11-19 09:38:43,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:43,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:38:43,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:43,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:38:43,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:38:43,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 83 [2024-11-19 09:38:43,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 64 transitions, 243 flow. Second operand has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:43,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:43,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 83 [2024-11-19 09:38:43,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:43,372 INFO L124 PetriNetUnfolderBase]: 121/388 cut-off events. [2024-11-19 09:38:43,372 INFO L125 PetriNetUnfolderBase]: For 167/167 co-relation queries the response was YES. [2024-11-19 09:38:43,373 INFO L83 FinitePrefix]: Finished finitePrefix Result has 883 conditions, 388 events. 121/388 cut-off events. For 167/167 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1988 event pairs, 59 based on Foata normal form. 6/379 useless extension candidates. Maximal degree in co-relation 865. Up to 210 conditions per place. [2024-11-19 09:38:43,374 INFO L140 encePairwiseOnDemand]: 77/83 looper letters, 54 selfloop transitions, 6 changer transitions 0/83 dead transitions. [2024-11-19 09:38:43,374 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 83 transitions, 429 flow [2024-11-19 09:38:43,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:38:43,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:38:43,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 213 transitions. [2024-11-19 09:38:43,375 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.8554216867469879 [2024-11-19 09:38:43,376 INFO L175 Difference]: Start difference. First operand has 81 places, 64 transitions, 243 flow. Second operand 3 states and 213 transitions. [2024-11-19 09:38:43,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 83 transitions, 429 flow [2024-11-19 09:38:43,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 83 transitions, 407 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:43,378 INFO L231 Difference]: Finished difference. Result has 77 places, 65 transitions, 237 flow [2024-11-19 09:38:43,378 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=237, PETRI_PLACES=77, PETRI_TRANSITIONS=65} [2024-11-19 09:38:43,378 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -9 predicate places. [2024-11-19 09:38:43,378 INFO L471 AbstractCegarLoop]: Abstraction has has 77 places, 65 transitions, 237 flow [2024-11-19 09:38:43,379 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 59.666666666666664) internal successors, (179), 3 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:43,379 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:43,379 INFO L204 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] [2024-11-19 09:38:43,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:43,579 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:43,579 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:43,580 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:43,580 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413156, now seen corresponding path program 1 times [2024-11-19 09:38:43,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:43,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1336475413] [2024-11-19 09:38:43,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:43,580 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:43,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:43,581 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:43,582 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-19 09:38:43,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:43,711 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:38:43,713 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:43,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:43,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:43,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:43,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2024-11-19 09:38:43,785 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:43,785 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:43,785 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:43,785 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1336475413] [2024-11-19 09:38:43,785 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1336475413] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:43,785 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:43,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:43,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [521495069] [2024-11-19 09:38:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:43,786 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:38:43,786 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:43,786 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:38:43,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:38:43,893 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-11-19 09:38:43,893 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 65 transitions, 237 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:43,894 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:43,894 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-11-19 09:38:43,894 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:44,086 INFO L124 PetriNetUnfolderBase]: 157/491 cut-off events. [2024-11-19 09:38:44,086 INFO L125 PetriNetUnfolderBase]: For 193/193 co-relation queries the response was YES. [2024-11-19 09:38:44,087 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1165 conditions, 491 events. 157/491 cut-off events. For 193/193 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2698 event pairs, 30 based on Foata normal form. 10/480 useless extension candidates. Maximal degree in co-relation 1148. Up to 190 conditions per place. [2024-11-19 09:38:44,088 INFO L140 encePairwiseOnDemand]: 76/83 looper letters, 58 selfloop transitions, 13 changer transitions 0/88 dead transitions. [2024-11-19 09:38:44,088 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 88 transitions, 464 flow [2024-11-19 09:38:44,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:44,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:44,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 305 transitions. [2024-11-19 09:38:44,089 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7349397590361446 [2024-11-19 09:38:44,090 INFO L175 Difference]: Start difference. First operand has 77 places, 65 transitions, 237 flow. Second operand 5 states and 305 transitions. [2024-11-19 09:38:44,090 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 88 transitions, 464 flow [2024-11-19 09:38:44,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 88 transitions, 451 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:44,092 INFO L231 Difference]: Finished difference. Result has 82 places, 67 transitions, 290 flow [2024-11-19 09:38:44,092 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=231, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=290, PETRI_PLACES=82, PETRI_TRANSITIONS=67} [2024-11-19 09:38:44,092 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, -4 predicate places. [2024-11-19 09:38:44,093 INFO L471 AbstractCegarLoop]: Abstraction has has 82 places, 67 transitions, 290 flow [2024-11-19 09:38:44,093 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:44,093 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:44,093 INFO L204 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] [2024-11-19 09:38:44,098 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-19 09:38:44,293 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:44,294 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:44,294 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:44,294 INFO L85 PathProgramCache]: Analyzing trace with hash -2002413157, now seen corresponding path program 1 times [2024-11-19 09:38:44,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:44,294 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1597525829] [2024-11-19 09:38:44,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:44,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:44,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:44,296 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:44,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-19 09:38:44,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:44,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:38:44,416 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:44,418 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:44,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:44,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-19 09:38:44,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:44,448 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:44,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:44,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1597525829] [2024-11-19 09:38:44,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1597525829] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:44,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:44,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:38:44,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754732171] [2024-11-19 09:38:44,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:44,449 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:38:44,449 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:44,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:38:44,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:38:44,516 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 49 out of 83 [2024-11-19 09:38:44,516 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 67 transitions, 290 flow. Second operand has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:44,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:44,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 49 of 83 [2024-11-19 09:38:44,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:44,694 INFO L124 PetriNetUnfolderBase]: 157/484 cut-off events. [2024-11-19 09:38:44,695 INFO L125 PetriNetUnfolderBase]: For 334/334 co-relation queries the response was YES. [2024-11-19 09:38:44,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1236 conditions, 484 events. 157/484 cut-off events. For 334/334 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2640 event pairs, 64 based on Foata normal form. 10/473 useless extension candidates. Maximal degree in co-relation 1216. Up to 227 conditions per place. [2024-11-19 09:38:44,697 INFO L140 encePairwiseOnDemand]: 74/83 looper letters, 50 selfloop transitions, 18 changer transitions 0/85 dead transitions. [2024-11-19 09:38:44,697 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 85 transitions, 482 flow [2024-11-19 09:38:44,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:38:44,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:38:44,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 302 transitions. [2024-11-19 09:38:44,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.727710843373494 [2024-11-19 09:38:44,699 INFO L175 Difference]: Start difference. First operand has 82 places, 67 transitions, 290 flow. Second operand 5 states and 302 transitions. [2024-11-19 09:38:44,699 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 85 transitions, 482 flow [2024-11-19 09:38:44,700 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 85 transitions, 476 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:38:44,701 INFO L231 Difference]: Finished difference. Result has 88 places, 68 transitions, 362 flow [2024-11-19 09:38:44,701 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=362, PETRI_PLACES=88, PETRI_TRANSITIONS=68} [2024-11-19 09:38:44,702 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 2 predicate places. [2024-11-19 09:38:44,702 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 68 transitions, 362 flow [2024-11-19 09:38:44,702 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:44,702 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:44,702 INFO L204 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, 1] [2024-11-19 09:38:44,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:44,903 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:44,903 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:44,903 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:44,903 INFO L85 PathProgramCache]: Analyzing trace with hash -463376632, now seen corresponding path program 1 times [2024-11-19 09:38:44,903 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:44,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1211895693] [2024-11-19 09:38:44,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:44,904 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:44,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:44,906 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:44,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-19 09:38:45,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:45,128 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-19 09:38:45,131 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:45,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:45,155 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:38:45,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:38:45,186 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:45,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:45,217 INFO L349 Elim1Store]: treesize reduction 62, result has 36.1 percent of original size [2024-11-19 09:38:45,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 55 [2024-11-19 09:38:45,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:45,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-19 09:38:45,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:45,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 33 [2024-11-19 09:38:45,318 INFO L349 Elim1Store]: treesize reduction 18, result has 51.4 percent of original size [2024-11-19 09:38:45,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 33 treesize of output 37 [2024-11-19 09:38:45,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-19 09:38:45,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:45,399 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-19 09:38:45,409 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:45,436 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-19 09:38:45,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:45,548 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:38:45,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2024-11-19 09:38:45,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2024-11-19 09:38:45,596 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2024-11-19 09:38:45,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:38:45,613 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:45,613 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:45,614 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:45,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1211895693] [2024-11-19 09:38:45,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1211895693] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:45,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:45,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 09:38:45,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1288145262] [2024-11-19 09:38:45,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:45,614 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 09:38:45,614 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:45,614 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 09:38:45,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-11-19 09:38:46,402 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 83 [2024-11-19 09:38:46,403 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 68 transitions, 362 flow. Second operand has 12 states, 12 states have (on average 33.75) internal successors, (405), 12 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:46,403 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:46,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 83 [2024-11-19 09:38:46,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:47,161 INFO L124 PetriNetUnfolderBase]: 185/521 cut-off events. [2024-11-19 09:38:47,161 INFO L125 PetriNetUnfolderBase]: For 872/872 co-relation queries the response was YES. [2024-11-19 09:38:47,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1546 conditions, 521 events. 185/521 cut-off events. For 872/872 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2813 event pairs, 27 based on Foata normal form. 6/510 useless extension candidates. Maximal degree in co-relation 1522. Up to 135 conditions per place. [2024-11-19 09:38:47,164 INFO L140 encePairwiseOnDemand]: 71/83 looper letters, 78 selfloop transitions, 29 changer transitions 3/123 dead transitions. [2024-11-19 09:38:47,164 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 123 transitions, 835 flow [2024-11-19 09:38:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:38:47,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:38:47,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 538 transitions. [2024-11-19 09:38:47,166 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4629948364888124 [2024-11-19 09:38:47,166 INFO L175 Difference]: Start difference. First operand has 88 places, 68 transitions, 362 flow. Second operand 14 states and 538 transitions. [2024-11-19 09:38:47,166 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 123 transitions, 835 flow [2024-11-19 09:38:47,168 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 123 transitions, 809 flow, removed 5 selfloop flow, removed 2 redundant places. [2024-11-19 09:38:47,171 INFO L231 Difference]: Finished difference. Result has 101 places, 79 transitions, 488 flow [2024-11-19 09:38:47,171 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=488, PETRI_PLACES=101, PETRI_TRANSITIONS=79} [2024-11-19 09:38:47,171 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 15 predicate places. [2024-11-19 09:38:47,172 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 79 transitions, 488 flow [2024-11-19 09:38:47,172 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 33.75) internal successors, (405), 12 states have internal predecessors, (405), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:47,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:47,172 INFO L204 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, 1] [2024-11-19 09:38:47,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2024-11-19 09:38:47,372 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:47,373 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:47,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:47,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1249020613, now seen corresponding path program 1 times [2024-11-19 09:38:47,374 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:47,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1243849010] [2024-11-19 09:38:47,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:47,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:47,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:47,376 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:47,377 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-19 09:38:47,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:47,591 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 09:38:47,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:47,614 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2024-11-19 09:38:47,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2024-11-19 09:38:47,651 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2024-11-19 09:38:47,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2024-11-19 09:38:47,746 INFO L349 Elim1Store]: treesize reduction 110, result has 29.5 percent of original size [2024-11-19 09:38:47,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 50 treesize of output 82 [2024-11-19 09:38:47,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-19 09:38:47,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:47,854 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 52 [2024-11-19 09:38:47,896 INFO L349 Elim1Store]: treesize reduction 28, result has 66.3 percent of original size [2024-11-19 09:38:47,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 3 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 7 case distinctions, treesize of input 54 treesize of output 92 [2024-11-19 09:38:47,959 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-19 09:38:47,979 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 30 [2024-11-19 09:38:47,999 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2024-11-19 09:38:48,040 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2024-11-19 09:38:48,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2024-11-19 09:38:48,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2024-11-19 09:38:48,086 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:48,086 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:48,086 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:48,086 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1243849010] [2024-11-19 09:38:48,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1243849010] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:48,086 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:48,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:38:48,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387265895] [2024-11-19 09:38:48,086 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:48,087 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:38:48,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:48,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:38:48,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:38:48,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-11-19 09:38:48,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 79 transitions, 488 flow. Second operand has 11 states, 11 states have (on average 35.90909090909091) internal successors, (395), 11 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:48,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:48,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-11-19 09:38:48,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:49,296 INFO L124 PetriNetUnfolderBase]: 171/504 cut-off events. [2024-11-19 09:38:49,296 INFO L125 PetriNetUnfolderBase]: For 973/973 co-relation queries the response was YES. [2024-11-19 09:38:49,298 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1570 conditions, 504 events. 171/504 cut-off events. For 973/973 co-relation queries the response was YES. Maximal size of possible extension queue 39. Compared 2739 event pairs, 46 based on Foata normal form. 6/491 useless extension candidates. Maximal degree in co-relation 1541. Up to 141 conditions per place. [2024-11-19 09:38:49,299 INFO L140 encePairwiseOnDemand]: 69/83 looper letters, 51 selfloop transitions, 39 changer transitions 3/108 dead transitions. [2024-11-19 09:38:49,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 108 transitions, 804 flow [2024-11-19 09:38:49,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 09:38:49,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-19 09:38:49,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 441 transitions. [2024-11-19 09:38:49,301 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4830230010952902 [2024-11-19 09:38:49,301 INFO L175 Difference]: Start difference. First operand has 101 places, 79 transitions, 488 flow. Second operand 11 states and 441 transitions. [2024-11-19 09:38:49,301 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 108 transitions, 804 flow [2024-11-19 09:38:49,304 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 108 transitions, 780 flow, removed 2 selfloop flow, removed 6 redundant places. [2024-11-19 09:38:49,305 INFO L231 Difference]: Finished difference. Result has 107 places, 85 transitions, 616 flow [2024-11-19 09:38:49,305 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=33, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=616, PETRI_PLACES=107, PETRI_TRANSITIONS=85} [2024-11-19 09:38:49,305 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 21 predicate places. [2024-11-19 09:38:49,306 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 85 transitions, 616 flow [2024-11-19 09:38:49,306 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.90909090909091) internal successors, (395), 11 states have internal predecessors, (395), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:49,306 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:49,306 INFO L204 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, 1] [2024-11-19 09:38:49,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-19 09:38:49,506 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:49,507 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:49,507 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:49,507 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892833, now seen corresponding path program 1 times [2024-11-19 09:38:49,507 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:49,507 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [772278595] [2024-11-19 09:38:49,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:49,508 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:49,508 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:49,509 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:49,509 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-19 09:38:49,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:49,732 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-19 09:38:49,735 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:49,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:49,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:49,773 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-19 09:38:49,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 09:38:49,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:49,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:49,837 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:38:49,837 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:38:49,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:49,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:49,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:38:49,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:50,030 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2024-11-19 09:38:50,087 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-19 09:38:50,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 09:38:50,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:50,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:50,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:50,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [772278595] [2024-11-19 09:38:50,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [772278595] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:50,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:50,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:38:50,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1173265679] [2024-11-19 09:38:50,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:50,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:38:50,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:50,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:38:50,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:38:51,396 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 83 [2024-11-19 09:38:51,397 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 85 transitions, 616 flow. Second operand has 11 states, 11 states have (on average 35.81818181818182) internal successors, (394), 11 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:51,397 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:51,397 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 83 [2024-11-19 09:38:51,397 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:52,400 INFO L124 PetriNetUnfolderBase]: 183/539 cut-off events. [2024-11-19 09:38:52,401 INFO L125 PetriNetUnfolderBase]: For 1349/1349 co-relation queries the response was YES. [2024-11-19 09:38:52,402 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1821 conditions, 539 events. 183/539 cut-off events. For 1349/1349 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 2931 event pairs, 9 based on Foata normal form. 22/559 useless extension candidates. Maximal degree in co-relation 1788. Up to 133 conditions per place. [2024-11-19 09:38:52,404 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 88 selfloop transitions, 35 changer transitions 0/135 dead transitions. [2024-11-19 09:38:52,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 135 transitions, 1106 flow [2024-11-19 09:38:52,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:38:52,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 09:38:52,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 752 transitions. [2024-11-19 09:38:52,408 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.476854787571338 [2024-11-19 09:38:52,408 INFO L175 Difference]: Start difference. First operand has 107 places, 85 transitions, 616 flow. Second operand 19 states and 752 transitions. [2024-11-19 09:38:52,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 135 transitions, 1106 flow [2024-11-19 09:38:52,412 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 135 transitions, 1094 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 09:38:52,415 INFO L231 Difference]: Finished difference. Result has 119 places, 88 transitions, 717 flow [2024-11-19 09:38:52,415 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=30, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=717, PETRI_PLACES=119, PETRI_TRANSITIONS=88} [2024-11-19 09:38:52,416 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 33 predicate places. [2024-11-19 09:38:52,417 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 88 transitions, 717 flow [2024-11-19 09:38:52,417 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 35.81818181818182) internal successors, (394), 11 states have internal predecessors, (394), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:52,417 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:52,418 INFO L204 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, 1] [2024-11-19 09:38:52,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-19 09:38:52,618 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:52,618 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:52,619 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:52,619 INFO L85 PathProgramCache]: Analyzing trace with hash -1669892832, now seen corresponding path program 1 times [2024-11-19 09:38:52,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:52,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [422998030] [2024-11-19 09:38:52,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:52,619 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:52,619 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:52,620 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:52,622 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2024-11-19 09:38:52,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:38:52,860 INFO L255 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-19 09:38:52,863 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:38:52,872 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:38:52,898 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2024-11-19 09:38:52,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2024-11-19 09:38:52,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-11-19 09:38:52,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:52,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:52,968 INFO L349 Elim1Store]: treesize reduction 12, result has 42.9 percent of original size [2024-11-19 09:38:52,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-19 09:38:52,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:38:53,021 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:53,041 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:38:53,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:38:53,095 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2024-11-19 09:38:53,298 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 21 [2024-11-19 09:38:53,323 INFO L349 Elim1Store]: treesize reduction 25, result has 43.2 percent of original size [2024-11-19 09:38:53,324 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 33 [2024-11-19 09:38:53,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:38:53,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:38:53,406 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:38:53,407 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:38:53,407 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:38:53,407 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [422998030] [2024-11-19 09:38:53,407 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [422998030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:38:53,407 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:38:53,407 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-19 09:38:53,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178451989] [2024-11-19 09:38:53,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:38:53,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:38:53,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:38:53,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:38:53,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:38:54,408 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 83 [2024-11-19 09:38:54,409 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 88 transitions, 717 flow. Second operand has 11 states, 11 states have (on average 32.81818181818182) internal successors, (361), 11 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:54,409 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:38:54,409 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 83 [2024-11-19 09:38:54,409 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:38:55,414 INFO L124 PetriNetUnfolderBase]: 210/581 cut-off events. [2024-11-19 09:38:55,414 INFO L125 PetriNetUnfolderBase]: For 1752/1752 co-relation queries the response was YES. [2024-11-19 09:38:55,415 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2135 conditions, 581 events. 210/581 cut-off events. For 1752/1752 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 3161 event pairs, 44 based on Foata normal form. 27/606 useless extension candidates. Maximal degree in co-relation 2101. Up to 175 conditions per place. [2024-11-19 09:38:55,417 INFO L140 encePairwiseOnDemand]: 68/83 looper letters, 81 selfloop transitions, 36 changer transitions 17/144 dead transitions. [2024-11-19 09:38:55,417 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 135 places, 144 transitions, 1275 flow [2024-11-19 09:38:55,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-19 09:38:55,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-19 09:38:55,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 696 transitions. [2024-11-19 09:38:55,419 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4413443246670894 [2024-11-19 09:38:55,419 INFO L175 Difference]: Start difference. First operand has 119 places, 88 transitions, 717 flow. Second operand 19 states and 696 transitions. [2024-11-19 09:38:55,419 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 135 places, 144 transitions, 1275 flow [2024-11-19 09:38:55,423 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 123 places, 144 transitions, 1223 flow, removed 0 selfloop flow, removed 12 redundant places. [2024-11-19 09:38:55,424 INFO L231 Difference]: Finished difference. Result has 123 places, 84 transitions, 689 flow [2024-11-19 09:38:55,424 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=83, PETRI_DIFFERENCE_MINUEND_FLOW=664, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=689, PETRI_PLACES=123, PETRI_TRANSITIONS=84} [2024-11-19 09:38:55,425 INFO L277 CegarLoopForPetriNet]: 86 programPoint places, 37 predicate places. [2024-11-19 09:38:55,425 INFO L471 AbstractCegarLoop]: Abstraction has has 123 places, 84 transitions, 689 flow [2024-11-19 09:38:55,425 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 32.81818181818182) internal successors, (361), 11 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:38:55,425 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:38:55,425 INFO L204 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, 1, 1, 1] [2024-11-19 09:38:55,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Ended with exit code 0 [2024-11-19 09:38:55,626 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:55,626 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 51 more)] === [2024-11-19 09:38:55,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:38:55,626 INFO L85 PathProgramCache]: Analyzing trace with hash -1089211100, now seen corresponding path program 1 times [2024-11-19 09:38:55,627 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:38:55,627 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2146354544] [2024-11-19 09:38:55,627 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:38:55,627 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:55,627 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:38:55,628 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:38:55,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2024-11-19 09:38:55,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:55,877 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:38:55,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:38:56,038 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-19 09:38:56,040 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:38:56,041 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK (53 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 54 remaining) [2024-11-19 09:38:56,042 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 54 remaining) [2024-11-19 09:38:56,043 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 54 remaining) [2024-11-19 09:38:56,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 54 remaining) [2024-11-19 09:38:56,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 54 remaining) [2024-11-19 09:38:56,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 54 remaining) [2024-11-19 09:38:56,044 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (24 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 54 remaining) [2024-11-19 09:38:56,045 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 54 remaining) [2024-11-19 09:38:56,046 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 54 remaining) [2024-11-19 09:38:56,054 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2024-11-19 09:38:56,246 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:38:56,247 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:38:56,284 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:38:56,284 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:38:56,287 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:38:56 BasicIcfg [2024-11-19 09:38:56,287 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:38:56,290 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:38:56,290 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:38:56,290 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:38:56,291 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:38:13" (3/4) ... [2024-11-19 09:38:56,292 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:38:56,293 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:38:56,293 INFO L158 Benchmark]: Toolchain (without parser) took 43993.25ms. Allocated memory was 62.9MB in the beginning and 276.8MB in the end (delta: 213.9MB). Free memory was 38.2MB in the beginning and 111.1MB in the end (delta: -72.9MB). Peak memory consumption was 140.4MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,293 INFO L158 Benchmark]: CDTParser took 1.38ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:56,293 INFO L158 Benchmark]: CACSL2BoogieTranslator took 590.38ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 38.0MB in the beginning and 55.9MB in the end (delta: -17.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,294 INFO L158 Benchmark]: Boogie Procedure Inliner took 45.16ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 52.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,294 INFO L158 Benchmark]: Boogie Preprocessor took 41.14ms. Allocated memory is still 86.0MB. Free memory was 52.9MB in the beginning and 49.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,294 INFO L158 Benchmark]: RCFGBuilder took 855.96ms. Allocated memory is still 86.0MB. Free memory was 49.6MB in the beginning and 31.8MB in the end (delta: 17.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,294 INFO L158 Benchmark]: TraceAbstraction took 42450.28ms. Allocated memory was 86.0MB in the beginning and 276.8MB in the end (delta: 190.8MB). Free memory was 31.3MB in the beginning and 111.1MB in the end (delta: -79.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. [2024-11-19 09:38:56,294 INFO L158 Benchmark]: Witness Printer took 2.68ms. Allocated memory is still 276.8MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:38:56,295 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.38ms. Allocated memory is still 62.9MB. Free memory was 39.4MB in the beginning and 39.3MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 590.38ms. Allocated memory was 62.9MB in the beginning and 86.0MB in the end (delta: 23.1MB). Free memory was 38.0MB in the beginning and 55.9MB in the end (delta: -17.9MB). Peak memory consumption was 24.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 45.16ms. Allocated memory is still 86.0MB. Free memory was 55.9MB in the beginning and 52.9MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.14ms. Allocated memory is still 86.0MB. Free memory was 52.9MB in the beginning and 49.6MB in the end (delta: 3.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 855.96ms. Allocated memory is still 86.0MB. Free memory was 49.6MB in the beginning and 31.8MB in the end (delta: 17.8MB). Peak memory consumption was 25.6MB. Max. memory is 16.1GB. * TraceAbstraction took 42450.28ms. Allocated memory was 86.0MB in the beginning and 276.8MB in the end (delta: 190.8MB). Free memory was 31.3MB in the beginning and 111.1MB in the end (delta: -79.7MB). Peak memory consumption was 111.1MB. Max. memory is 16.1GB. * Witness Printer took 2.68ms. Allocated memory is still 276.8MB. Free memory is still 111.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1242]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1242. Possible FailurePath: [L1223-L1226] 0 struct s { int datum; struct s *next; } *A, *B; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1231] 0 pthread_mutex_t A_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1232] 0 pthread_mutex_t B_mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1243] 0 pthread_t t1; [L1244] 0 struct s *p = malloc(sizeof(struct s)); [L1245] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={0:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1245] RET 0 init(p,9) [L1246] 0 A = malloc(sizeof(struct s)) [L1247] CALL 0 init(A,3) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={0:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1247] RET 0 init(A,3) [L1248] 0 A->next = p [L1249] 0 B = malloc(sizeof(struct s)) [L1250] CALL 0 init(B,5) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1250] RET 0 init(B,5) [L1251] 0 p = malloc(sizeof(struct s)) [L1252] CALL 0 init(p,9) [L1228] 0 p -> datum = x VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}] [L1229] 0 p -> next = ((void *)0) [L1252] RET 0 init(p,9) [L1253] 0 B->next = p [L1254] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}, \old(arg)={0:0}, p={1073741824:0}, t1=-1] [L1256] EXPR 0 A->next [L1256] 0 p = A->next [L1257] 0 p->datum [L1260] EXPR 0 B->next [L1260] 0 p = B->next [L1261] 0 p->datum [L1263] 0 return 0; VAL [A={-2147483647:0}, A_mutex={1:0}, B={-2147483648:0}, B_mutex={2:0}, \old(arg)={0:0}, \result=0, p={1073741824:0}, t1=-1] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1254]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 113 locations, 54 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 42.3s, OverallIterations: 18, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 26.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 2 mSolverCounterUnknown, 4221 SdHoareTripleChecker+Valid, 23.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 3273 mSDsluCounter, 1932 SdHoareTripleChecker+Invalid, 21.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1774 mSDsCounter, 280 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 9912 IncrementalHoareTripleChecker+Invalid, 10194 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 280 mSolverCounterUnsat, 158 mSDtfsCounter, 9912 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 320 GetRequests, 176 SyntacticMatches, 2 SemanticMatches, 142 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 353 ImplicationChecksByTransitivity, 4.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=717occurred in iteration=16, InterpolantAutomatonStates: 134, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 1.7s SatisfiabilityAnalysisTime, 8.6s InterpolantComputationTime, 297 NumberOfCodeBlocks, 297 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 254 ConstructedInterpolants, 38 QuantifiedInterpolants, 9153 SizeOfPredicates, 136 NumberOfNonLiveVariables, 3518 ConjunctsInSsa, 348 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:38:56,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample