./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.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 fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:48:44,057 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:48:44,153 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:48:44,160 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:48:44,160 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:48:44,182 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:48:44,183 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:48:44,183 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:48:44,184 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:48:44,184 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:48:44,186 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:48:44,186 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:48:44,187 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:48:44,191 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:48:44,192 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:48:44,192 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:48:44,192 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:48:44,193 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:48:44,193 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:48:44,193 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:48:44,193 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:48:44,194 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:48:44,194 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:48:44,195 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:48:44,195 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:48:44,195 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:48:44,195 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:48:44,196 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:48:44,196 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:48:44,196 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:48:44,197 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:48:44,197 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:48:44,197 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:48:44,197 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:44,198 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:48:44,198 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:48:44,198 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:48:44,199 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:48:44,199 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:48:44,199 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:48:44,200 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:48:44,200 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:48:44,200 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-19 09:48:44,467 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:48:44,492 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:48:44,496 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:48:44,497 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:48:44,498 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:48:44,499 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:48:46,011 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:48:46,222 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:48:46,223 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:48:46,233 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbdbcdaa/c636e90402e348969402129fa79ec23c/FLAG1d0c120ed [2024-11-19 09:48:46,584 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3cbdbcdaa/c636e90402e348969402129fa79ec23c [2024-11-19 09:48:46,586 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:48:46,587 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:48:46,589 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:46,590 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:48:46,595 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:48:46,596 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:46,596 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aef8689 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46, skipping insertion in model container [2024-11-19 09:48:46,597 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:46,628 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:48:46,883 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-19 09:48:46,890 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:46,899 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:48:46,926 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:48:46,945 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:48:46,946 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46 WrapperNode [2024-11-19 09:48:46,946 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:48:46,947 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:46,947 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:48:46,948 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:48:46,955 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:46,970 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:46,999 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 313 [2024-11-19 09:48:47,000 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:48:47,000 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:48:47,001 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:48:47,001 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:48:47,017 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,017 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,028 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,064 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-19 09:48:47,064 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,065 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,077 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,082 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,085 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,087 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,091 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:48:47,092 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:48:47,092 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:48:47,092 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:48:47,093 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (1/1) ... [2024-11-19 09:48:47,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:48:47,111 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:47,133 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:48:47,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:48:47,190 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:48:47,192 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:48:47,192 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:48:47,193 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:48:47,193 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:48:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:48:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:48:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 09:48:47,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 09:48:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 09:48:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 09:48:47,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-19 09:48:47,195 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-19 09:48:47,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:48:47,196 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:48:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:48:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:48:47,197 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:48:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-19 09:48:47,197 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-19 09:48:47,199 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:48:47,355 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:48:47,357 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:48:47,894 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:48:47,894 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:48:48,367 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:48:48,368 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 09:48:48,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:48 BoogieIcfgContainer [2024-11-19 09:48:48,369 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:48:48,371 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:48:48,373 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:48:48,376 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:48:48,377 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:48:46" (1/3) ... [2024-11-19 09:48:48,377 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b17bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:48, skipping insertion in model container [2024-11-19 09:48:48,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:48:46" (2/3) ... [2024-11-19 09:48:48,378 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43b17bfd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:48:48, skipping insertion in model container [2024-11-19 09:48:48,378 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:48" (3/3) ... [2024-11-19 09:48:48,380 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:48:48,400 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:48:48,400 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 09:48:48,400 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:48:48,488 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 09:48:48,526 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-19 09:48:48,573 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-19 09:48:48,573 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:48:48,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 155 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-19 09:48:48,579 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-19 09:48:48,584 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-19 09:48:48,594 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:48:48,602 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;@10b214d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:48:48,602 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-19 09:48:48,606 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:48:48,606 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:48:48,606 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:48:48,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:48,607 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:48,608 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:48,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:48,613 INFO L85 PathProgramCache]: Analyzing trace with hash 892478, now seen corresponding path program 1 times [2024-11-19 09:48:48,622 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:48,623 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [977846958] [2024-11-19 09:48:48,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:48,623 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:48,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:48,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:48,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [977846958] [2024-11-19 09:48:48,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [977846958] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:48,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:48,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:48:48,953 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818261709] [2024-11-19 09:48:48,954 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:48,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:48:48,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:48,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:48:48,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:48:49,015 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:48:49,018 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:49,018 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:49,018 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:48:49,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:51,006 INFO L124 PetriNetUnfolderBase]: 9651/13484 cut-off events. [2024-11-19 09:48:51,007 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-19 09:48:51,051 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26018 conditions, 13484 events. 9651/13484 cut-off events. For 298/298 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88202 event pairs, 6408 based on Foata normal form. 1/7906 useless extension candidates. Maximal degree in co-relation 24428. Up to 11896 conditions per place. [2024-11-19 09:48:51,145 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-19 09:48:51,145 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-19 09:48:51,147 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:48:51,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:48:51,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-19 09:48:51,158 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-19 09:48:51,161 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-19 09:48:51,162 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-19 09:48:51,212 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:48:51,216 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-19 09:48:51,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-19 09:48:51,224 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-19 09:48:51,225 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-19 09:48:51,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:51,225 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:51,226 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:48:51,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:48:51,227 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:51,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:51,228 INFO L85 PathProgramCache]: Analyzing trace with hash 892479, now seen corresponding path program 1 times [2024-11-19 09:48:51,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:51,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1495758205] [2024-11-19 09:48:51,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:51,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:51,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:51,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:51,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:51,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1495758205] [2024-11-19 09:48:51,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1495758205] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:51,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:51,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:48:51,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021273218] [2024-11-19 09:48:51,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:51,516 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:48:51,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:51,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:48:51,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:48:51,537 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:48:51,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:51,539 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:51,539 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:48:51,539 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:53,118 INFO L124 PetriNetUnfolderBase]: 9652/13487 cut-off events. [2024-11-19 09:48:53,118 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-19 09:48:53,162 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25621 conditions, 13487 events. 9652/13487 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88350 event pairs, 6408 based on Foata normal form. 0/7906 useless extension candidates. Maximal degree in co-relation 25592. Up to 11905 conditions per place. [2024-11-19 09:48:53,248 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-19 09:48:53,248 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2024-11-19 09:48:53,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:48:53,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:48:53,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-19 09:48:53,250 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-19 09:48:53,250 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2024-11-19 09:48:53,251 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2024-11-19 09:48:53,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:48:53,253 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2024-11-19 09:48:53,254 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=149, PETRI_PLACES=61, PETRI_TRANSITIONS=60} [2024-11-19 09:48:53,254 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-11-19 09:48:53,255 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2024-11-19 09:48:53,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:53,255 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:53,255 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-19 09:48:53,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:48:53,256 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:53,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:53,256 INFO L85 PathProgramCache]: Analyzing trace with hash 27668907, now seen corresponding path program 1 times [2024-11-19 09:48:53,257 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:53,257 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084479453] [2024-11-19 09:48:53,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:53,257 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:53,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:53,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:48:53,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:53,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084479453] [2024-11-19 09:48:53,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084479453] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:48:53,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:48:53,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:48:53,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946157290] [2024-11-19 09:48:53,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:48:53,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:48:53,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:53,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:48:53,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:48:53,607 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:48:53,608 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 60 transitions, 149 flow. Second operand has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:53,608 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:53,608 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:48:53,608 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:55,055 INFO L124 PetriNetUnfolderBase]: 9653/13490 cut-off events. [2024-11-19 09:48:55,056 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-19 09:48:55,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25638 conditions, 13490 events. 9653/13490 cut-off events. For 25/25 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88382 event pairs, 6408 based on Foata normal form. 0/7908 useless extension candidates. Maximal degree in co-relation 25613. Up to 11904 conditions per place. [2024-11-19 09:48:55,193 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-19 09:48:55,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2024-11-19 09:48:55,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:48:55,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:48:55,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-19 09:48:55,197 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2024-11-19 09:48:55,197 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2024-11-19 09:48:55,197 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2024-11-19 09:48:55,198 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:55,201 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2024-11-19 09:48:55,201 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=183, PETRI_PLACES=66, PETRI_TRANSITIONS=63} [2024-11-19 09:48:55,203 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-19 09:48:55,203 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2024-11-19 09:48:55,204 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 24.8) internal successors, (124), 5 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:55,204 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:55,204 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:48:55,204 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:48:55,205 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:55,205 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 857701820, now seen corresponding path program 1 times [2024-11-19 09:48:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:55,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [881710] [2024-11-19 09:48:55,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:55,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,475 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-19 09:48:55,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:55,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [881710] [2024-11-19 09:48:55,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [881710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:55,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1421592455] [2024-11-19 09:48:55,477 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:55,478 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:55,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:55,480 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-19 09:48:55,482 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-19 09:48:55,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:55,570 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-19 09:48:55,578 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:55,658 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-19 09:48:55,910 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-19 09:48:55,911 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:56,078 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-19 09:48:56,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1421592455] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:56,079 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:56,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-19 09:48:56,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [851095668] [2024-11-19 09:48:56,080 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:56,080 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 09:48:56,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:56,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 09:48:56,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-19 09:48:56,166 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:48:56,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 63 transitions, 183 flow. Second operand has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:56,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:56,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:48:56,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:48:57,968 INFO L124 PetriNetUnfolderBase]: 9653/13489 cut-off events. [2024-11-19 09:48:57,968 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 09:48:58,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25651 conditions, 13489 events. 9653/13489 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88101 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25623. Up to 11904 conditions per place. [2024-11-19 09:48:58,073 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-11-19 09:48:58,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-11-19 09:48:58,074 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:48:58,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:48:58,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-19 09:48:58,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-11-19 09:48:58,075 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 187 transitions. [2024-11-19 09:48:58,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-11-19 09:48:58,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:48:58,077 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2024-11-19 09:48:58,077 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=192, PETRI_PLACES=69, PETRI_TRANSITIONS=62} [2024-11-19 09:48:58,079 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-19 09:48:58,079 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2024-11-19 09:48:58,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.363636363636363) internal successors, (279), 11 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:58,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:48:58,080 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-19 09:48:58,099 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-19 09:48:58,284 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:58,285 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:48:58,286 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:48:58,286 INFO L85 PathProgramCache]: Analyzing trace with hash 820044476, now seen corresponding path program 1 times [2024-11-19 09:48:58,286 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:48:58,286 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [76159666] [2024-11-19 09:48:58,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:48:58,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,533 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-19 09:48:58,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:48:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [76159666] [2024-11-19 09:48:58,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [76159666] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:48:58,534 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152427821] [2024-11-19 09:48:58,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:48:58,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:48:58,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:48:58,537 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-19 09:48:58,539 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-19 09:48:58,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:48:58,626 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:48:58,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:48:58,646 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-19 09:48:58,787 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-19 09:48:58,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:48:58,938 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-19 09:48:58,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152427821] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:48:58,940 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:48:58,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-19 09:48:58,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2053025583] [2024-11-19 09:48:58,943 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:48:58,944 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 09:48:58,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:48:58,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 09:48:58,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-19 09:48:59,012 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:48:59,013 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 62 transitions, 192 flow. Second operand has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:48:59,013 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:48:59,013 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:48:59,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:00,193 INFO L124 PetriNetUnfolderBase]: 9653/13488 cut-off events. [2024-11-19 09:49:00,193 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 09:49:00,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25655 conditions, 13488 events. 9653/13488 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 1096. Compared 88257 event pairs, 6408 based on Foata normal form. 0/7910 useless extension candidates. Maximal degree in co-relation 25622. Up to 11896 conditions per place. [2024-11-19 09:49:00,302 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2024-11-19 09:49:00,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 276 flow [2024-11-19 09:49:00,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-19 09:49:00,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-19 09:49:00,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-11-19 09:49:00,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-11-19 09:49:00,304 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 7 states and 213 transitions. [2024-11-19 09:49:00,305 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 276 flow [2024-11-19 09:49:00,306 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 242 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-19 09:49:00,307 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 178 flow [2024-11-19 09:49:00,307 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=178, PETRI_PLACES=66, PETRI_TRANSITIONS=61} [2024-11-19 09:49:00,308 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-19 09:49:00,309 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 178 flow [2024-11-19 09:49:00,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 25.307692307692307) internal successors, (329), 13 states have internal predecessors, (329), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:00,309 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:00,309 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:00,327 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-19 09:49:00,513 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:00,514 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:00,514 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:00,514 INFO L85 PathProgramCache]: Analyzing trace with hash -2134544703, now seen corresponding path program 1 times [2024-11-19 09:49:00,514 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:00,515 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [815005680] [2024-11-19 09:49:00,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:00,515 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:00,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:00,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:00,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:00,605 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [815005680] [2024-11-19 09:49:00,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [815005680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:00,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:00,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:00,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1423897431] [2024-11-19 09:49:00,606 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:00,606 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:00,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:00,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:00,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:00,616 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-19 09:49:00,617 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 61 transitions, 178 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:00,617 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:00,617 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-19 09:49:00,617 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:01,974 INFO L124 PetriNetUnfolderBase]: 10696/14779 cut-off events. [2024-11-19 09:49:01,974 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 09:49:02,028 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28409 conditions, 14779 events. 10696/14779 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 1147. Compared 96591 event pairs, 7188 based on Foata normal form. 298/9032 useless extension candidates. Maximal degree in co-relation 25256. Up to 11905 conditions per place. [2024-11-19 09:49:02,103 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-11-19 09:49:02,103 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 420 flow [2024-11-19 09:49:02,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:02,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:02,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-11-19 09:49:02,105 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-19 09:49:02,105 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 178 flow. Second operand 5 states and 207 transitions. [2024-11-19 09:49:02,105 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 420 flow [2024-11-19 09:49:02,106 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 381 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-19 09:49:02,107 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 192 flow [2024-11-19 09:49:02,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=192, PETRI_PLACES=67, PETRI_TRANSITIONS=63} [2024-11-19 09:49:02,108 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-19 09:49:02,108 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 192 flow [2024-11-19 09:49:02,109 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:02,109 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:02,109 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:02,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-19 09:49:02,109 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:02,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:02,110 INFO L85 PathProgramCache]: Analyzing trace with hash -296438428, now seen corresponding path program 1 times [2024-11-19 09:49:02,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:02,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31593939] [2024-11-19 09:49:02,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:02,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:02,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:02,247 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-19 09:49:02,247 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:02,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31593939] [2024-11-19 09:49:02,248 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31593939] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:02,248 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:02,248 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:02,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785066639] [2024-11-19 09:49:02,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:02,249 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:02,249 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:02,249 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:02,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:02,259 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:02,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 63 transitions, 192 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:02,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:02,260 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:02,260 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:03,203 INFO L124 PetriNetUnfolderBase]: 7339/10713 cut-off events. [2024-11-19 09:49:03,203 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2024-11-19 09:49:03,239 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22212 conditions, 10713 events. 7339/10713 cut-off events. For 1020/1020 co-relation queries the response was YES. Maximal size of possible extension queue 804. Compared 73007 event pairs, 5000 based on Foata normal form. 0/6785 useless extension candidates. Maximal degree in co-relation 19084. Up to 9261 conditions per place. [2024-11-19 09:49:03,292 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-19 09:49:03,292 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 272 flow [2024-11-19 09:49:03,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:03,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:03,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-19 09:49:03,293 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-11-19 09:49:03,293 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 192 flow. Second operand 5 states and 158 transitions. [2024-11-19 09:49:03,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 272 flow [2024-11-19 09:49:03,296 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:03,297 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 191 flow [2024-11-19 09:49:03,297 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=179, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=191, PETRI_PLACES=67, PETRI_TRANSITIONS=61} [2024-11-19 09:49:03,298 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-19 09:49:03,298 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 191 flow [2024-11-19 09:49:03,298 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:03,298 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:03,299 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:03,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 09:49:03,299 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:03,299 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:03,299 INFO L85 PathProgramCache]: Analyzing trace with hash -296438427, now seen corresponding path program 1 times [2024-11-19 09:49:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:03,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738549915] [2024-11-19 09:49:03,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:03,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:03,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:03,494 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-19 09:49:03,494 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:03,494 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738549915] [2024-11-19 09:49:03,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [738549915] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:49:03,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1218091144] [2024-11-19 09:49:03,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:03,495 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:49:03,495 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:03,497 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-19 09:49:03,499 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-19 09:49:03,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:03,590 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 09:49:03,593 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:03,602 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:49:03,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:49:03,661 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-19 09:49:03,680 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 09:49:03,680 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-19 09:49:03,704 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-19 09:49:03,705 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1218091144] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 09:49:03,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-19 09:49:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674455285] [2024-11-19 09:49:03,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:03,708 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:03,708 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:03,708 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:03,709 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-19 09:49:03,726 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:03,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 61 transitions, 191 flow. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:03,727 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:03,727 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:03,727 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:04,268 INFO L124 PetriNetUnfolderBase]: 4701/7063 cut-off events. [2024-11-19 09:49:04,268 INFO L125 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2024-11-19 09:49:04,281 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14076 conditions, 7063 events. 4701/7063 cut-off events. For 804/804 co-relation queries the response was YES. Maximal size of possible extension queue 549. Compared 47471 event pairs, 3256 based on Foata normal form. 0/4989 useless extension candidates. Maximal degree in co-relation 10914. Up to 6049 conditions per place. [2024-11-19 09:49:04,303 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 39 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-19 09:49:04,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 267 flow [2024-11-19 09:49:04,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:04,303 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:04,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-19 09:49:04,304 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-19 09:49:04,304 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 191 flow. Second operand 4 states and 132 transitions. [2024-11-19 09:49:04,304 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 267 flow [2024-11-19 09:49:04,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:04,306 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 180 flow [2024-11-19 09:49:04,306 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=65, PETRI_TRANSITIONS=59} [2024-11-19 09:49:04,307 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2024-11-19 09:49:04,307 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 180 flow [2024-11-19 09:49:04,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:04,307 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:04,308 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:04,320 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-19 09:49:04,510 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-19 09:49:04,510 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:04,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:04,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509022, now seen corresponding path program 1 times [2024-11-19 09:49:04,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:04,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295913348] [2024-11-19 09:49:04,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:04,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:04,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:04,582 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:04,582 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295913348] [2024-11-19 09:49:04,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295913348] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:04,583 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:04,583 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:49:04,583 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1324986464] [2024-11-19 09:49:04,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:04,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:04,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:04,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:04,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:04,592 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:04,592 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 59 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:04,592 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:04,592 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:04,592 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:04,928 INFO L124 PetriNetUnfolderBase]: 3151/5000 cut-off events. [2024-11-19 09:49:04,928 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-11-19 09:49:04,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9801 conditions, 5000 events. 3151/5000 cut-off events. For 565/565 co-relation queries the response was YES. Maximal size of possible extension queue 359. Compared 33845 event pairs, 2196 based on Foata normal form. 0/3932 useless extension candidates. Maximal degree in co-relation 7627. Up to 4084 conditions per place. [2024-11-19 09:49:04,954 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-19 09:49:04,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 256 flow [2024-11-19 09:49:04,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:04,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-19 09:49:04,955 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-19 09:49:04,955 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 180 flow. Second operand 4 states and 130 transitions. [2024-11-19 09:49:04,955 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 256 flow [2024-11-19 09:49:04,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:04,957 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 180 flow [2024-11-19 09:49:04,957 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=57} [2024-11-19 09:49:04,958 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-11-19 09:49:04,958 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 180 flow [2024-11-19 09:49:04,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:04,958 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:04,958 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:04,959 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:49:04,959 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:04,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509023, now seen corresponding path program 1 times [2024-11-19 09:49:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:04,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694030471] [2024-11-19 09:49:04,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:04,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:04,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:05,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:05,034 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:05,034 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1694030471] [2024-11-19 09:49:05,035 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1694030471] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:05,035 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:05,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:49:05,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1668821335] [2024-11-19 09:49:05,035 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:05,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:05,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:05,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:05,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:05,042 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-19 09:49:05,043 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 57 transitions, 180 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:05,043 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:05,043 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-19 09:49:05,043 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:05,443 INFO L124 PetriNetUnfolderBase]: 3669/5895 cut-off events. [2024-11-19 09:49:05,443 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-19 09:49:05,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11668 conditions, 5895 events. 3669/5895 cut-off events. For 683/683 co-relation queries the response was YES. Maximal size of possible extension queue 405. Compared 41164 event pairs, 2627 based on Foata normal form. 128/4903 useless extension candidates. Maximal degree in co-relation 9111. Up to 4094 conditions per place. [2024-11-19 09:49:05,476 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2024-11-19 09:49:05,477 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 352 flow [2024-11-19 09:49:05,477 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:05,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:05,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-19 09:49:05,478 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-19 09:49:05,478 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 180 flow. Second operand 4 states and 163 transitions. [2024-11-19 09:49:05,478 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 352 flow [2024-11-19 09:49:05,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:05,480 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 197 flow [2024-11-19 09:49:05,480 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=197, PETRI_PLACES=66, PETRI_TRANSITIONS=57} [2024-11-19 09:49:05,481 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-19 09:49:05,481 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 197 flow [2024-11-19 09:49:05,481 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:05,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:05,481 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:05,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 09:49:05,482 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:05,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:05,482 INFO L85 PathProgramCache]: Analyzing trace with hash 1396119792, now seen corresponding path program 1 times [2024-11-19 09:49:05,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:05,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2114167478] [2024-11-19 09:49:05,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:05,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:05,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:05,708 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-19 09:49:05,708 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:05,711 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2114167478] [2024-11-19 09:49:05,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2114167478] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:05,711 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:05,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:05,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2097171746] [2024-11-19 09:49:05,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:05,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:05,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:05,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:05,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:49:05,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-19 09:49:05,740 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 57 transitions, 197 flow. Second operand has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:05,740 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:05,740 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-19 09:49:05,741 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:06,047 INFO L124 PetriNetUnfolderBase]: 2429/4116 cut-off events. [2024-11-19 09:49:06,047 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2024-11-19 09:49:06,061 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8569 conditions, 4116 events. 2429/4116 cut-off events. For 957/957 co-relation queries the response was YES. Maximal size of possible extension queue 292. Compared 28790 event pairs, 1773 based on Foata normal form. 0/3544 useless extension candidates. Maximal degree in co-relation 6637. Up to 3292 conditions per place. [2024-11-19 09:49:06,074 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 33 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-19 09:49:06,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 265 flow [2024-11-19 09:49:06,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:06,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:06,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-19 09:49:06,076 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-19 09:49:06,076 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 197 flow. Second operand 4 states and 136 transitions. [2024-11-19 09:49:06,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 265 flow [2024-11-19 09:49:06,077 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:06,079 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 195 flow [2024-11-19 09:49:06,079 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=185, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=195, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2024-11-19 09:49:06,080 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-19 09:49:06,080 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 195 flow [2024-11-19 09:49:06,080 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 27.8) internal successors, (139), 5 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:06,080 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:06,080 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:06,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-19 09:49:06,081 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:06,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:06,081 INFO L85 PathProgramCache]: Analyzing trace with hash 270405486, now seen corresponding path program 1 times [2024-11-19 09:49:06,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:06,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475477169] [2024-11-19 09:49:06,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:06,082 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:06,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:06,276 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:06,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:06,277 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475477169] [2024-11-19 09:49:06,277 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475477169] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:06,277 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:06,277 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:06,277 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738315645] [2024-11-19 09:49:06,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:06,278 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:06,278 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:06,279 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:06,279 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:49:06,291 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:06,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 195 flow. Second operand has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:06,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:06,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:06,292 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:06,646 INFO L124 PetriNetUnfolderBase]: 2952/4743 cut-off events. [2024-11-19 09:49:06,646 INFO L125 PetriNetUnfolderBase]: For 1127/1127 co-relation queries the response was YES. [2024-11-19 09:49:06,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10275 conditions, 4743 events. 2952/4743 cut-off events. For 1127/1127 co-relation queries the response was YES. Maximal size of possible extension queue 321. Compared 31457 event pairs, 322 based on Foata normal form. 252/4847 useless extension candidates. Maximal degree in co-relation 8627. Up to 2532 conditions per place. [2024-11-19 09:49:06,672 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 61 selfloop transitions, 5 changer transitions 3/84 dead transitions. [2024-11-19 09:49:06,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 411 flow [2024-11-19 09:49:06,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:06,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:06,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-19 09:49:06,673 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-19 09:49:06,673 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 195 flow. Second operand 5 states and 182 transitions. [2024-11-19 09:49:06,673 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 411 flow [2024-11-19 09:49:06,675 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:06,677 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 179 flow [2024-11-19 09:49:06,677 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=179, PETRI_PLACES=69, PETRI_TRANSITIONS=53} [2024-11-19 09:49:06,678 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-19 09:49:06,679 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 179 flow [2024-11-19 09:49:06,679 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.2) internal successors, (141), 5 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:06,679 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:06,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:06,679 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 09:49:06,679 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:06,679 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:06,679 INFO L85 PathProgramCache]: Analyzing trace with hash -608167966, now seen corresponding path program 1 times [2024-11-19 09:49:06,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:06,680 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802602937] [2024-11-19 09:49:06,680 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:06,680 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:06,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:06,897 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-19 09:49:06,897 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:06,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802602937] [2024-11-19 09:49:06,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802602937] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:06,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:06,898 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:49:06,898 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263814965] [2024-11-19 09:49:06,898 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:06,898 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:06,899 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:06,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:06,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:49:06,916 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:06,917 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 53 transitions, 179 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:06,917 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:06,917 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:06,917 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:07,417 INFO L124 PetriNetUnfolderBase]: 3929/5758 cut-off events. [2024-11-19 09:49:07,417 INFO L125 PetriNetUnfolderBase]: For 3032/3578 co-relation queries the response was YES. [2024-11-19 09:49:07,447 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13988 conditions, 5758 events. 3929/5758 cut-off events. For 3032/3578 co-relation queries the response was YES. Maximal size of possible extension queue 348. Compared 33817 event pairs, 480 based on Foata normal form. 743/6467 useless extension candidates. Maximal degree in co-relation 13960. Up to 3462 conditions per place. [2024-11-19 09:49:07,468 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-19 09:49:07,468 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 459 flow [2024-11-19 09:49:07,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:49:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:49:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-19 09:49:07,469 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.547979797979798 [2024-11-19 09:49:07,469 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 179 flow. Second operand 6 states and 217 transitions. [2024-11-19 09:49:07,469 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 459 flow [2024-11-19 09:49:07,472 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 444 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:07,473 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 227 flow [2024-11-19 09:49:07,473 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=167, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=227, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2024-11-19 09:49:07,474 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-19 09:49:07,474 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 227 flow [2024-11-19 09:49:07,474 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:07,475 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:07,475 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:07,475 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-19 09:49:07,475 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:07,476 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:07,476 INFO L85 PathProgramCache]: Analyzing trace with hash -2055308796, now seen corresponding path program 2 times [2024-11-19 09:49:07,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:07,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60303811] [2024-11-19 09:49:07,476 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:07,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:07,500 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:07,501 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:07,643 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 09:49:07,644 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:49:07,644 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60303811] [2024-11-19 09:49:07,644 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [60303811] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:07,644 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:07,644 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:49:07,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772334984] [2024-11-19 09:49:07,645 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:07,645 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:49:07,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:49:07,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:49:07,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:49:07,653 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:07,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 227 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:07,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:07,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:07,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:08,531 INFO L124 PetriNetUnfolderBase]: 7315/11096 cut-off events. [2024-11-19 09:49:08,531 INFO L125 PetriNetUnfolderBase]: For 9679/10225 co-relation queries the response was YES. [2024-11-19 09:49:08,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29238 conditions, 11096 events. 7315/11096 cut-off events. For 9679/10225 co-relation queries the response was YES. Maximal size of possible extension queue 661. Compared 76167 event pairs, 1649 based on Foata normal form. 699/11500 useless extension candidates. Maximal degree in co-relation 29208. Up to 4207 conditions per place. [2024-11-19 09:49:08,622 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 87 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2024-11-19 09:49:08,622 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 595 flow [2024-11-19 09:49:08,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 09:49:08,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-19 09:49:08,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2024-11-19 09:49:08,624 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-19 09:49:08,624 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 227 flow. Second operand 6 states and 230 transitions. [2024-11-19 09:49:08,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 595 flow [2024-11-19 09:49:08,644 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 582 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:08,645 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 301 flow [2024-11-19 09:49:08,645 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=215, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=301, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-19 09:49:08,645 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2024-11-19 09:49:08,646 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 301 flow [2024-11-19 09:49:08,646 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:08,646 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:08,646 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:08,646 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-19 09:49:08,646 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:08,647 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:08,647 INFO L85 PathProgramCache]: Analyzing trace with hash -966993856, now seen corresponding path program 3 times [2024-11-19 09:49:08,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:49:08,647 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721747025] [2024-11-19 09:49:08,647 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-19 09:49:08,647 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:49:08,679 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-19 09:49:08,679 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-19 09:49:08,679 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:49:08,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:49:08,756 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:49:08,756 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:49:08,758 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-19 09:49:08,761 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-19 09:49:08,762 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-11-19 09:49:08,763 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-19 09:49:08,764 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-19 09:49:08,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-19 09:49:08,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-19 09:49:08,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-19 09:49:08,765 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2024-11-19 09:49:08,765 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 09:49:08,765 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:08,853 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:49:08,855 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:49:08,860 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:49:08 BasicIcfg [2024-11-19 09:49:08,860 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:49:08,861 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:49:08,861 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:49:08,861 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:49:08,862 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:48:48" (3/4) ... [2024-11-19 09:49:08,863 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:49:08,864 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:49:08,865 INFO L158 Benchmark]: Toolchain (without parser) took 22277.62ms. Allocated memory was 159.4MB in the beginning and 2.8GB in the end (delta: 2.7GB). Free memory was 104.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.5GB. Max. memory is 16.1GB. [2024-11-19 09:49:08,866 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:08,866 INFO L158 Benchmark]: CACSL2BoogieTranslator took 356.82ms. Allocated memory is still 159.4MB. Free memory was 104.1MB in the beginning and 88.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-19 09:49:08,866 INFO L158 Benchmark]: Boogie Procedure Inliner took 52.63ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:49:08,867 INFO L158 Benchmark]: Boogie Preprocessor took 90.64ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 82.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:49:08,867 INFO L158 Benchmark]: RCFGBuilder took 1277.29ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 82.2MB in the beginning and 123.3MB in the end (delta: -41.1MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. [2024-11-19 09:49:08,867 INFO L158 Benchmark]: TraceAbstraction took 20488.89ms. Allocated memory was 239.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 122.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. [2024-11-19 09:49:08,867 INFO L158 Benchmark]: Witness Printer took 3.85ms. Allocated memory is still 2.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:49:08,869 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 159.4MB. Free memory is still 119.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 356.82ms. Allocated memory is still 159.4MB. Free memory was 104.1MB in the beginning and 88.5MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 52.63ms. Allocated memory is still 159.4MB. Free memory was 88.5MB in the beginning and 85.6MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 90.64ms. Allocated memory is still 159.4MB. Free memory was 85.6MB in the beginning and 82.2MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1277.29ms. Allocated memory was 159.4MB in the beginning and 239.1MB in the end (delta: 79.7MB). Free memory was 82.2MB in the beginning and 123.3MB in the end (delta: -41.1MB). Peak memory consumption was 46.8MB. Max. memory is 16.1GB. * TraceAbstraction took 20488.89ms. Allocated memory was 239.1MB in the beginning and 2.8GB in the end (delta: 2.6GB). Free memory was 122.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 1.4GB. Max. memory is 16.1GB. * Witness Printer took 3.85ms. Allocated memory is still 2.8GB. Free memory was 1.3GB in the beginning and 1.3GB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 21]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 21. Possible FailurePath: [L40] 0 int* q1; [L41] 0 int* q2; [L42] 0 int i, j, total, C, N, M, q1_front, q1_back, q2_front, q2_back, n1, n2; [L124] 0 pthread_t t1, t2, t3, t4; [L126] 0 C = __VERIFIER_nondet_int() [L127] 0 M = __VERIFIER_nondet_int() [L128] 0 N = __VERIFIER_nondet_int() [L130] 0 q1_front = __VERIFIER_nondet_int() [L131] 0 q1_back = __VERIFIER_nondet_int() [L132] 0 q2_front = __VERIFIER_nondet_int() [L133] 0 q2_back = __VERIFIER_nondet_int() [L135] 0 n1 = __VERIFIER_nondet_int() [L136] 0 n2 = __VERIFIER_nondet_int() [L137] CALL, EXPR 0 create_fresh_int_array(n1) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=0, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND TRUE 0 i < size [L165] 0 arr[i] = __VERIFIER_nondet_int() [L164] 0 i++ VAL [C=3, M=0, N=1, \old(size)=1, arr={-1:0}, i=0, i=1, j=0, n1=1, n2=0, q1={0:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=1, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L137] RET, EXPR 0 create_fresh_int_array(n1) [L137] 0 q1 = create_fresh_int_array(n1) [L138] CALL, EXPR 0 create_fresh_int_array(n2) [L160] CALL 0 assume_abort_if_not(size >= 0) [L37] COND FALSE 0 !(!cond) [L160] RET 0 assume_abort_if_not(size >= 0) [L161] CALL 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L37] COND FALSE 0 !(!cond) [L161] RET 0 assume_abort_if_not(size <= (((size_t) 4294967295) / sizeof(int))) [L163] 0 int* arr = (int*)malloc(sizeof(int) * (size_t)size); [L164] 0 int i = 0; VAL [C=3, M=0, N=1, \old(size)=0, arr={-4:0}, i=0, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={0:0}, q2_back=0, q2_front=0, size=0, total=0] [L164] COND FALSE 0 !(i < size) [L167] 0 return arr; [L138] RET, EXPR 0 create_fresh_int_array(n2) [L138] 0 q2 = create_fresh_int_array(n2) [L140] CALL 0 assume_abort_if_not(C > -2147483648) [L37] COND FALSE 0 !(!cond) [L140] RET 0 assume_abort_if_not(C > -2147483648) [L141] CALL 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L37] COND FALSE 0 !(!cond) [L141] RET 0 assume_abort_if_not(N > M && M >= 0 && C > 0 && q1_front == q1_back && q2_front == q2_back) [L144] FCALL, FORK 0 pthread_create(&t1, 0, thread1, 0) VAL [C=3, M=0, N=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, total=0] [L49] 1 _Bool cond = i < N; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND TRUE 1 \read(cond) VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=0, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] EXPR 1 q1[q1_back] [L53] EXPR 1 q1_back >= 0 && q1_back < n1 && q1[q1_back] == C [L53] CALL 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L37] COND FALSE 1 !(!cond) [L53] RET 1 assume_abort_if_not(q1_back >= 0 && q1_back < n1 && q1[q1_back] == C) [L54] 1 i++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L145] FCALL, FORK 0 pthread_create(&t2, 0, thread2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, total=0] [L69] 2 _Bool cond = j < M; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L71] COND FALSE 2 !(\read(cond)) [L84] 2 return 0; [L146] FCALL, FORK 0 pthread_create(&t3, 0, thread3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, total=0] [L89] 3 _Bool cond = i < N || q1_front < q1_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L147] FCALL, FORK 0 pthread_create(&t4, 0, thread4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L107] 4 _Bool cond = j < M || q2_front < q2_back; VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=0, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L109] COND FALSE 4 !(\read(cond)) [L120] 4 return 0; [L91] COND FALSE 3 !(\read(cond)) [L102] 3 return 0; [L57] 1 q1_back++ VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L60] 1 cond = i < N VAL [C=3, M=0, N=1, \old(_argptr)={0:0}, _argptr={0:0}, cond=0, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] [L51] COND FALSE 1 !(\read(cond)) [L64] 1 return 0; [L148] FCALL, JOIN 1 pthread_join(t1, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L149] FCALL, JOIN 2 pthread_join(t2, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L150] FCALL, JOIN 3 pthread_join(t3, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L151] FCALL, JOIN 4 pthread_join(t4, 0) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, t1=-3, t2=-2, t3=-1, t4=0, total=0] [L153] CALL 0 assume_abort_if_not(total <= 0) [L37] COND FALSE 0 !(!cond) [L153] RET 0 assume_abort_if_not(total <= 0) [L154] CALL 0 reach_error() [L21] 0 __assert_fail("0", "popl20-bad-buffer-mult-alt.wvr.c", 21, __extension__ __PRETTY_FUNCTION__) VAL [C=3, M=0, N=1, i=1, j=0, n1=1, n2=0, q1={-1:0}, q1_back=1, q1_front=0, q2={-4:0}, q2_back=0, q2_front=0, total=0] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 123]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 145]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 147]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 144]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 146]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 99 locations, 26 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 20.2s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 15.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.9s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 538 mSDsluCounter, 43 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 22 mSDsCounter, 49 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1991 IncrementalHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 49 mSolverCounterUnsat, 21 mSDtfsCounter, 1991 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 88 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 48 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=301occurred in iteration=14, InterpolantAutomatonStates: 68, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.4s InterpolantComputationTime, 236 NumberOfCodeBlocks, 236 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 193 ConstructedInterpolants, 1 QuantifiedInterpolants, 1611 SizeOfPredicates, 8 NumberOfNonLiveVariables, 342 ConjunctsInSsa, 45 ConjunctsInUnsatCore, 19 InterpolantComputations, 12 PerfectInterpolantSequences, 9/20 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:49:08,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:49:11,531 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:49:11,608 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:49:11,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:49:11,613 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:49:11,640 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:49:11,640 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:49:11,643 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:49:11,643 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:49:11,644 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:49:11,644 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:49:11,645 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:49:11,645 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:49:11,647 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:49:11,648 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:49:11,648 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:49:11,648 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:49:11,649 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:49:11,649 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:49:11,649 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:49:11,649 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:49:11,650 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:49:11,651 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:49:11,651 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:49:11,651 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:49:11,652 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:49:11,652 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:49:11,652 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:49:11,653 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:49:11,653 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:49:11,653 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:49:11,654 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:49:11,654 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:49:11,654 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:49:11,655 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:49:11,655 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:49:11,656 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:49:11,656 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:49:11,656 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:49:11,656 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:49:11,657 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:49:11,658 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:49:11,658 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:49:11,658 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:49:11,659 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 -> fdebcc32a5907a5601109dc3fb4ac7750aa88ce6953c83cffe48f47befc15286 [2024-11-19 09:49:12,019 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:49:12,047 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:49:12,051 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:49:12,053 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:49:12,053 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:49:12,055 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:49:13,686 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:49:13,926 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:49:13,927 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:49:13,943 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5ecad1b/c3fe1fb6d676413fac08f9e203d2397e/FLAG260c071b1 [2024-11-19 09:49:13,961 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e5ecad1b/c3fe1fb6d676413fac08f9e203d2397e [2024-11-19 09:49:13,964 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:49:13,965 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:49:13,968 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:49:13,968 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:49:13,974 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:49:13,975 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:49:13" (1/1) ... [2024-11-19 09:49:13,977 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40adaf0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:13, skipping insertion in model container [2024-11-19 09:49:13,977 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:49:13" (1/1) ... [2024-11-19 09:49:14,005 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:49:14,282 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-19 09:49:14,291 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:49:14,309 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:49:14,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:49:14,372 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:49:14,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14 WrapperNode [2024-11-19 09:49:14,372 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:49:14,373 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:49:14,373 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:49:14,373 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:49:14,380 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,397 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,430 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 300 [2024-11-19 09:49:14,430 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:49:14,431 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:49:14,431 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:49:14,431 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:49:14,442 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,442 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,448 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,473 INFO L175 MemorySlicer]: Split 8 memory accesses to 2 slices as follows [2, 6]. 75 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 2 writes are split as follows [0, 2]. [2024-11-19 09:49:14,473 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,474 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,483 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,487 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,492 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,495 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:49:14,496 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:49:14,496 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:49:14,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:49:14,498 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (1/1) ... [2024-11-19 09:49:14,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:49:14,515 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:49:14,532 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:49:14,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-19 09:49:14,586 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-19 09:49:14,587 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-19 09:49:14,588 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-19 09:49:14,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-19 09:49:14,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-19 09:49:14,589 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:49:14,589 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:49:14,589 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:49:14,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-19 09:49:14,590 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-19 09:49:14,591 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:49:14,744 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:49:14,746 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:49:15,388 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:49:15,388 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:49:15,833 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:49:15,835 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-19 09:49:15,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:49:15 BoogieIcfgContainer [2024-11-19 09:49:15,836 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:49:15,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:49:15,839 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:49:15,843 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:49:15,843 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:49:13" (1/3) ... [2024-11-19 09:49:15,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78385eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:49:15, skipping insertion in model container [2024-11-19 09:49:15,844 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:49:14" (2/3) ... [2024-11-19 09:49:15,844 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@78385eb4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:49:15, skipping insertion in model container [2024-11-19 09:49:15,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:49:15" (3/3) ... [2024-11-19 09:49:15,847 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-19 09:49:15,867 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:49:15,867 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-19 09:49:15,867 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:49:15,949 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-19 09:49:15,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-19 09:49:16,033 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-19 09:49:16,034 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:49:16,038 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79 conditions, 62 events. 6/62 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 147 event pairs, 0 based on Foata normal form. 0/42 useless extension candidates. Maximal degree in co-relation 49. Up to 2 conditions per place. [2024-11-19 09:49:16,038 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-19 09:49:16,041 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-19 09:49:16,053 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:49:16,063 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;@432ff32a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:49:16,063 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-19 09:49:16,068 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:49:16,068 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-19 09:49:16,068 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:49:16,068 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:16,069 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:49:16,069 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:16,074 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:16,074 INFO L85 PathProgramCache]: Analyzing trace with hash 866650, now seen corresponding path program 1 times [2024-11-19 09:49:16,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:16,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1282805574] [2024-11-19 09:49:16,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:16,088 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:16,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:16,091 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:16,093 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:49:16,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:16,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:49:16,194 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:16,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:49:16,277 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:16,277 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:16,278 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:16,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1282805574] [2024-11-19 09:49:16,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1282805574] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:16,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:16,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-19 09:49:16,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608563063] [2024-11-19 09:49:16,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:16,289 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:49:16,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:16,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:49:16,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:49:16,350 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:16,353 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 61 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:16,353 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:16,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:16,355 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:18,524 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events. [2024-11-19 09:49:18,525 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-19 09:49:18,569 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25668 conditions, 13134 events. 9651/13134 cut-off events. For 223/223 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82617 event pairs, 6408 based on Foata normal form. 1/7299 useless extension candidates. Maximal degree in co-relation 24078. Up to 11896 conditions per place. [2024-11-19 09:49:18,671 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-19 09:49:18,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-19 09:49:18,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:49:18,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:49:18,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-19 09:49:18,684 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-19 09:49:18,686 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-19 09:49:18,687 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-19 09:49:18,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:49:18,709 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-19 09:49:18,714 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=58, PETRI_TRANSITIONS=57} [2024-11-19 09:49:18,763 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-19 09:49:18,764 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-19 09:49:18,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:18,764 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:18,764 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-19 09:49:18,785 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:18,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:18,968 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:18,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:18,970 INFO L85 PathProgramCache]: Analyzing trace with hash 866651, now seen corresponding path program 1 times [2024-11-19 09:49:18,970 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:18,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1481430973] [2024-11-19 09:49:18,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:18,971 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:18,971 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:18,974 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:18,977 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:49:19,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:19,076 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:49:19,078 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:19,101 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-19 09:49:19,201 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:19,201 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:19,201 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:19,201 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1481430973] [2024-11-19 09:49:19,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1481430973] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:19,202 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:19,202 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:19,202 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181695596] [2024-11-19 09:49:19,202 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:19,204 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:19,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:19,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:19,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:19,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:19,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 57 transitions, 126 flow. Second operand has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:19,244 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:19,244 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:19,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:20,961 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events. [2024-11-19 09:49:20,962 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-19 09:49:21,005 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25278 conditions, 13140 events. 9653/13140 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82455 event pairs, 6408 based on Foata normal form. 0/7302 useless extension candidates. Maximal degree in co-relation 25242. Up to 11905 conditions per place. [2024-11-19 09:49:21,102 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-19 09:49:21,102 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 232 flow [2024-11-19 09:49:21,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:21,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:21,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-11-19 09:49:21,106 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-19 09:49:21,106 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 144 transitions. [2024-11-19 09:49:21,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 232 flow [2024-11-19 09:49:21,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:49:21,112 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2024-11-19 09:49:21,112 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=178, PETRI_PLACES=62, PETRI_TRANSITIONS=63} [2024-11-19 09:49:21,113 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-11-19 09:49:21,114 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2024-11-19 09:49:21,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.75) internal successors, (99), 4 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:21,118 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:21,118 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-19 09:49:21,123 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:49:21,318 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:21,319 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:21,320 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:21,320 INFO L85 PathProgramCache]: Analyzing trace with hash 832880270, now seen corresponding path program 1 times [2024-11-19 09:49:21,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:21,321 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [901781345] [2024-11-19 09:49:21,321 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:21,321 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:21,321 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:21,324 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:21,326 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:49:21,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:21,431 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-19 09:49:21,432 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:21,447 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-19 09:49:21,663 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-19 09:49:21,663 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:21,962 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-19 09:49:21,962 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:21,962 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [901781345] [2024-11-19 09:49:21,962 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [901781345] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:21,962 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:21,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 09:49:21,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334563220] [2024-11-19 09:49:21,963 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:21,963 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:49:21,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:21,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:49:21,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:49:22,126 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:22,127 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 63 transitions, 178 flow. Second operand has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:22,128 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:22,128 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:22,128 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:24,313 INFO L124 PetriNetUnfolderBase]: 9659/13158 cut-off events. [2024-11-19 09:49:24,314 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-19 09:49:24,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25356 conditions, 13158 events. 9659/13158 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 1066. Compared 82550 event pairs, 6408 based on Foata normal form. 0/7318 useless extension candidates. Maximal degree in co-relation 25253. Up to 11908 conditions per place. [2024-11-19 09:49:24,425 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2024-11-19 09:49:24,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 384 flow [2024-11-19 09:49:24,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:49:24,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:49:24,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2024-11-19 09:49:24,430 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-19 09:49:24,431 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 310 transitions. [2024-11-19 09:49:24,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 384 flow [2024-11-19 09:49:24,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-19 09:49:24,436 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2024-11-19 09:49:24,437 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=178, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=340, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-19 09:49:24,438 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-19 09:49:24,439 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2024-11-19 09:49:24,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 25.0) internal successors, (250), 10 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:24,440 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:24,440 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:24,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:24,642 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:24,643 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:24,644 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:24,644 INFO L85 PathProgramCache]: Analyzing trace with hash 1724412099, now seen corresponding path program 1 times [2024-11-19 09:49:24,644 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:24,644 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [758533475] [2024-11-19 09:49:24,644 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:24,645 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:24,648 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:24,649 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:49:24,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:24,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:49:24,724 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:24,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:24,775 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:24,775 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:24,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [758533475] [2024-11-19 09:49:24,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [758533475] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:24,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:24,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:24,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213072210] [2024-11-19 09:49:24,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:24,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:24,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:24,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:24,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:24,789 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-19 09:49:24,790 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 340 flow. Second operand has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:24,790 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:24,790 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-19 09:49:24,790 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:26,288 INFO L124 PetriNetUnfolderBase]: 10705/14769 cut-off events. [2024-11-19 09:49:26,288 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 09:49:26,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28518 conditions, 14769 events. 10705/14769 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 1097. Compared 95736 event pairs, 7188 based on Foata normal form. 299/8998 useless extension candidates. Maximal degree in co-relation 28430. Up to 11923 conditions per place. [2024-11-19 09:49:26,405 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 98 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-11-19 09:49:26,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 700 flow [2024-11-19 09:49:26,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:26,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:26,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-11-19 09:49:26,407 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2024-11-19 09:49:26,407 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 178 transitions. [2024-11-19 09:49:26,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 700 flow [2024-11-19 09:49:26,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 606 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-19 09:49:26,412 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2024-11-19 09:49:26,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=276, PETRI_DIFFERENCE_MINUEND_PLACES=70, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=295, PETRI_PLACES=74, PETRI_TRANSITIONS=81} [2024-11-19 09:49:26,413 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-19 09:49:26,413 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2024-11-19 09:49:26,414 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.25) internal successors, (109), 4 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:26,414 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:26,414 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:26,419 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:26,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:26,615 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:26,615 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:26,615 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289958, now seen corresponding path program 1 times [2024-11-19 09:49:26,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:26,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1659806253] [2024-11-19 09:49:26,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:26,616 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:26,617 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:26,620 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:26,621 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:49:26,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:26,689 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-19 09:49:26,691 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:26,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:49:26,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:26,724 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:26,725 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:26,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1659806253] [2024-11-19 09:49:26,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1659806253] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:26,725 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:26,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:49:26,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1867201393] [2024-11-19 09:49:26,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:26,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:26,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:26,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:26,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:26,756 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:26,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 81 transitions, 295 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:26,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:26,757 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:26,757 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:27,788 INFO L124 PetriNetUnfolderBase]: 7182/10538 cut-off events. [2024-11-19 09:49:27,788 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-11-19 09:49:27,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22435 conditions, 10538 events. 7182/10538 cut-off events. For 855/855 co-relation queries the response was YES. Maximal size of possible extension queue 769. Compared 71537 event pairs, 4852 based on Foata normal form. 0/6695 useless extension candidates. Maximal degree in co-relation 22359. Up to 9010 conditions per place. [2024-11-19 09:49:27,850 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-11-19 09:49:27,851 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 411 flow [2024-11-19 09:49:27,851 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:27,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:27,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-19 09:49:27,852 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-19 09:49:27,852 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 4 states and 134 transitions. [2024-11-19 09:49:27,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 411 flow [2024-11-19 09:49:27,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:27,856 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 299 flow [2024-11-19 09:49:27,856 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=74, PETRI_TRANSITIONS=79} [2024-11-19 09:49:27,856 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-19 09:49:27,857 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 299 flow [2024-11-19 09:49:27,857 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:27,857 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:27,857 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:27,861 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:49:28,057 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:28,058 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:28,058 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:28,059 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289957, now seen corresponding path program 1 times [2024-11-19 09:49:28,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:28,059 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [300929043] [2024-11-19 09:49:28,059 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:28,059 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:28,059 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:28,063 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:28,064 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:49:28,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:28,143 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:49:28,145 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:28,205 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:28,206 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:28,206 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:28,206 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [300929043] [2024-11-19 09:49:28,206 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [300929043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:28,206 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:28,206 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:49:28,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455286824] [2024-11-19 09:49:28,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:28,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:28,207 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:28,207 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:28,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:28,226 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-19 09:49:28,227 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 79 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:28,227 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:28,227 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-19 09:49:28,227 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:29,350 INFO L124 PetriNetUnfolderBase]: 8415/12414 cut-off events. [2024-11-19 09:49:29,350 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-19 09:49:29,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 26771 conditions, 12414 events. 8415/12414 cut-off events. For 1061/1061 co-relation queries the response was YES. Maximal size of possible extension queue 922. Compared 87551 event pairs, 5813 based on Foata normal form. 278/8300 useless extension candidates. Maximal degree in co-relation 26693. Up to 9041 conditions per place. [2024-11-19 09:49:29,455 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2024-11-19 09:49:29,456 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 535 flow [2024-11-19 09:49:29,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:49:29,456 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:49:29,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-11-19 09:49:29,457 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2024-11-19 09:49:29,457 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 299 flow. Second operand 4 states and 171 transitions. [2024-11-19 09:49:29,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 535 flow [2024-11-19 09:49:29,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 520 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:29,463 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 307 flow [2024-11-19 09:49:29,464 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=284, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=307, PETRI_PLACES=75, PETRI_TRANSITIONS=79} [2024-11-19 09:49:29,464 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-11-19 09:49:29,465 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 307 flow [2024-11-19 09:49:29,465 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:29,465 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:29,465 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:29,469 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:29,666 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:29,666 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:29,667 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:29,667 INFO L85 PathProgramCache]: Analyzing trace with hash -417123471, now seen corresponding path program 1 times [2024-11-19 09:49:29,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:29,667 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1363034835] [2024-11-19 09:49:29,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:29,668 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:29,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:29,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:29,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:49:29,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:29,761 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 09:49:29,764 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:29,799 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-19 09:49:29,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:49:30,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:49:30,006 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-19 09:49:30,024 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:49:30,025 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 13 treesize of output 13 [2024-11-19 09:49:30,112 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-19 09:49:30,113 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:30,993 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-19 09:49:30,993 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:30,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1363034835] [2024-11-19 09:49:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1363034835] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:30,994 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:30,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-19 09:49:30,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543593638] [2024-11-19 09:49:30,994 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:30,994 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:49:30,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:30,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:49:30,999 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:49:31,758 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-11-19 09:49:31,759 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 75 places, 79 transitions, 307 flow. Second operand has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:31,759 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:31,759 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-11-19 09:49:31,759 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:38,873 INFO L124 PetriNetUnfolderBase]: 18393/27640 cut-off events. [2024-11-19 09:49:38,873 INFO L125 PetriNetUnfolderBase]: For 5198/5198 co-relation queries the response was YES. [2024-11-19 09:49:38,967 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63602 conditions, 27640 events. 18393/27640 cut-off events. For 5198/5198 co-relation queries the response was YES. Maximal size of possible extension queue 1593. Compared 215219 event pairs, 12645 based on Foata normal form. 0/19455 useless extension candidates. Maximal degree in co-relation 43495. Up to 9616 conditions per place. [2024-11-19 09:49:39,074 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 107 selfloop transitions, 46 changer transitions 0/170 dead transitions. [2024-11-19 09:49:39,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 170 transitions, 979 flow [2024-11-19 09:49:39,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 09:49:39,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-19 09:49:39,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 433 transitions. [2024-11-19 09:49:39,077 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4686147186147186 [2024-11-19 09:49:39,077 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 307 flow. Second operand 14 states and 433 transitions. [2024-11-19 09:49:39,077 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 170 transitions, 979 flow [2024-11-19 09:49:39,085 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 970 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:39,088 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 618 flow [2024-11-19 09:49:39,088 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=301, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=618, PETRI_PLACES=94, PETRI_TRANSITIONS=105} [2024-11-19 09:49:39,089 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-11-19 09:49:39,089 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 618 flow [2024-11-19 09:49:39,089 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 23.4) internal successors, (234), 10 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:39,090 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:39,090 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:39,094 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:49:39,290 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:39,291 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:39,291 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash -417123472, now seen corresponding path program 1 times [2024-11-19 09:49:39,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:39,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1451174079] [2024-11-19 09:49:39,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:39,292 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:39,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:39,295 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:39,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:49:39,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:39,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-19 09:49:39,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:39,378 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:49:39,402 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:49:39,402 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:49:39,444 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-19 09:49:39,444 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:49:39,444 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:39,444 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1451174079] [2024-11-19 09:49:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1451174079] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:49:39,445 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:49:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:49:39,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1589879109] [2024-11-19 09:49:39,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:49:39,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:49:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:39,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:49:39,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:49:39,470 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:39,470 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 105 transitions, 618 flow. Second operand has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:39,470 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:39,470 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:39,470 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:40,919 INFO L124 PetriNetUnfolderBase]: 11532/18365 cut-off events. [2024-11-19 09:49:40,919 INFO L125 PetriNetUnfolderBase]: For 9067/9067 co-relation queries the response was YES. [2024-11-19 09:49:41,018 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42288 conditions, 18365 events. 11532/18365 cut-off events. For 9067/9067 co-relation queries the response was YES. Maximal size of possible extension queue 1021. Compared 145004 event pairs, 8046 based on Foata normal form. 0/14951 useless extension candidates. Maximal degree in co-relation 34726. Up to 14950 conditions per place. [2024-11-19 09:49:41,086 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 69 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2024-11-19 09:49:41,086 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 778 flow [2024-11-19 09:49:41,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:49:41,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:49:41,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-19 09:49:41,087 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-11-19 09:49:41,087 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 618 flow. Second operand 5 states and 156 transitions. [2024-11-19 09:49:41,087 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 778 flow [2024-11-19 09:49:41,099 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-19 09:49:41,101 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 637 flow [2024-11-19 09:49:41,101 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=637, PETRI_PLACES=95, PETRI_TRANSITIONS=103} [2024-11-19 09:49:41,102 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2024-11-19 09:49:41,102 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 637 flow [2024-11-19 09:49:41,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 25.75) internal successors, (103), 4 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:41,102 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:41,102 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-19 09:49:41,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:41,302 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:41,303 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:41,303 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:41,304 INFO L85 PathProgramCache]: Analyzing trace with hash -913765977, now seen corresponding path program 2 times [2024-11-19 09:49:41,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:41,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1108614797] [2024-11-19 09:49:41,304 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 09:49:41,304 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:41,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:41,305 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:41,306 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-19 09:49:41,376 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 09:49:41,376 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 09:49:41,381 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-19 09:49:41,384 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:41,397 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-19 09:49:41,647 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:41,648 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:42,132 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:49:42,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:42,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1108614797] [2024-11-19 09:49:42,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1108614797] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:42,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:42,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-19 09:49:42,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1606913412] [2024-11-19 09:49:42,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:42,134 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-19 09:49:42,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:42,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-19 09:49:42,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-19 09:49:42,453 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:42,454 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 103 transitions, 637 flow. Second operand has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:42,454 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:42,454 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:42,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:49:45,302 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 09:49:47,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result VALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2024-11-19 09:49:53,496 INFO L124 PetriNetUnfolderBase]: 11562/18455 cut-off events. [2024-11-19 09:49:53,496 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2024-11-19 09:49:53,603 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42787 conditions, 18455 events. 11562/18455 cut-off events. For 9255/9255 co-relation queries the response was YES. Maximal size of possible extension queue 1024. Compared 145996 event pairs, 8046 based on Foata normal form. 30/15071 useless extension candidates. Maximal degree in co-relation 35119. Up to 14995 conditions per place. [2024-11-19 09:49:53,694 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2024-11-19 09:49:53,694 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 1421 flow [2024-11-19 09:49:53,695 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-19 09:49:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-19 09:49:53,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 636 transitions. [2024-11-19 09:49:53,698 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-11-19 09:49:53,698 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 637 flow. Second operand 22 states and 636 transitions. [2024-11-19 09:49:53,698 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 1421 flow [2024-11-19 09:49:53,718 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1382 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:49:53,721 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2024-11-19 09:49:53,721 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=616, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=103, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=1394, PETRI_PLACES=119, PETRI_TRANSITIONS=163} [2024-11-19 09:49:53,722 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2024-11-19 09:49:53,722 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2024-11-19 09:49:53,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 25.571428571428573) internal successors, (358), 14 states have internal predecessors, (358), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:53,722 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:49:53,722 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:49:53,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2024-11-19 09:49:53,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:53,923 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-19 09:49:53,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:49:53,924 INFO L85 PathProgramCache]: Analyzing trace with hash -1036105231, now seen corresponding path program 1 times [2024-11-19 09:49:53,924 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:49:53,924 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1298561716] [2024-11-19 09:49:53,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:49:53,924 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:49:53,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:49:53,927 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:49:53,929 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-19 09:49:54,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:49:54,005 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-19 09:49:54,007 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:49:54,018 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-19 09:49:54,271 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-19 09:49:54,272 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:49:55,102 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-19 09:49:55,102 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:49:55,102 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1298561716] [2024-11-19 09:49:55,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1298561716] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:49:55,102 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:49:55,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-19 09:49:55,103 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682740140] [2024-11-19 09:49:55,103 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:49:55,103 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 09:49:55,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:49:55,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 09:49:55,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-19 09:49:55,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-19 09:49:55,364 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 163 transitions, 1394 flow. Second operand has 10 states, 10 states have (on average 25.7) internal successors, (257), 10 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:49:55,364 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:49:55,364 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-19 09:49:55,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand