./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d 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/weaver/popl20-prod-cons-eq.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --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 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 10:55:18,116 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:55:18,207 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:55:18,211 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:55:18,212 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:55:18,239 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:55:18,240 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:55:18,240 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:55:18,241 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:55:18,243 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:55:18,243 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:55:18,244 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:55:18,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:55:18,244 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:55:18,245 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:55:18,245 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:55:18,248 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:55:18,249 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:55:18,249 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:55:18,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:55:18,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:55:18,250 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:55:18,250 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:55:18,250 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:55:18,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:55:18,251 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:55:18,251 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:55:18,251 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:55:18,252 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:55:18,252 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:55:18,252 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:55:18,252 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:55:18,252 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:55:18,253 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:18,253 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:55:18,254 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:55:18,255 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:55:18,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:55:18,255 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:55:18,255 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:55:18,255 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:55:18,256 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:55:18,256 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 -> 3dfcb4860b3021904fb2e25e7c2a428c9bcb0d82c2290cad723458395a0647ea [2024-11-09 10:55:18,513 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:55:18,532 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:55:18,535 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:55:18,536 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:55:18,536 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:55:18,537 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-09 10:55:19,999 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:55:20,187 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:55:20,188 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-prod-cons-eq.wvr.c [2024-11-09 10:55:20,196 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81b63dc0/6a26bd0b711442499032f927d904f5a2/FLAG8f0be84fa [2024-11-09 10:55:20,208 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e81b63dc0/6a26bd0b711442499032f927d904f5a2 [2024-11-09 10:55:20,219 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:55:20,220 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:55:20,222 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:20,222 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:55:20,226 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:55:20,227 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,228 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@49a123a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20, skipping insertion in model container [2024-11-09 10:55:20,228 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,257 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:55:20,463 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:55:20,471 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:55:20,478 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:55:20,481 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:20,494 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:55:20,527 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:55:20,547 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:55:20,548 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20 WrapperNode [2024-11-09 10:55:20,548 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:55:20,549 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:20,549 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:55:20,549 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:55:20,556 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,575 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,617 INFO L138 Inliner]: procedures = 27, calls = 68, calls flagged for inlining = 29, calls inlined = 35, statements flattened = 407 [2024-11-09 10:55:20,618 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:55:20,619 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:55:20,619 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:55:20,619 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:55:20,631 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,638 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,663 INFO L175 MemorySlicer]: Split 24 memory accesses to 4 slices as follows [2, 3, 3, 16]. 67 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 6 writes are split as follows [0, 1, 1, 4]. [2024-11-09 10:55:20,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,683 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,690 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,697 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,699 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,709 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:55:20,710 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:55:20,710 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:55:20,710 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:55:20,711 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (1/1) ... [2024-11-09 10:55:20,717 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:55:20,731 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:20,752 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-09 10:55:20,755 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-09 10:55:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 10:55:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:55:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:55:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-09 10:55:20,804 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#3 [2024-11-09 10:55:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 10:55:20,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 10:55:20,806 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:55:20,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-09 10:55:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#3 [2024-11-09 10:55:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-09 10:55:20,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-09 10:55:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-09 10:55:20,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-09 10:55:20,808 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-09 10:55:20,808 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:55:20,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:55:20,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:55:20,816 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:55:21,022 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:55:21,024 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:55:21,757 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:55:21,758 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:55:22,494 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:55:22,494 INFO L316 CfgBuilder]: Removed 9 assume(true) statements. [2024-11-09 10:55:22,495 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:22 BoogieIcfgContainer [2024-11-09 10:55:22,495 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:55:22,498 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:55:22,498 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:55:22,502 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:55:22,503 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:55:20" (1/3) ... [2024-11-09 10:55:22,503 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1443f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:22, skipping insertion in model container [2024-11-09 10:55:22,504 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:55:20" (2/3) ... [2024-11-09 10:55:22,504 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1443f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:55:22, skipping insertion in model container [2024-11-09 10:55:22,506 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:55:22" (3/3) ... [2024-11-09 10:55:22,507 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons-eq.wvr.c [2024-11-09 10:55:22,526 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:55:22,526 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-09 10:55:22,526 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:55:22,700 INFO L143 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2024-11-09 10:55:22,740 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 106 places, 106 transitions, 233 flow [2024-11-09 10:55:22,785 INFO L124 PetriNetUnfolderBase]: 10/103 cut-off events. [2024-11-09 10:55:22,786 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:55:22,790 INFO L83 FinitePrefix]: Finished finitePrefix Result has 116 conditions, 103 events. 10/103 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 16. Compared 320 event pairs, 0 based on Foata normal form. 0/47 useless extension candidates. Maximal degree in co-relation 70. Up to 2 conditions per place. [2024-11-09 10:55:22,790 INFO L82 GeneralOperation]: Start removeDead. Operand has 106 places, 106 transitions, 233 flow [2024-11-09 10:55:22,794 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 102 places, 102 transitions, 222 flow [2024-11-09 10:55:22,802 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:55:22,808 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;@e2a46f0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:55:22,809 INFO L334 AbstractCegarLoop]: Starting to check reachability of 81 error locations. [2024-11-09 10:55:22,812 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:55:22,812 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-09 10:55:22,812 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-09 10:55:22,812 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:22,813 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:22,813 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:22,818 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:22,818 INFO L85 PathProgramCache]: Analyzing trace with hash 1328468, now seen corresponding path program 1 times [2024-11-09 10:55:22,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:22,826 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474987706] [2024-11-09 10:55:22,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:22,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:22,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:23,169 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-09 10:55:23,171 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:23,171 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474987706] [2024-11-09 10:55:23,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474987706] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:23,172 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:23,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-09 10:55:23,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1891516009] [2024-11-09 10:55:23,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:23,182 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:23,187 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:23,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:23,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:23,280 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:23,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 102 transitions, 222 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-09 10:55:23,283 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:23,283 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:23,285 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:24,836 INFO L124 PetriNetUnfolderBase]: 5713/11550 cut-off events. [2024-11-09 10:55:24,837 INFO L125 PetriNetUnfolderBase]: For 228/228 co-relation queries the response was YES. [2024-11-09 10:55:24,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19585 conditions, 11550 events. 5713/11550 cut-off events. For 228/228 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 114435 event pairs, 4115 based on Foata normal form. 1/6152 useless extension candidates. Maximal degree in co-relation 18897. Up to 7695 conditions per place. [2024-11-09 10:55:24,942 INFO L140 encePairwiseOnDemand]: 93/106 looper letters, 52 selfloop transitions, 4 changer transitions 0/92 dead transitions. [2024-11-09 10:55:24,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 92 transitions, 314 flow [2024-11-09 10:55:24,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:24,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:24,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-11-09 10:55:24,956 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5817610062893082 [2024-11-09 10:55:24,958 INFO L175 Difference]: Start difference. First operand has 102 places, 102 transitions, 222 flow. Second operand 3 states and 185 transitions. [2024-11-09 10:55:24,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 92 transitions, 314 flow [2024-11-09 10:55:24,969 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 92 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-09 10:55:24,972 INFO L231 Difference]: Finished difference. Result has 88 places, 92 transitions, 198 flow [2024-11-09 10:55:24,974 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=198, PETRI_PLACES=88, PETRI_TRANSITIONS=92} [2024-11-09 10:55:24,979 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -14 predicate places. [2024-11-09 10:55:24,979 INFO L471 AbstractCegarLoop]: Abstraction has has 88 places, 92 transitions, 198 flow [2024-11-09 10:55:24,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 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-09 10:55:24,980 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:24,980 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-09 10:55:24,981 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:55:24,981 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:24,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:24,983 INFO L85 PathProgramCache]: Analyzing trace with hash 1328469, now seen corresponding path program 1 times [2024-11-09 10:55:24,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:24,984 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1081196590] [2024-11-09 10:55:24,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:24,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:25,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:25,327 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-09 10:55:25,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:25,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1081196590] [2024-11-09 10:55:25,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1081196590] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:25,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:25,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:25,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209028699] [2024-11-09 10:55:25,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:25,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:25,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:25,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:25,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:25,405 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:25,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 92 transitions, 198 flow. Second operand has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 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-09 10:55:25,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:25,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:25,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:26,857 INFO L124 PetriNetUnfolderBase]: 5714/11553 cut-off events. [2024-11-09 10:55:26,858 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:55:26,871 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19394 conditions, 11553 events. 5714/11553 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 880. Compared 114491 event pairs, 4115 based on Foata normal form. 0/6152 useless extension candidates. Maximal degree in co-relation 19341. Up to 7712 conditions per place. [2024-11-09 10:55:26,927 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 59 selfloop transitions, 4 changer transitions 0/95 dead transitions. [2024-11-09 10:55:26,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 95 transitions, 330 flow [2024-11-09 10:55:26,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:26,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:26,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 224 transitions. [2024-11-09 10:55:26,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5283018867924528 [2024-11-09 10:55:26,930 INFO L175 Difference]: Start difference. First operand has 88 places, 92 transitions, 198 flow. Second operand 4 states and 224 transitions. [2024-11-09 10:55:26,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 95 transitions, 330 flow [2024-11-09 10:55:26,932 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 95 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:26,934 INFO L231 Difference]: Finished difference. Result has 91 places, 95 transitions, 217 flow [2024-11-09 10:55:26,934 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=217, PETRI_PLACES=91, PETRI_TRANSITIONS=95} [2024-11-09 10:55:26,935 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -11 predicate places. [2024-11-09 10:55:26,935 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 95 transitions, 217 flow [2024-11-09 10:55:26,935 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 40.75) internal successors, (163), 4 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-09 10:55:26,935 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:26,935 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-09 10:55:26,935 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:55:26,936 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:26,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:26,936 INFO L85 PathProgramCache]: Analyzing trace with hash 41184544, now seen corresponding path program 1 times [2024-11-09 10:55:26,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:26,936 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1968159906] [2024-11-09 10:55:26,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:26,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:26,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:27,167 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-09 10:55:27,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:27,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1968159906] [2024-11-09 10:55:27,170 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1968159906] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:27,171 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:27,171 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:27,171 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369467538] [2024-11-09 10:55:27,171 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:27,171 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:27,171 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:27,283 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:27,283 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 95 transitions, 217 flow. Second operand has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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-09 10:55:27,284 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:27,284 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:27,284 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:28,530 INFO L124 PetriNetUnfolderBase]: 5715/11556 cut-off events. [2024-11-09 10:55:28,530 INFO L125 PetriNetUnfolderBase]: For 48/48 co-relation queries the response was YES. [2024-11-09 10:55:28,545 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19409 conditions, 11556 events. 5715/11556 cut-off events. For 48/48 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 114613 event pairs, 4115 based on Foata normal form. 0/6152 useless extension candidates. Maximal degree in co-relation 19384. Up to 7711 conditions per place. [2024-11-09 10:55:28,594 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 59 selfloop transitions, 7 changer transitions 0/98 dead transitions. [2024-11-09 10:55:28,595 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 98 transitions, 355 flow [2024-11-09 10:55:28,595 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:28,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:28,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-11-09 10:55:28,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037735849056604 [2024-11-09 10:55:28,599 INFO L175 Difference]: Start difference. First operand has 91 places, 95 transitions, 217 flow. Second operand 5 states and 267 transitions. [2024-11-09 10:55:28,600 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 98 transitions, 355 flow [2024-11-09 10:55:28,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 98 transitions, 352 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:28,603 INFO L231 Difference]: Finished difference. Result has 96 places, 98 transitions, 251 flow [2024-11-09 10:55:28,605 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=251, PETRI_PLACES=96, PETRI_TRANSITIONS=98} [2024-11-09 10:55:28,605 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -6 predicate places. [2024-11-09 10:55:28,606 INFO L471 AbstractCegarLoop]: Abstraction has has 96 places, 98 transitions, 251 flow [2024-11-09 10:55:28,606 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 40.8) internal successors, (204), 5 states have internal predecessors, (204), 0 states have call successors, (0), 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-09 10:55:28,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:28,606 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:55:28,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:55:28,606 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:28,607 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:28,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1276722408, now seen corresponding path program 1 times [2024-11-09 10:55:28,608 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:28,608 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045830793] [2024-11-09 10:55:28,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:28,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:28,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:28,813 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-09 10:55:28,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045830793] [2024-11-09 10:55:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1045830793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:28,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [920711569] [2024-11-09 10:55:28,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:28,815 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:28,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:28,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:28,940 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:28,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 98 transitions, 251 flow. Second operand has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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-09 10:55:28,941 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:28,941 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:28,941 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:30,168 INFO L124 PetriNetUnfolderBase]: 5716/11559 cut-off events. [2024-11-09 10:55:30,168 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-09 10:55:30,191 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19431 conditions, 11559 events. 5716/11559 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 114426 event pairs, 4115 based on Foata normal form. 0/6156 useless extension candidates. Maximal degree in co-relation 19400. Up to 7714 conditions per place. [2024-11-09 10:55:30,353 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 60 selfloop transitions, 9 changer transitions 0/101 dead transitions. [2024-11-09 10:55:30,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 101 transitions, 395 flow [2024-11-09 10:55:30,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:30,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:30,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 267 transitions. [2024-11-09 10:55:30,355 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5037735849056604 [2024-11-09 10:55:30,355 INFO L175 Difference]: Start difference. First operand has 96 places, 98 transitions, 251 flow. Second operand 5 states and 267 transitions. [2024-11-09 10:55:30,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 101 transitions, 395 flow [2024-11-09 10:55:30,356 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 101 transitions, 394 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:30,358 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 293 flow [2024-11-09 10:55:30,359 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=250, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=293, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2024-11-09 10:55:30,359 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, -1 predicate places. [2024-11-09 10:55:30,360 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 293 flow [2024-11-09 10:55:30,360 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.0) internal successors, (205), 5 states have internal predecessors, (205), 0 states have call successors, (0), 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-09 10:55:30,360 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:30,360 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-09 10:55:30,360 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:55:30,361 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:30,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:30,361 INFO L85 PathProgramCache]: Analyzing trace with hash 1276703282, now seen corresponding path program 1 times [2024-11-09 10:55:30,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:30,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649423726] [2024-11-09 10:55:30,362 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,362 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:30,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:30,571 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:30,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:30,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649423726] [2024-11-09 10:55:30,572 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649423726] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:30,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [377491042] [2024-11-09 10:55:30,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:30,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:30,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:30,575 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:30,577 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:55:30,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:30,684 INFO L255 TraceCheckSpWp]: Trace formula consists of 109 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:55:30,688 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:30,750 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 8 treesize of output 1 [2024-11-09 10:55:30,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:30,869 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:30,947 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:30,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [377491042] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:30,948 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:30,948 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-09 10:55:30,949 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775884477] [2024-11-09 10:55:30,949 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:30,949 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 10:55:30,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:30,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 10:55:30,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2024-11-09 10:55:31,224 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:31,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 293 flow. Second operand has 11 states, 11 states have (on average 41.36363636363637) internal successors, (455), 11 states have internal predecessors, (455), 0 states have call successors, (0), 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-09 10:55:31,226 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:31,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:31,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:32,403 INFO L124 PetriNetUnfolderBase]: 5717/11561 cut-off events. [2024-11-09 10:55:32,403 INFO L125 PetriNetUnfolderBase]: For 59/59 co-relation queries the response was YES. [2024-11-09 10:55:32,429 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19459 conditions, 11561 events. 5717/11561 cut-off events. For 59/59 co-relation queries the response was YES. Maximal size of possible extension queue 879. Compared 114566 event pairs, 4115 based on Foata normal form. 0/6161 useless extension candidates. Maximal degree in co-relation 19415. Up to 7715 conditions per place. [2024-11-09 10:55:32,486 INFO L140 encePairwiseOnDemand]: 101/106 looper letters, 61 selfloop transitions, 10 changer transitions 0/103 dead transitions. [2024-11-09 10:55:32,487 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 107 places, 103 transitions, 446 flow [2024-11-09 10:55:32,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:55:32,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:55:32,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 387 transitions. [2024-11-09 10:55:32,489 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4563679245283019 [2024-11-09 10:55:32,489 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 293 flow. Second operand 8 states and 387 transitions. [2024-11-09 10:55:32,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 107 places, 103 transitions, 446 flow [2024-11-09 10:55:32,491 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 105 places, 103 transitions, 439 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:32,492 INFO L231 Difference]: Finished difference. Result has 105 places, 103 transitions, 317 flow [2024-11-09 10:55:32,493 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=317, PETRI_PLACES=105, PETRI_TRANSITIONS=103} [2024-11-09 10:55:32,493 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 3 predicate places. [2024-11-09 10:55:32,494 INFO L471 AbstractCegarLoop]: Abstraction has has 105 places, 103 transitions, 317 flow [2024-11-09 10:55:32,494 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 41.36363636363637) internal successors, (455), 11 states have internal predecessors, (455), 0 states have call successors, (0), 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-09 10:55:32,494 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:32,495 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:55:32,515 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:55:32,698 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:32,699 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:32,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:32,699 INFO L85 PathProgramCache]: Analyzing trace with hash 923692661, now seen corresponding path program 1 times [2024-11-09 10:55:32,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:32,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234106479] [2024-11-09 10:55:32,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:32,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:32,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:32,828 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-09 10:55:32,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:32,829 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234106479] [2024-11-09 10:55:32,829 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234106479] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:32,829 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:32,829 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:55:32,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1138144459] [2024-11-09 10:55:32,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:32,830 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:32,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:32,831 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:32,831 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:32,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-09 10:55:32,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 103 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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-09 10:55:32,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:32,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-09 10:55:32,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:34,048 INFO L124 PetriNetUnfolderBase]: 7474/15889 cut-off events. [2024-11-09 10:55:34,048 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-09 10:55:34,074 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26461 conditions, 15889 events. 7474/15889 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 1194. Compared 169725 event pairs, 5726 based on Foata normal form. 236/8651 useless extension candidates. Maximal degree in co-relation 26410. Up to 7714 conditions per place. [2024-11-09 10:55:34,153 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 102 selfloop transitions, 8 changer transitions 0/145 dead transitions. [2024-11-09 10:55:34,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 145 transitions, 641 flow [2024-11-09 10:55:34,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:34,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:34,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2024-11-09 10:55:34,156 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056603773584905 [2024-11-09 10:55:34,156 INFO L175 Difference]: Start difference. First operand has 105 places, 103 transitions, 317 flow. Second operand 5 states and 321 transitions. [2024-11-09 10:55:34,156 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 145 transitions, 641 flow [2024-11-09 10:55:34,159 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 145 transitions, 594 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-09 10:55:34,161 INFO L231 Difference]: Finished difference. Result has 103 places, 106 transitions, 315 flow [2024-11-09 10:55:34,162 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=315, PETRI_PLACES=103, PETRI_TRANSITIONS=106} [2024-11-09 10:55:34,163 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2024-11-09 10:55:34,165 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 106 transitions, 315 flow [2024-11-09 10:55:34,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 45.0) internal successors, (225), 5 states have internal predecessors, (225), 0 states have call successors, (0), 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-09 10:55:34,165 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:34,165 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-09 10:55:34,166 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 10:55:34,166 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:34,166 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:34,166 INFO L85 PathProgramCache]: Analyzing trace with hash 923685254, now seen corresponding path program 1 times [2024-11-09 10:55:34,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:34,166 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1444410559] [2024-11-09 10:55:34,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:34,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:34,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:34,359 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:34,360 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1444410559] [2024-11-09 10:55:34,360 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1444410559] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:34,360 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1886786685] [2024-11-09 10:55:34,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:34,361 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:34,361 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:34,362 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:34,363 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:55:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:34,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:55:34,464 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:34,475 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 8 treesize of output 1 [2024-11-09 10:55:34,588 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:34,589 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:34,736 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:34,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1886786685] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:34,737 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:34,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-09 10:55:34,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [753278274] [2024-11-09 10:55:34,737 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:34,738 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:55:34,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:34,738 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:55:34,739 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:55:35,236 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:35,237 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 106 transitions, 315 flow. Second operand has 13 states, 13 states have (on average 41.30769230769231) internal successors, (537), 13 states have internal predecessors, (537), 0 states have call successors, (0), 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-09 10:55:35,237 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:35,238 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:35,238 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:37,075 INFO L124 PetriNetUnfolderBase]: 7771/15393 cut-off events. [2024-11-09 10:55:37,076 INFO L125 PetriNetUnfolderBase]: For 439/439 co-relation queries the response was YES. [2024-11-09 10:55:37,108 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26718 conditions, 15393 events. 7771/15393 cut-off events. For 439/439 co-relation queries the response was YES. Maximal size of possible extension queue 1199. Compared 156341 event pairs, 5906 based on Foata normal form. 0/8150 useless extension candidates. Maximal degree in co-relation 26642. Up to 10678 conditions per place. [2024-11-09 10:55:37,207 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 58 selfloop transitions, 15 changer transitions 0/105 dead transitions. [2024-11-09 10:55:37,208 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 105 transitions, 457 flow [2024-11-09 10:55:37,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:55:37,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:55:37,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 345 transitions. [2024-11-09 10:55:37,210 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.46495956873315364 [2024-11-09 10:55:37,210 INFO L175 Difference]: Start difference. First operand has 103 places, 106 transitions, 315 flow. Second operand 7 states and 345 transitions. [2024-11-09 10:55:37,210 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 105 transitions, 457 flow [2024-11-09 10:55:37,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 105 transitions, 453 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:37,214 INFO L231 Difference]: Finished difference. Result has 107 places, 105 transitions, 337 flow [2024-11-09 10:55:37,214 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=337, PETRI_PLACES=107, PETRI_TRANSITIONS=105} [2024-11-09 10:55:37,215 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2024-11-09 10:55:37,215 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 105 transitions, 337 flow [2024-11-09 10:55:37,215 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.30769230769231) internal successors, (537), 13 states have internal predecessors, (537), 0 states have call successors, (0), 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-09 10:55:37,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:37,216 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1] [2024-11-09 10:55:37,233 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:55:37,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 10:55:37,418 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:37,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:37,419 INFO L85 PathProgramCache]: Analyzing trace with hash -1430368089, now seen corresponding path program 1 times [2024-11-09 10:55:37,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:37,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634990176] [2024-11-09 10:55:37,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:37,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:37,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:37,681 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:37,682 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:37,682 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634990176] [2024-11-09 10:55:37,682 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634990176] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873330807] [2024-11-09 10:55:37,683 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:37,683 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:37,683 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:37,685 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:37,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 10:55:37,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:37,805 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 10:55:37,807 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:37,830 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 10 treesize of output 9 [2024-11-09 10:55:38,036 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:38,037 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:38,256 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:38,256 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873330807] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:38,256 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:38,256 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-09 10:55:38,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295931644] [2024-11-09 10:55:38,259 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:38,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:55:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:55:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:55:38,730 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:38,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 105 transitions, 337 flow. Second operand has 13 states, 13 states have (on average 41.46153846153846) internal successors, (539), 13 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:55:38,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:38,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:38,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:40,141 INFO L124 PetriNetUnfolderBase]: 7692/15546 cut-off events. [2024-11-09 10:55:40,142 INFO L125 PetriNetUnfolderBase]: For 441/441 co-relation queries the response was YES. [2024-11-09 10:55:40,170 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26784 conditions, 15546 events. 7692/15546 cut-off events. For 441/441 co-relation queries the response was YES. Maximal size of possible extension queue 1215. Compared 161647 event pairs, 5827 based on Foata normal form. 0/8155 useless extension candidates. Maximal degree in co-relation 26706. Up to 10576 conditions per place. [2024-11-09 10:55:40,239 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 52 selfloop transitions, 20 changer transitions 0/104 dead transitions. [2024-11-09 10:55:40,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 104 transitions, 477 flow [2024-11-09 10:55:40,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 10:55:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-09 10:55:40,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 344 transitions. [2024-11-09 10:55:40,241 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4636118598382749 [2024-11-09 10:55:40,241 INFO L175 Difference]: Start difference. First operand has 107 places, 105 transitions, 337 flow. Second operand 7 states and 344 transitions. [2024-11-09 10:55:40,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 104 transitions, 477 flow [2024-11-09 10:55:40,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 104 transitions, 450 flow, removed 3 selfloop flow, removed 5 redundant places. [2024-11-09 10:55:40,244 INFO L231 Difference]: Finished difference. Result has 107 places, 104 transitions, 346 flow [2024-11-09 10:55:40,245 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=306, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=346, PETRI_PLACES=107, PETRI_TRANSITIONS=104} [2024-11-09 10:55:40,245 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2024-11-09 10:55:40,245 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 104 transitions, 346 flow [2024-11-09 10:55:40,246 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.46153846153846) internal successors, (539), 13 states have internal predecessors, (539), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:55:40,246 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:40,246 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:40,265 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 10:55:40,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:40,447 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:40,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:40,448 INFO L85 PathProgramCache]: Analyzing trace with hash -1396649637, now seen corresponding path program 1 times [2024-11-09 10:55:40,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:40,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1908636130] [2024-11-09 10:55:40,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:40,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:40,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:40,673 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:40,674 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1908636130] [2024-11-09 10:55:40,674 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1908636130] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:40,674 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1407714389] [2024-11-09 10:55:40,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:40,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:40,675 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:40,676 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:40,678 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 10:55:40,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:40,781 INFO L255 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-09 10:55:40,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:40,857 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 8 treesize of output 1 [2024-11-09 10:55:40,893 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:40,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:40,967 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:40,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1407714389] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:40,968 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:55:40,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [7, 4] total 15 [2024-11-09 10:55:40,968 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194212329] [2024-11-09 10:55:40,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:40,968 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:55:40,969 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:40,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:55:40,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:55:41,024 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-09 10:55:41,024 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 104 transitions, 346 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-09 10:55:41,024 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:41,024 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-09 10:55:41,024 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:42,060 INFO L124 PetriNetUnfolderBase]: 7475/15890 cut-off events. [2024-11-09 10:55:42,060 INFO L125 PetriNetUnfolderBase]: For 435/435 co-relation queries the response was YES. [2024-11-09 10:55:42,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26860 conditions, 15890 events. 7475/15890 cut-off events. For 435/435 co-relation queries the response was YES. Maximal size of possible extension queue 1196. Compared 169522 event pairs, 5726 based on Foata normal form. 0/8415 useless extension candidates. Maximal degree in co-relation 26771. Up to 7708 conditions per place. [2024-11-09 10:55:42,174 INFO L140 encePairwiseOnDemand]: 98/106 looper letters, 104 selfloop transitions, 10 changer transitions 0/146 dead transitions. [2024-11-09 10:55:42,175 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 146 transitions, 686 flow [2024-11-09 10:55:42,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:55:42,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:55:42,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 360 transitions. [2024-11-09 10:55:42,177 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5660377358490566 [2024-11-09 10:55:42,177 INFO L175 Difference]: Start difference. First operand has 107 places, 104 transitions, 346 flow. Second operand 6 states and 360 transitions. [2024-11-09 10:55:42,177 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 146 transitions, 686 flow [2024-11-09 10:55:42,179 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 146 transitions, 634 flow, removed 6 selfloop flow, removed 6 redundant places. [2024-11-09 10:55:42,301 INFO L231 Difference]: Finished difference. Result has 107 places, 106 transitions, 340 flow [2024-11-09 10:55:42,302 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=304, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=104, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=340, PETRI_PLACES=107, PETRI_TRANSITIONS=106} [2024-11-09 10:55:42,303 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 5 predicate places. [2024-11-09 10:55:42,303 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 106 transitions, 340 flow [2024-11-09 10:55:42,304 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-09 10:55:42,304 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:42,304 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:42,321 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-09 10:55:42,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:42,505 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:42,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:42,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1389533996, now seen corresponding path program 1 times [2024-11-09 10:55:42,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:42,506 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1113620510] [2024-11-09 10:55:42,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:42,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:42,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:42,603 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-09 10:55:42,604 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:42,604 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1113620510] [2024-11-09 10:55:42,604 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1113620510] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:42,604 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:42,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:42,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240348349] [2024-11-09 10:55:42,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:42,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:42,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:42,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:42,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:42,631 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 106 [2024-11-09 10:55:42,632 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 106 transitions, 340 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-09 10:55:42,632 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:42,632 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 106 [2024-11-09 10:55:42,632 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:43,508 INFO L124 PetriNetUnfolderBase]: 7631/14856 cut-off events. [2024-11-09 10:55:43,508 INFO L125 PetriNetUnfolderBase]: For 425/425 co-relation queries the response was YES. [2024-11-09 10:55:43,537 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25993 conditions, 14856 events. 7631/14856 cut-off events. For 425/425 co-relation queries the response was YES. Maximal size of possible extension queue 1193. Compared 148130 event pairs, 5872 based on Foata normal form. 0/8283 useless extension candidates. Maximal degree in co-relation 19112. Up to 10508 conditions per place. [2024-11-09 10:55:43,595 INFO L140 encePairwiseOnDemand]: 102/106 looper letters, 70 selfloop transitions, 3 changer transitions 0/103 dead transitions. [2024-11-09 10:55:43,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 103 transitions, 480 flow [2024-11-09 10:55:43,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:43,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:43,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 182 transitions. [2024-11-09 10:55:43,597 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5723270440251572 [2024-11-09 10:55:43,597 INFO L175 Difference]: Start difference. First operand has 107 places, 106 transitions, 340 flow. Second operand 3 states and 182 transitions. [2024-11-09 10:55:43,597 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 103 transitions, 480 flow [2024-11-09 10:55:43,599 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 103 transitions, 468 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:55:43,600 INFO L231 Difference]: Finished difference. Result has 103 places, 103 transitions, 328 flow [2024-11-09 10:55:43,600 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=322, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=328, PETRI_PLACES=103, PETRI_TRANSITIONS=103} [2024-11-09 10:55:43,601 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2024-11-09 10:55:43,601 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 103 transitions, 328 flow [2024-11-09 10:55:43,601 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-09 10:55:43,601 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:43,602 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:43,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 10:55:43,602 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:43,602 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:43,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1396649638, now seen corresponding path program 1 times [2024-11-09 10:55:43,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:43,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151562270] [2024-11-09 10:55:43,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:43,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:43,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:43,647 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:55:43,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:43,648 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151562270] [2024-11-09 10:55:43,648 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151562270] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:43,648 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:43,648 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:43,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1501689840] [2024-11-09 10:55:43,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:43,648 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:55:43,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:43,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:55:43,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:55:43,676 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-09 10:55:43,676 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 103 transitions, 328 flow. Second operand has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-09 10:55:43,676 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:43,676 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-09 10:55:43,677 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:44,528 INFO L124 PetriNetUnfolderBase]: 6883/13432 cut-off events. [2024-11-09 10:55:44,528 INFO L125 PetriNetUnfolderBase]: For 391/391 co-relation queries the response was YES. [2024-11-09 10:55:44,546 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23497 conditions, 13432 events. 6883/13432 cut-off events. For 391/391 co-relation queries the response was YES. Maximal size of possible extension queue 1044. Compared 132075 event pairs, 5220 based on Foata normal form. 2/7335 useless extension candidates. Maximal degree in co-relation 17322. Up to 9479 conditions per place. [2024-11-09 10:55:44,588 INFO L140 encePairwiseOnDemand]: 103/106 looper letters, 65 selfloop transitions, 7 changer transitions 0/102 dead transitions. [2024-11-09 10:55:44,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 102 transitions, 470 flow [2024-11-09 10:55:44,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:55:44,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:55:44,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2024-11-09 10:55:44,589 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5817610062893082 [2024-11-09 10:55:44,589 INFO L175 Difference]: Start difference. First operand has 103 places, 103 transitions, 328 flow. Second operand 3 states and 185 transitions. [2024-11-09 10:55:44,589 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 102 transitions, 470 flow [2024-11-09 10:55:44,590 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 102 transitions, 467 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:44,591 INFO L231 Difference]: Finished difference. Result has 103 places, 102 transitions, 337 flow [2024-11-09 10:55:44,591 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=337, PETRI_PLACES=103, PETRI_TRANSITIONS=102} [2024-11-09 10:55:44,592 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 1 predicate places. [2024-11-09 10:55:44,592 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 102 transitions, 337 flow [2024-11-09 10:55:44,592 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 45.666666666666664) internal successors, (137), 3 states have internal predecessors, (137), 0 states have call successors, (0), 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-09 10:55:44,592 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:44,592 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:44,592 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-09 10:55:44,593 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:44,593 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:44,593 INFO L85 PathProgramCache]: Analyzing trace with hash -1389533995, now seen corresponding path program 1 times [2024-11-09 10:55:44,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:44,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [553655089] [2024-11-09 10:55:44,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:44,593 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:44,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:44,866 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-09 10:55:44,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:44,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [553655089] [2024-11-09 10:55:44,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [553655089] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:44,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:44,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:55:44,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1993300468] [2024-11-09 10:55:44,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:44,868 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:55:44,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:44,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:55:44,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:55:45,050 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:45,051 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 102 transitions, 337 flow. Second operand has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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-09 10:55:45,051 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:45,051 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:45,051 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:46,190 INFO L124 PetriNetUnfolderBase]: 7705/14874 cut-off events. [2024-11-09 10:55:46,190 INFO L125 PetriNetUnfolderBase]: For 434/434 co-relation queries the response was YES. [2024-11-09 10:55:46,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26116 conditions, 14874 events. 7705/14874 cut-off events. For 434/434 co-relation queries the response was YES. Maximal size of possible extension queue 1164. Compared 146451 event pairs, 5942 based on Foata normal form. 0/8346 useless extension candidates. Maximal degree in co-relation 19222. Up to 10629 conditions per place. [2024-11-09 10:55:46,264 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 72 selfloop transitions, 8 changer transitions 0/108 dead transitions. [2024-11-09 10:55:46,265 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 108 transitions, 509 flow [2024-11-09 10:55:46,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 10:55:46,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-09 10:55:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 304 transitions. [2024-11-09 10:55:46,266 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4779874213836478 [2024-11-09 10:55:46,266 INFO L175 Difference]: Start difference. First operand has 103 places, 102 transitions, 337 flow. Second operand 6 states and 304 transitions. [2024-11-09 10:55:46,266 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 108 transitions, 509 flow [2024-11-09 10:55:46,268 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 108 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:46,269 INFO L231 Difference]: Finished difference. Result has 109 places, 106 transitions, 366 flow [2024-11-09 10:55:46,270 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=323, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=94, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=366, PETRI_PLACES=109, PETRI_TRANSITIONS=106} [2024-11-09 10:55:46,270 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 7 predicate places. [2024-11-09 10:55:46,270 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 106 transitions, 366 flow [2024-11-09 10:55:46,271 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.333333333333336) internal successors, (248), 6 states have internal predecessors, (248), 0 states have call successors, (0), 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-09 10:55:46,271 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:46,271 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:46,271 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-09 10:55:46,271 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:46,271 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:46,272 INFO L85 PathProgramCache]: Analyzing trace with hash -1389534102, now seen corresponding path program 1 times [2024-11-09 10:55:46,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:46,272 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1814982482] [2024-11-09 10:55:46,272 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:46,272 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:46,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:46,437 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-09 10:55:46,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:46,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1814982482] [2024-11-09 10:55:46,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1814982482] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:46,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:46,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:46,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209328492] [2024-11-09 10:55:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:46,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:55:46,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:46,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:55:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:55:46,539 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:46,539 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 106 transitions, 366 flow. Second operand has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 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-09 10:55:46,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:46,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:46,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:47,461 INFO L124 PetriNetUnfolderBase]: 6891/13458 cut-off events. [2024-11-09 10:55:47,462 INFO L125 PetriNetUnfolderBase]: For 398/398 co-relation queries the response was YES. [2024-11-09 10:55:47,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23590 conditions, 13458 events. 6891/13458 cut-off events. For 398/398 co-relation queries the response was YES. Maximal size of possible extension queue 1046. Compared 132241 event pairs, 5220 based on Foata normal form. 0/7357 useless extension candidates. Maximal degree in co-relation 23503. Up to 9504 conditions per place. [2024-11-09 10:55:47,541 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 71 selfloop transitions, 10 changer transitions 0/110 dead transitions. [2024-11-09 10:55:47,541 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 110 transitions, 542 flow [2024-11-09 10:55:47,542 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:55:47,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:55:47,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 263 transitions. [2024-11-09 10:55:47,543 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4962264150943396 [2024-11-09 10:55:47,543 INFO L175 Difference]: Start difference. First operand has 109 places, 106 transitions, 366 flow. Second operand 5 states and 263 transitions. [2024-11-09 10:55:47,543 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 110 transitions, 542 flow [2024-11-09 10:55:47,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 110 transitions, 535 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:47,546 INFO L231 Difference]: Finished difference. Result has 113 places, 110 transitions, 415 flow [2024-11-09 10:55:47,546 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=415, PETRI_PLACES=113, PETRI_TRANSITIONS=110} [2024-11-09 10:55:47,547 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 11 predicate places. [2024-11-09 10:55:47,547 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 110 transitions, 415 flow [2024-11-09 10:55:47,547 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 41.6) internal successors, (208), 5 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-09 10:55:47,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:47,548 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:47,548 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 10:55:47,548 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:47,549 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:47,549 INFO L85 PathProgramCache]: Analyzing trace with hash 393970109, now seen corresponding path program 1 times [2024-11-09 10:55:47,549 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:47,549 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1964232634] [2024-11-09 10:55:47,549 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:47,549 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:47,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:47,655 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-09 10:55:47,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:47,656 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1964232634] [2024-11-09 10:55:47,656 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1964232634] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:47,656 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:47,657 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:55:47,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [437302814] [2024-11-09 10:55:47,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:47,657 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:47,657 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:47,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:47,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:47,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-09 10:55:47,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 110 transitions, 415 flow. Second operand has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-09 10:55:47,666 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:47,666 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-09 10:55:47,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:48,763 INFO L124 PetriNetUnfolderBase]: 7229/14136 cut-off events. [2024-11-09 10:55:48,763 INFO L125 PetriNetUnfolderBase]: For 440/440 co-relation queries the response was YES. [2024-11-09 10:55:48,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25084 conditions, 14136 events. 7229/14136 cut-off events. For 440/440 co-relation queries the response was YES. Maximal size of possible extension queue 1061. Compared 138792 event pairs, 5536 based on Foata normal form. 98/7987 useless extension candidates. Maximal degree in co-relation 24869. Up to 9508 conditions per place. [2024-11-09 10:55:48,819 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 130 selfloop transitions, 3 changer transitions 0/163 dead transitions. [2024-11-09 10:55:48,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 924 flow [2024-11-09 10:55:48,820 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:55:48,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:55:48,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 274 transitions. [2024-11-09 10:55:48,821 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6462264150943396 [2024-11-09 10:55:48,821 INFO L175 Difference]: Start difference. First operand has 113 places, 110 transitions, 415 flow. Second operand 4 states and 274 transitions. [2024-11-09 10:55:48,821 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 924 flow [2024-11-09 10:55:48,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 163 transitions, 911 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:48,826 INFO L231 Difference]: Finished difference. Result has 115 places, 110 transitions, 426 flow [2024-11-09 10:55:48,826 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=407, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=426, PETRI_PLACES=115, PETRI_TRANSITIONS=110} [2024-11-09 10:55:48,827 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 13 predicate places. [2024-11-09 10:55:48,827 INFO L471 AbstractCegarLoop]: Abstraction has has 115 places, 110 transitions, 426 flow [2024-11-09 10:55:48,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.0) internal successors, (184), 4 states have internal predecessors, (184), 0 states have call successors, (0), 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-09 10:55:48,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:48,827 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:48,827 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 10:55:48,828 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:48,828 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:48,828 INFO L85 PathProgramCache]: Analyzing trace with hash 392602139, now seen corresponding path program 1 times [2024-11-09 10:55:48,828 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:48,828 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1910369197] [2024-11-09 10:55:48,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:48,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:48,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:49,056 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:49,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1910369197] [2024-11-09 10:55:49,057 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1910369197] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:49,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [191202110] [2024-11-09 10:55:49,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:49,058 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:49,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:49,060 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:49,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 10:55:49,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:49,238 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 10:55:49,239 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:49,257 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 10 treesize of output 9 [2024-11-09 10:55:49,396 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:49,396 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:49,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:49,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [191202110] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:49,566 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:49,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-09 10:55:49,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414148809] [2024-11-09 10:55:49,567 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:49,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:55:49,567 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:49,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:55:49,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=116, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:55:49,994 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 106 [2024-11-09 10:55:49,995 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 115 places, 110 transitions, 426 flow. Second operand has 13 states, 13 states have (on average 41.92307692307692) internal successors, (545), 13 states have internal predecessors, (545), 0 states have call successors, (0), 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-09 10:55:49,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:49,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 106 [2024-11-09 10:55:49,995 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:51,173 INFO L124 PetriNetUnfolderBase]: 7221/14312 cut-off events. [2024-11-09 10:55:51,173 INFO L125 PetriNetUnfolderBase]: For 1146/1146 co-relation queries the response was YES. [2024-11-09 10:55:51,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27718 conditions, 14312 events. 7221/14312 cut-off events. For 1146/1146 co-relation queries the response was YES. Maximal size of possible extension queue 1049. Compared 142035 event pairs, 5520 based on Foata normal form. 0/8478 useless extension candidates. Maximal degree in co-relation 27462. Up to 10056 conditions per place. [2024-11-09 10:55:51,271 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 60 selfloop transitions, 24 changer transitions 0/113 dead transitions. [2024-11-09 10:55:51,272 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 113 transitions, 612 flow [2024-11-09 10:55:51,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 10:55:51,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-09 10:55:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2024-11-09 10:55:51,273 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.449685534591195 [2024-11-09 10:55:51,273 INFO L175 Difference]: Start difference. First operand has 115 places, 110 transitions, 426 flow. Second operand 9 states and 429 transitions. [2024-11-09 10:55:51,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 113 transitions, 612 flow [2024-11-09 10:55:51,277 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 113 transitions, 607 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:55:51,279 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 487 flow [2024-11-09 10:55:51,279 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=487, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2024-11-09 10:55:51,279 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 18 predicate places. [2024-11-09 10:55:51,279 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 487 flow [2024-11-09 10:55:51,280 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 41.92307692307692) internal successors, (545), 13 states have internal predecessors, (545), 0 states have call successors, (0), 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-09 10:55:51,280 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:51,280 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:51,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:55:51,480 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-11-09 10:55:51,481 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:51,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:51,481 INFO L85 PathProgramCache]: Analyzing trace with hash 2144507305, now seen corresponding path program 1 times [2024-11-09 10:55:51,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:51,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254846868] [2024-11-09 10:55:51,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:51,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:51,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:51,608 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:51,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254846868] [2024-11-09 10:55:51,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254846868] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:51,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446158055] [2024-11-09 10:55:51,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:51,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:51,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:51,611 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:51,613 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 10:55:51,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:51,730 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 10:55:51,731 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:51,795 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:51,795 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:51,852 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:51,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446158055] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:51,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:51,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2024-11-09 10:55:51,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812628086] [2024-11-09 10:55:51,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:51,853 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 10:55:51,853 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:51,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 10:55:51,854 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2024-11-09 10:55:51,918 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-09 10:55:51,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 487 flow. Second operand has 14 states, 14 states have (on average 45.714285714285715) internal successors, (640), 14 states have internal predecessors, (640), 0 states have call successors, (0), 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-09 10:55:51,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:51,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-09 10:55:51,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:54,223 INFO L124 PetriNetUnfolderBase]: 12482/24939 cut-off events. [2024-11-09 10:55:54,223 INFO L125 PetriNetUnfolderBase]: For 2051/2051 co-relation queries the response was YES. [2024-11-09 10:55:54,292 INFO L83 FinitePrefix]: Finished finitePrefix Result has 48043 conditions, 24939 events. 12482/24939 cut-off events. For 2051/2051 co-relation queries the response was YES. Maximal size of possible extension queue 1689. Compared 267337 event pairs, 9330 based on Foata normal form. 2/14770 useless extension candidates. Maximal degree in co-relation 47587. Up to 10083 conditions per place. [2024-11-09 10:55:54,399 INFO L140 encePairwiseOnDemand]: 92/106 looper letters, 120 selfloop transitions, 37 changer transitions 0/186 dead transitions. [2024-11-09 10:55:54,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 130 places, 186 transitions, 1126 flow [2024-11-09 10:55:54,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 10:55:54,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-09 10:55:54,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 602 transitions. [2024-11-09 10:55:54,403 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.516295025728988 [2024-11-09 10:55:54,403 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 487 flow. Second operand 11 states and 602 transitions. [2024-11-09 10:55:54,403 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 130 places, 186 transitions, 1126 flow [2024-11-09 10:55:54,408 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 186 transitions, 1036 flow, removed 16 selfloop flow, removed 6 redundant places. [2024-11-09 10:55:54,411 INFO L231 Difference]: Finished difference. Result has 130 places, 135 transitions, 723 flow [2024-11-09 10:55:54,411 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=435, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=723, PETRI_PLACES=130, PETRI_TRANSITIONS=135} [2024-11-09 10:55:54,411 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 28 predicate places. [2024-11-09 10:55:54,412 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 135 transitions, 723 flow [2024-11-09 10:55:54,412 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 45.714285714285715) internal successors, (640), 14 states have internal predecessors, (640), 0 states have call successors, (0), 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-09 10:55:54,412 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:54,412 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:54,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-09 10:55:54,613 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-09 10:55:54,613 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:54,614 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:54,614 INFO L85 PathProgramCache]: Analyzing trace with hash -711127660, now seen corresponding path program 1 times [2024-11-09 10:55:54,614 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:54,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518172308] [2024-11-09 10:55:54,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:54,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:54,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:55,038 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:55,039 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:55,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518172308] [2024-11-09 10:55:55,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518172308] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:55:55,039 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1625538653] [2024-11-09 10:55:55,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:55,040 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:55,040 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:55:55,042 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:55:55,043 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 10:55:55,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:55,167 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 10:55:55,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:55:55,190 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-09 10:55:55,199 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 10 treesize of output 9 [2024-11-09 10:55:55,244 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:55:55,246 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 18 treesize of output 13 [2024-11-09 10:55:55,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:55:55,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 10:55:55,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 10:55:55,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 11 treesize of output 11 [2024-11-09 10:55:55,381 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 21 treesize of output 14 [2024-11-09 10:55:55,475 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:55,476 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:55:55,589 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:55:55,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 61 [2024-11-09 10:55:55,781 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 10:55:55,834 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:55:55,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1625538653] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:55:55,834 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:55:55,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 16 [2024-11-09 10:55:55,834 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312962735] [2024-11-09 10:55:55,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:55:55,835 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:55:55,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:55,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:55:55,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:55:56,930 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 106 [2024-11-09 10:55:56,931 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 135 transitions, 723 flow. Second operand has 18 states, 18 states have (on average 37.833333333333336) internal successors, (681), 18 states have internal predecessors, (681), 0 states have call successors, (0), 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-09 10:55:56,931 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:56,931 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 106 [2024-11-09 10:55:56,931 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:55:59,135 INFO L124 PetriNetUnfolderBase]: 13944/26798 cut-off events. [2024-11-09 10:55:59,135 INFO L125 PetriNetUnfolderBase]: For 2208/2208 co-relation queries the response was YES. [2024-11-09 10:55:59,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 52476 conditions, 26798 events. 13944/26798 cut-off events. For 2208/2208 co-relation queries the response was YES. Maximal size of possible extension queue 1890. Compared 280925 event pairs, 10504 based on Foata normal form. 0/16034 useless extension candidates. Maximal degree in co-relation 52375. Up to 19192 conditions per place. [2024-11-09 10:55:59,348 INFO L140 encePairwiseOnDemand]: 99/106 looper letters, 103 selfloop transitions, 16 changer transitions 0/146 dead transitions. [2024-11-09 10:55:59,348 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 146 transitions, 1041 flow [2024-11-09 10:55:59,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:55:59,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:55:59,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 351 transitions. [2024-11-09 10:55:59,350 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.41391509433962265 [2024-11-09 10:55:59,350 INFO L175 Difference]: Start difference. First operand has 130 places, 135 transitions, 723 flow. Second operand 8 states and 351 transitions. [2024-11-09 10:55:59,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 146 transitions, 1041 flow [2024-11-09 10:55:59,355 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 146 transitions, 1032 flow, removed 2 selfloop flow, removed 1 redundant places. [2024-11-09 10:55:59,357 INFO L231 Difference]: Finished difference. Result has 135 places, 134 transitions, 742 flow [2024-11-09 10:55:59,358 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=710, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=118, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=742, PETRI_PLACES=135, PETRI_TRANSITIONS=134} [2024-11-09 10:55:59,358 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 33 predicate places. [2024-11-09 10:55:59,358 INFO L471 AbstractCegarLoop]: Abstraction has has 135 places, 134 transitions, 742 flow [2024-11-09 10:55:59,359 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 37.833333333333336) internal successors, (681), 18 states have internal predecessors, (681), 0 states have call successors, (0), 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-09 10:55:59,359 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:55:59,359 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:55:59,374 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-09 10:55:59,563 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:55:59,564 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:55:59,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:55:59,564 INFO L85 PathProgramCache]: Analyzing trace with hash -159313343, now seen corresponding path program 1 times [2024-11-09 10:55:59,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:55:59,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412167586] [2024-11-09 10:55:59,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:55:59,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:55:59,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:55:59,671 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:55:59,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:55:59,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412167586] [2024-11-09 10:55:59,672 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1412167586] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:55:59,672 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:55:59,672 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:55:59,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1020897391] [2024-11-09 10:55:59,672 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:55:59,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:55:59,676 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:55:59,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:55:59,677 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:55:59,693 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 106 [2024-11-09 10:55:59,697 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 134 transitions, 742 flow. Second operand has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-09 10:55:59,697 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:55:59,697 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 106 [2024-11-09 10:55:59,698 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:01,608 INFO L124 PetriNetUnfolderBase]: 13107/26232 cut-off events. [2024-11-09 10:56:01,608 INFO L125 PetriNetUnfolderBase]: For 2394/2394 co-relation queries the response was YES. [2024-11-09 10:56:01,715 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51194 conditions, 26232 events. 13107/26232 cut-off events. For 2394/2394 co-relation queries the response was YES. Maximal size of possible extension queue 1777. Compared 281855 event pairs, 9742 based on Foata normal form. 226/16205 useless extension candidates. Maximal degree in co-relation 51006. Up to 17424 conditions per place. [2024-11-09 10:56:01,820 INFO L140 encePairwiseOnDemand]: 89/106 looper letters, 143 selfloop transitions, 15 changer transitions 0/186 dead transitions. [2024-11-09 10:56:01,820 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 186 transitions, 1354 flow [2024-11-09 10:56:01,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:56:01,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:56:01,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 321 transitions. [2024-11-09 10:56:01,822 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6056603773584905 [2024-11-09 10:56:01,822 INFO L175 Difference]: Start difference. First operand has 135 places, 134 transitions, 742 flow. Second operand 5 states and 321 transitions. [2024-11-09 10:56:01,822 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 186 transitions, 1354 flow [2024-11-09 10:56:01,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 186 transitions, 1252 flow, removed 6 selfloop flow, removed 8 redundant places. [2024-11-09 10:56:01,831 INFO L231 Difference]: Finished difference. Result has 133 places, 140 transitions, 799 flow [2024-11-09 10:56:01,831 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=686, PETRI_DIFFERENCE_MINUEND_PLACES=127, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=134, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=799, PETRI_PLACES=133, PETRI_TRANSITIONS=140} [2024-11-09 10:56:01,831 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 31 predicate places. [2024-11-09 10:56:01,831 INFO L471 AbstractCegarLoop]: Abstraction has has 133 places, 140 transitions, 799 flow [2024-11-09 10:56:01,831 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 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-09 10:56:01,831 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:01,832 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-11-09 10:56:01,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 10:56:01,832 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:56:01,832 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:01,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1043142031, now seen corresponding path program 2 times [2024-11-09 10:56:01,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:01,832 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816746221] [2024-11-09 10:56:01,832 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:01,833 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:01,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:02,115 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:56:02,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816746221] [2024-11-09 10:56:02,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1816746221] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:02,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234511829] [2024-11-09 10:56:02,116 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 10:56:02,117 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:02,117 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:02,119 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:56:02,120 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 10:56:02,238 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 10:56:02,238 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 10:56:02,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-09 10:56:02,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:02,265 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 8 treesize of output 7 [2024-11-09 10:56:02,356 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:56:02,356 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:02,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 10:56:02,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234511829] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:02,486 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:02,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 17 [2024-11-09 10:56:02,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1550416489] [2024-11-09 10:56:02,487 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:02,487 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 10:56:02,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:02,488 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 10:56:02,488 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2024-11-09 10:56:03,117 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 106 [2024-11-09 10:56:03,117 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 140 transitions, 799 flow. Second operand has 18 states, 18 states have (on average 44.77777777777778) internal successors, (806), 18 states have internal predecessors, (806), 0 states have call successors, (0), 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-09 10:56:03,117 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:03,118 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 106 [2024-11-09 10:56:03,118 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:06,396 INFO L124 PetriNetUnfolderBase]: 19011/36595 cut-off events. [2024-11-09 10:56:06,397 INFO L125 PetriNetUnfolderBase]: For 5958/6054 co-relation queries the response was YES. [2024-11-09 10:56:06,478 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82236 conditions, 36595 events. 19011/36595 cut-off events. For 5958/6054 co-relation queries the response was YES. Maximal size of possible extension queue 2337. Compared 390524 event pairs, 14056 based on Foata normal form. 8/22449 useless extension candidates. Maximal degree in co-relation 80728. Up to 18701 conditions per place. [2024-11-09 10:56:06,611 INFO L140 encePairwiseOnDemand]: 96/106 looper letters, 152 selfloop transitions, 35 changer transitions 0/214 dead transitions. [2024-11-09 10:56:06,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 214 transitions, 1569 flow [2024-11-09 10:56:06,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 10:56:06,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2024-11-09 10:56:06,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 767 transitions. [2024-11-09 10:56:06,614 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.48238993710691824 [2024-11-09 10:56:06,614 INFO L175 Difference]: Start difference. First operand has 133 places, 140 transitions, 799 flow. Second operand 15 states and 767 transitions. [2024-11-09 10:56:06,614 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 214 transitions, 1569 flow [2024-11-09 10:56:06,630 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 214 transitions, 1561 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-09 10:56:06,633 INFO L231 Difference]: Finished difference. Result has 146 places, 150 transitions, 953 flow [2024-11-09 10:56:06,633 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=139, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=15, PETRI_FLOW=953, PETRI_PLACES=146, PETRI_TRANSITIONS=150} [2024-11-09 10:56:06,634 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 44 predicate places. [2024-11-09 10:56:06,634 INFO L471 AbstractCegarLoop]: Abstraction has has 146 places, 150 transitions, 953 flow [2024-11-09 10:56:06,635 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 44.77777777777778) internal successors, (806), 18 states have internal predecessors, (806), 0 states have call successors, (0), 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-09 10:56:06,635 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:06,635 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:56:06,654 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-09 10:56:06,836 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:06,836 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:56:06,836 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -35952350, now seen corresponding path program 1 times [2024-11-09 10:56:06,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2101139793] [2024-11-09 10:56:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:06,837 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:06,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:07,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 10:56:07,046 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:07,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2101139793] [2024-11-09 10:56:07,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2101139793] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:56:07,046 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:56:07,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:56:07,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083924684] [2024-11-09 10:56:07,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:56:07,047 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:56:07,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:07,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:56:07,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:56:07,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 106 [2024-11-09 10:56:07,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 146 places, 150 transitions, 953 flow. Second operand has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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-09 10:56:07,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:56:07,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 106 [2024-11-09 10:56:07,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:56:09,823 INFO L124 PetriNetUnfolderBase]: 19115/34723 cut-off events. [2024-11-09 10:56:09,824 INFO L125 PetriNetUnfolderBase]: For 5947/5947 co-relation queries the response was YES. [2024-11-09 10:56:09,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79693 conditions, 34723 events. 19115/34723 cut-off events. For 5947/5947 co-relation queries the response was YES. Maximal size of possible extension queue 2118. Compared 348854 event pairs, 14543 based on Foata normal form. 0/22951 useless extension candidates. Maximal degree in co-relation 78184. Up to 26638 conditions per place. [2024-11-09 10:56:10,068 INFO L140 encePairwiseOnDemand]: 97/106 looper letters, 98 selfloop transitions, 25 changer transitions 0/146 dead transitions. [2024-11-09 10:56:10,068 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 146 places, 146 transitions, 1187 flow [2024-11-09 10:56:10,068 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:56:10,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:56:10,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 239 transitions. [2024-11-09 10:56:10,069 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4509433962264151 [2024-11-09 10:56:10,069 INFO L175 Difference]: Start difference. First operand has 146 places, 150 transitions, 953 flow. Second operand 5 states and 239 transitions. [2024-11-09 10:56:10,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 146 places, 146 transitions, 1187 flow [2024-11-09 10:56:10,084 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 142 places, 146 transitions, 1127 flow, removed 20 selfloop flow, removed 4 redundant places. [2024-11-09 10:56:10,086 INFO L231 Difference]: Finished difference. Result has 142 places, 146 transitions, 931 flow [2024-11-09 10:56:10,087 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=106, PETRI_DIFFERENCE_MINUEND_FLOW=881, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=146, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=121, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=931, PETRI_PLACES=142, PETRI_TRANSITIONS=146} [2024-11-09 10:56:10,087 INFO L277 CegarLoopForPetriNet]: 102 programPoint places, 40 predicate places. [2024-11-09 10:56:10,087 INFO L471 AbstractCegarLoop]: Abstraction has has 142 places, 146 transitions, 931 flow [2024-11-09 10:56:10,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.0) internal successors, (228), 6 states have internal predecessors, (228), 0 states have call successors, (0), 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-09 10:56:10,088 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:56:10,088 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:56:10,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-09 10:56:10,088 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting thread1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 78 more)] === [2024-11-09 10:56:10,088 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:56:10,088 INFO L85 PathProgramCache]: Analyzing trace with hash -35952349, now seen corresponding path program 1 times [2024-11-09 10:56:10,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:56:10,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836953932] [2024-11-09 10:56:10,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:10,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:56:10,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:10,566 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:56:10,566 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:56:10,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836953932] [2024-11-09 10:56:10,567 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836953932] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:56:10,567 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [12991733] [2024-11-09 10:56:10,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:56:10,567 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:56:10,567 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:56:10,569 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:56:10,573 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 10:56:10,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:56:10,710 INFO L255 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-09 10:56:10,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:56:10,722 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-09 10:56:10,794 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 10:56:10,795 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 16 [2024-11-09 10:56:10,799 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 16 treesize of output 11 [2024-11-09 10:56:10,816 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:56:10,816 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-09 10:56:10,829 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:56:10,829 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 16 treesize of output 15 [2024-11-09 10:56:10,906 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:56:10,906 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 22 treesize of output 21 [2024-11-09 10:56:10,923 INFO L349 Elim1Store]: treesize reduction 12, result has 60.0 percent of original size [2024-11-09 10:56:10,923 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 23 treesize of output 28 [2024-11-09 10:56:10,977 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 10:56:10,978 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 26 treesize of output 25 [2024-11-09 10:56:10,984 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:56:10,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 21 treesize of output 25 [2024-11-09 10:56:11,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:56:11,065 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:56:15,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 39382 treesize of output 39124 [2024-11-09 10:56:18,216 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 10:56:18,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [12991733] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:56:18,216 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:56:18,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 17 [2024-11-09 10:56:18,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2091703809] [2024-11-09 10:56:18,217 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:56:18,217 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:56:18,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:56:18,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:56:18,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=277, Unknown=1, NotChecked=0, Total=342 [2024-11-09 10:56:23,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:56:27,379 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:56:33,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:56:39,323 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-09 10:56:42,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]