./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 803cd42f Calling Ultimate with: /root/.sdkman/candidates/java/current/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-803cd42-m [2024-11-22 21:46:21,732 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:46:21,807 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-22 21:46:21,813 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:46:21,815 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:46:21,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:46:21,842 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:46:21,843 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:46:21,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:46:21,845 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:46:21,846 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:46:21,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:46:21,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:46:21,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:46:21,849 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:46:21,849 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:46:21,850 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:46:21,850 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:46:21,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:46:21,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:46:21,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:46:21,854 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:46:21,855 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:46:21,855 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:46:21,855 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:46:21,855 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:46:21,856 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:46:21,856 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:46:21,856 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:46:21,857 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:46:21,857 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:46:21,857 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:46:21,857 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:46:21,858 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:46:21,858 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:46:21,858 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:46:21,858 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-22 21:46:21,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-22 21:46:21,859 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:46:21,859 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:46:21,859 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:46:21,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:46:21,861 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-22 21:46:22,112 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:46:22,138 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:46:22,141 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:46:22,143 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:46:22,143 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:46:22,144 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-22 21:46:23,598 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:46:23,821 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:46:23,822 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-22 21:46:23,836 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1712a612/81220876807a4ea1b0cd4a3024c59f3f/FLAGec3c3c256 [2024-11-22 21:46:24,185 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f1712a612/81220876807a4ea1b0cd4a3024c59f3f [2024-11-22 21:46:24,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:46:24,189 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:46:24,190 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:46:24,190 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:46:24,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:46:24,198 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,199 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3ff1eb01 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24, skipping insertion in model container [2024-11-22 21:46:24,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,228 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:46:24,477 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-22 21:46:24,482 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:46:24,495 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:46:24,560 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:46:24,581 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:46:24,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24 WrapperNode [2024-11-22 21:46:24,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:46:24,586 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:46:24,586 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:46:24,587 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:46:24,592 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,610 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,659 INFO L138 Inliner]: procedures = 25, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 313 [2024-11-22 21:46:24,660 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:46:24,660 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:46:24,662 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:46:24,662 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:46:24,672 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,673 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,681 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,710 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-22 21:46:24,714 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,714 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,730 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,735 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,737 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,739 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,746 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:46:24,747 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:46:24,747 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:46:24,747 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:46:24,748 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (1/1) ... [2024-11-22 21:46:24,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:46:24,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:46:24,784 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-22 21:46:24,788 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-22 21:46:24,825 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:46:24,825 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 21:46:24,825 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 21:46:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 21:46:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 21:46:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 21:46:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 21:46:24,826 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 21:46:24,826 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:46:24,827 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:46:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:46:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:46:24,828 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:46:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-22 21:46:24,828 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-22 21:46:24,830 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:46:24,935 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:46:24,936 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:46:25,360 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:46:25,360 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:46:25,717 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:46:25,717 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-22 21:46:25,718 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:25 BoogieIcfgContainer [2024-11-22 21:46:25,718 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:46:25,720 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:46:25,720 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:46:25,723 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:46:25,723 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:46:24" (1/3) ... [2024-11-22 21:46:25,724 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ba986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:25, skipping insertion in model container [2024-11-22 21:46:25,724 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:24" (2/3) ... [2024-11-22 21:46:25,726 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@575ba986 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:25, skipping insertion in model container [2024-11-22 21:46:25,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:25" (3/3) ... [2024-11-22 21:46:25,728 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-22 21:46:25,745 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:46:25,746 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-22 21:46:25,746 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:46:25,868 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 21:46:25,937 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-22 21:46:25,976 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-22 21:46:25,976 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 21:46:25,981 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-22 21:46:25,981 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-22 21:46:25,984 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-22 21:46:25,994 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:46:26,000 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;@3da6d625, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:46:26,000 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-22 21:46:26,004 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:46:26,004 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-22 21:46:26,004 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:46:26,005 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:26,005 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:46:26,006 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:26,010 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:26,011 INFO L85 PathProgramCache]: Analyzing trace with hash 892478, now seen corresponding path program 1 times [2024-11-22 21:46:26,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:26,020 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [716421091] [2024-11-22 21:46:26,020 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:26,020 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:26,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:26,302 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-22 21:46:26,302 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:26,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [716421091] [2024-11-22 21:46:26,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [716421091] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:26,303 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:26,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:46:26,305 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415991433] [2024-11-22 21:46:26,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:26,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:46:26,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:26,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:46:26,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:46:26,354 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:26,357 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-22 21:46:26,357 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:26,357 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:26,362 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:28,109 INFO L124 PetriNetUnfolderBase]: 9651/13484 cut-off events. [2024-11-22 21:46:28,110 INFO L125 PetriNetUnfolderBase]: For 298/298 co-relation queries the response was YES. [2024-11-22 21:46:28,155 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-22 21:46:28,267 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-22 21:46:28,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-22 21:46:28,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:46:28,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:46:28,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-22 21:46:28,281 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-22 21:46:28,282 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-22 21:46:28,283 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-22 21:46:28,337 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 21:46:28,340 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-22 21:46:28,342 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-22 21:46:28,348 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-22 21:46:28,348 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-22 21:46:28,349 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-22 21:46:28,349 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:28,349 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:46:28,349 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-22 21:46:28,349 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:28,350 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:28,350 INFO L85 PathProgramCache]: Analyzing trace with hash 892479, now seen corresponding path program 1 times [2024-11-22 21:46:28,350 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:28,351 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1163103523] [2024-11-22 21:46:28,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:28,351 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:28,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:28,634 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-22 21:46:28,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:28,635 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1163103523] [2024-11-22 21:46:28,635 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1163103523] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:28,635 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:28,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:46:28,636 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333172974] [2024-11-22 21:46:28,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:28,637 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:28,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:28,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:28,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:28,658 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:28,659 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-22 21:46:28,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:28,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:28,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:30,048 INFO L124 PetriNetUnfolderBase]: 9652/13487 cut-off events. [2024-11-22 21:46:30,048 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-22 21:46:30,077 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-22 21:46:30,138 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 39 selfloop transitions, 4 changer transitions 0/60 dead transitions. [2024-11-22 21:46:30,139 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 60 transitions, 218 flow [2024-11-22 21:46:30,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:30,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:30,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 140 transitions. [2024-11-22 21:46:30,141 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5303030303030303 [2024-11-22 21:46:30,142 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 140 transitions. [2024-11-22 21:46:30,142 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 60 transitions, 218 flow [2024-11-22 21:46:30,143 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 60 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:30,144 INFO L231 Difference]: Finished difference. Result has 61 places, 60 transitions, 149 flow [2024-11-22 21:46:30,145 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-22 21:46:30,146 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -7 predicate places. [2024-11-22 21:46:30,146 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 60 transitions, 149 flow [2024-11-22 21:46:30,146 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-22 21:46:30,146 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:30,146 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-22 21:46:30,147 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-22 21:46:30,147 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:30,147 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:30,148 INFO L85 PathProgramCache]: Analyzing trace with hash 27668907, now seen corresponding path program 1 times [2024-11-22 21:46:30,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:30,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [502071669] [2024-11-22 21:46:30,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:30,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:30,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:30,367 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-22 21:46:30,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:30,368 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [502071669] [2024-11-22 21:46:30,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [502071669] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:30,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:30,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:46:30,369 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974875811] [2024-11-22 21:46:30,369 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:30,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:30,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:30,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:30,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:46:30,387 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:30,388 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-22 21:46:30,388 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:30,388 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:30,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:31,840 INFO L124 PetriNetUnfolderBase]: 9653/13490 cut-off events. [2024-11-22 21:46:31,841 INFO L125 PetriNetUnfolderBase]: For 25/25 co-relation queries the response was YES. [2024-11-22 21:46:31,887 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-22 21:46:31,968 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-22 21:46:31,968 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 63 transitions, 247 flow [2024-11-22 21:46:31,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:46:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:46:31,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2024-11-22 21:46:31,971 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5060606060606061 [2024-11-22 21:46:31,971 INFO L175 Difference]: Start difference. First operand has 61 places, 60 transitions, 149 flow. Second operand 5 states and 167 transitions. [2024-11-22 21:46:32,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 63 transitions, 247 flow [2024-11-22 21:46:32,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 244 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:46:32,131 INFO L231 Difference]: Finished difference. Result has 66 places, 63 transitions, 183 flow [2024-11-22 21:46:32,131 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-22 21:46:32,132 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-22 21:46:32,132 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 63 transitions, 183 flow [2024-11-22 21:46:32,132 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-22 21:46:32,132 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:32,132 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-22 21:46:32,132 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-22 21:46:32,133 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:32,133 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:32,133 INFO L85 PathProgramCache]: Analyzing trace with hash 857701820, now seen corresponding path program 1 times [2024-11-22 21:46:32,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:32,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164849462] [2024-11-22 21:46:32,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:32,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:32,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:32,330 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-22 21:46:32,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164849462] [2024-11-22 21:46:32,330 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164849462] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:46:32,330 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477497959] [2024-11-22 21:46:32,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:32,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:46:32,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:46:32,334 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-22 21:46:32,336 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-22 21:46:32,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:32,414 INFO L255 TraceCheckSpWp]: Trace formula consists of 87 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 21:46:32,418 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:32,480 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-22 21:46:32,672 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-22 21:46:32,672 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:46:32,798 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-22 21:46:32,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477497959] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:46:32,799 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:46:32,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 9 [2024-11-22 21:46:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152089615] [2024-11-22 21:46:32,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:46:32,800 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-22 21:46:32,800 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-22 21:46:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=76, Unknown=0, NotChecked=0, Total=110 [2024-11-22 21:46:32,874 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:32,875 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-22 21:46:32,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:32,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:32,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:34,288 INFO L124 PetriNetUnfolderBase]: 9653/13489 cut-off events. [2024-11-22 21:46:34,289 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-22 21:46:34,324 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-22 21:46:34,386 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 7 changer transitions 0/62 dead transitions. [2024-11-22 21:46:34,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 269 flow [2024-11-22 21:46:34,387 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:46:34,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:46:34,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 187 transitions. [2024-11-22 21:46:34,389 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4722222222222222 [2024-11-22 21:46:34,389 INFO L175 Difference]: Start difference. First operand has 66 places, 63 transitions, 183 flow. Second operand 6 states and 187 transitions. [2024-11-22 21:46:34,389 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 269 flow [2024-11-22 21:46:34,390 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 62 transitions, 268 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:46:34,391 INFO L231 Difference]: Finished difference. Result has 69 places, 62 transitions, 192 flow [2024-11-22 21:46:34,391 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-22 21:46:34,392 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-22 21:46:34,392 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 62 transitions, 192 flow [2024-11-22 21:46:34,393 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-22 21:46:34,393 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:34,393 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1, 1] [2024-11-22 21:46:34,403 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-22 21:46:34,597 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-22 21:46:34,598 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:34,598 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:34,599 INFO L85 PathProgramCache]: Analyzing trace with hash 820044476, now seen corresponding path program 1 times [2024-11-22 21:46:34,599 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:34,599 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [492365083] [2024-11-22 21:46:34,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:34,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:34,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:34,860 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-22 21:46:34,860 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:34,860 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [492365083] [2024-11-22 21:46:34,860 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [492365083] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:46:34,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701135124] [2024-11-22 21:46:34,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:34,861 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:46:34,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:46:34,865 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-22 21:46:34,866 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-22 21:46:34,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:34,954 INFO L255 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-22 21:46:34,956 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:34,981 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-22 21:46:35,118 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-22 21:46:35,118 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:46:35,287 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-22 21:46:35,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701135124] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:46:35,290 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-22 21:46:35,290 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2024-11-22 21:46:35,290 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457948157] [2024-11-22 21:46:35,290 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-22 21:46:35,291 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-22 21:46:35,291 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:35,291 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-22 21:46:35,292 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=117, Unknown=0, NotChecked=0, Total=156 [2024-11-22 21:46:35,364 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:35,365 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-22 21:46:35,365 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:35,365 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:35,365 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:36,979 INFO L124 PetriNetUnfolderBase]: 9653/13488 cut-off events. [2024-11-22 21:46:36,980 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-22 21:46:37,025 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-22 21:46:37,118 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 32 selfloop transitions, 12 changer transitions 0/61 dead transitions. [2024-11-22 21:46:37,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 61 transitions, 276 flow [2024-11-22 21:46:37,119 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-22 21:46:37,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-22 21:46:37,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 213 transitions. [2024-11-22 21:46:37,120 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.461038961038961 [2024-11-22 21:46:37,120 INFO L175 Difference]: Start difference. First operand has 69 places, 62 transitions, 192 flow. Second operand 7 states and 213 transitions. [2024-11-22 21:46:37,120 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 61 transitions, 276 flow [2024-11-22 21:46:37,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 61 transitions, 242 flow, removed 3 selfloop flow, removed 8 redundant places. [2024-11-22 21:46:37,123 INFO L231 Difference]: Finished difference. Result has 66 places, 61 transitions, 178 flow [2024-11-22 21:46:37,123 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-22 21:46:37,124 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-22 21:46:37,124 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 61 transitions, 178 flow [2024-11-22 21:46:37,125 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-22 21:46:37,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:37,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:37,135 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-22 21:46:37,329 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-22 21:46:37,330 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:37,331 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:37,331 INFO L85 PathProgramCache]: Analyzing trace with hash -2134544703, now seen corresponding path program 1 times [2024-11-22 21:46:37,331 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:37,331 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828082226] [2024-11-22 21:46:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:37,332 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:37,439 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-22 21:46:37,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:37,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828082226] [2024-11-22 21:46:37,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828082226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:37,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:37,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:46:37,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [610953925] [2024-11-22 21:46:37,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:37,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:37,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:37,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:37,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:37,450 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:46:37,450 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-22 21:46:37,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:37,451 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:46:37,451 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:38,366 INFO L124 PetriNetUnfolderBase]: 10696/14779 cut-off events. [2024-11-22 21:46:38,367 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-22 21:46:38,399 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-22 21:46:38,464 INFO L140 encePairwiseOnDemand]: 55/66 looper letters, 69 selfloop transitions, 5 changer transitions 0/91 dead transitions. [2024-11-22 21:46:38,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 91 transitions, 420 flow [2024-11-22 21:46:38,466 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:46:38,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:46:38,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 207 transitions. [2024-11-22 21:46:38,466 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6272727272727273 [2024-11-22 21:46:38,467 INFO L175 Difference]: Start difference. First operand has 66 places, 61 transitions, 178 flow. Second operand 5 states and 207 transitions. [2024-11-22 21:46:38,467 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 91 transitions, 420 flow [2024-11-22 21:46:38,468 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 91 transitions, 381 flow, removed 6 selfloop flow, removed 5 redundant places. [2024-11-22 21:46:38,469 INFO L231 Difference]: Finished difference. Result has 67 places, 63 transitions, 192 flow [2024-11-22 21:46:38,469 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-22 21:46:38,473 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-22 21:46:38,473 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 63 transitions, 192 flow [2024-11-22 21:46:38,473 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-22 21:46:38,473 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:38,474 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:38,474 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-22 21:46:38,474 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:38,474 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:38,475 INFO L85 PathProgramCache]: Analyzing trace with hash -296438428, now seen corresponding path program 1 times [2024-11-22 21:46:38,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:38,475 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1285253018] [2024-11-22 21:46:38,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:38,475 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:38,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:38,573 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-22 21:46:38,573 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:38,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1285253018] [2024-11-22 21:46:38,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1285253018] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:38,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:38,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:46:38,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1721938483] [2024-11-22 21:46:38,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:38,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:38,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:38,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:38,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:38,584 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:38,584 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-22 21:46:38,584 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:38,584 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:38,585 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:39,558 INFO L124 PetriNetUnfolderBase]: 7339/10713 cut-off events. [2024-11-22 21:46:39,558 INFO L125 PetriNetUnfolderBase]: For 1020/1020 co-relation queries the response was YES. [2024-11-22 21:46:39,570 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-22 21:46:39,605 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 38 selfloop transitions, 6 changer transitions 0/61 dead transitions. [2024-11-22 21:46:39,605 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 61 transitions, 272 flow [2024-11-22 21:46:39,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:46:39,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:46:39,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2024-11-22 21:46:39,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.47878787878787876 [2024-11-22 21:46:39,606 INFO L175 Difference]: Start difference. First operand has 67 places, 63 transitions, 192 flow. Second operand 5 states and 158 transitions. [2024-11-22 21:46:39,607 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 61 transitions, 272 flow [2024-11-22 21:46:39,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 61 transitions, 267 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:39,609 INFO L231 Difference]: Finished difference. Result has 67 places, 61 transitions, 191 flow [2024-11-22 21:46:39,609 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-22 21:46:39,610 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -1 predicate places. [2024-11-22 21:46:39,610 INFO L471 AbstractCegarLoop]: Abstraction has has 67 places, 61 transitions, 191 flow [2024-11-22 21:46:39,610 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-22 21:46:39,610 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:39,610 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:39,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-22 21:46:39,611 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:39,611 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:39,611 INFO L85 PathProgramCache]: Analyzing trace with hash -296438427, now seen corresponding path program 1 times [2024-11-22 21:46:39,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:39,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [816200318] [2024-11-22 21:46:39,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:39,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:39,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:39,780 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-22 21:46:39,781 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [816200318] [2024-11-22 21:46:39,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [816200318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-22 21:46:39,781 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181548168] [2024-11-22 21:46:39,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:39,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-22 21:46:39,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:46:39,784 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-22 21:46:39,785 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-22 21:46:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:39,867 INFO L255 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 21:46:39,869 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:39,883 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-22 21:46:39,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:46:39,933 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-22 21:46:39,948 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-22 21:46:39,949 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-22 21:46:39,973 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-22 21:46:39,974 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:46:39,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181548168] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:39,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-22 21:46:39,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [3] total 5 [2024-11-22 21:46:39,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234332962] [2024-11-22 21:46:39,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:39,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:39,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:39,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:39,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2024-11-22 21:46:39,995 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:39,995 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-22 21:46:39,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:39,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:39,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:40,467 INFO L124 PetriNetUnfolderBase]: 4701/7063 cut-off events. [2024-11-22 21:46:40,468 INFO L125 PetriNetUnfolderBase]: For 804/804 co-relation queries the response was YES. [2024-11-22 21:46:40,481 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-22 21:46:40,508 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 39 selfloop transitions, 3 changer transitions 0/59 dead transitions. [2024-11-22 21:46:40,508 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 59 transitions, 267 flow [2024-11-22 21:46:40,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:40,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:40,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 132 transitions. [2024-11-22 21:46:40,509 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5 [2024-11-22 21:46:40,509 INFO L175 Difference]: Start difference. First operand has 67 places, 61 transitions, 191 flow. Second operand 4 states and 132 transitions. [2024-11-22 21:46:40,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 59 transitions, 267 flow [2024-11-22 21:46:40,510 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 59 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:46:40,511 INFO L231 Difference]: Finished difference. Result has 65 places, 59 transitions, 180 flow [2024-11-22 21:46:40,511 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-22 21:46:40,512 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -3 predicate places. [2024-11-22 21:46:40,512 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 59 transitions, 180 flow [2024-11-22 21:46:40,513 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-22 21:46:40,513 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:40,513 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:40,522 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-22 21:46:40,717 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-22 21:46:40,718 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:40,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:40,718 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509022, now seen corresponding path program 1 times [2024-11-22 21:46:40,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:40,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896730364] [2024-11-22 21:46:40,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:40,719 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:40,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:40,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-22 21:46:40,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:40,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896730364] [2024-11-22 21:46:40,775 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896730364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:40,775 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:40,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:46:40,776 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720005140] [2024-11-22 21:46:40,776 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:40,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:40,776 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:40,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:40,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:40,786 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:40,787 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-22 21:46:40,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:40,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:40,787 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:41,098 INFO L124 PetriNetUnfolderBase]: 3151/5000 cut-off events. [2024-11-22 21:46:41,098 INFO L125 PetriNetUnfolderBase]: For 565/565 co-relation queries the response was YES. [2024-11-22 21:46:41,108 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-22 21:46:41,120 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 36 selfloop transitions, 4 changer transitions 0/57 dead transitions. [2024-11-22 21:46:41,121 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 256 flow [2024-11-22 21:46:41,121 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:41,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:41,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-22 21:46:41,122 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-22 21:46:41,122 INFO L175 Difference]: Start difference. First operand has 65 places, 59 transitions, 180 flow. Second operand 4 states and 130 transitions. [2024-11-22 21:46:41,122 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 256 flow [2024-11-22 21:46:41,123 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 57 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:41,124 INFO L231 Difference]: Finished difference. Result has 64 places, 57 transitions, 180 flow [2024-11-22 21:46:41,124 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-22 21:46:41,124 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -4 predicate places. [2024-11-22 21:46:41,124 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 57 transitions, 180 flow [2024-11-22 21:46:41,124 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-22 21:46:41,125 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:41,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:41,125 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-22 21:46:41,125 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:41,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:41,125 INFO L85 PathProgramCache]: Analyzing trace with hash 1161509023, now seen corresponding path program 1 times [2024-11-22 21:46:41,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:41,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671744947] [2024-11-22 21:46:41,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:41,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:41,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:41,203 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-22 21:46:41,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:41,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671744947] [2024-11-22 21:46:41,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671744947] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:41,207 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:41,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:46:41,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572256595] [2024-11-22 21:46:41,207 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:41,208 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:41,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:41,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:41,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:41,217 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:46:41,217 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-22 21:46:41,217 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:41,217 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:46:41,217 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:41,632 INFO L124 PetriNetUnfolderBase]: 3669/5895 cut-off events. [2024-11-22 21:46:41,632 INFO L125 PetriNetUnfolderBase]: For 683/683 co-relation queries the response was YES. [2024-11-22 21:46:41,644 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-22 21:46:41,659 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/77 dead transitions. [2024-11-22 21:46:41,659 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 77 transitions, 352 flow [2024-11-22 21:46:41,659 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:41,660 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:41,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 163 transitions. [2024-11-22 21:46:41,660 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6174242424242424 [2024-11-22 21:46:41,660 INFO L175 Difference]: Start difference. First operand has 64 places, 57 transitions, 180 flow. Second operand 4 states and 163 transitions. [2024-11-22 21:46:41,660 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 77 transitions, 352 flow [2024-11-22 21:46:41,661 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 77 transitions, 347 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:41,663 INFO L231 Difference]: Finished difference. Result has 66 places, 57 transitions, 197 flow [2024-11-22 21:46:41,663 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-22 21:46:41,663 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-22 21:46:41,663 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 57 transitions, 197 flow [2024-11-22 21:46:41,664 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-22 21:46:41,664 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:41,664 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:41,664 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-22 21:46:41,664 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:41,664 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:41,665 INFO L85 PathProgramCache]: Analyzing trace with hash 1396119792, now seen corresponding path program 1 times [2024-11-22 21:46:41,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:41,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1691313608] [2024-11-22 21:46:41,665 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:41,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:41,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:41,845 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-22 21:46:41,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:41,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1691313608] [2024-11-22 21:46:41,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1691313608] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:41,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:41,846 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:46:41,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630165915] [2024-11-22 21:46:41,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:41,846 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:41,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:41,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:41,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:46:41,872 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:46:41,872 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-22 21:46:41,872 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:41,872 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:46:41,872 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:42,178 INFO L124 PetriNetUnfolderBase]: 2429/4116 cut-off events. [2024-11-22 21:46:42,178 INFO L125 PetriNetUnfolderBase]: For 957/957 co-relation queries the response was YES. [2024-11-22 21:46:42,186 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-22 21:46:42,196 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 33 selfloop transitions, 5 changer transitions 0/55 dead transitions. [2024-11-22 21:46:42,196 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 55 transitions, 265 flow [2024-11-22 21:46:42,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:42,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:42,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 136 transitions. [2024-11-22 21:46:42,198 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5151515151515151 [2024-11-22 21:46:42,198 INFO L175 Difference]: Start difference. First operand has 66 places, 57 transitions, 197 flow. Second operand 4 states and 136 transitions. [2024-11-22 21:46:42,198 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 55 transitions, 265 flow [2024-11-22 21:46:42,199 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 55 transitions, 261 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:46:42,200 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 195 flow [2024-11-22 21:46:42,200 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-22 21:46:42,201 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -2 predicate places. [2024-11-22 21:46:42,201 INFO L471 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 195 flow [2024-11-22 21:46:42,201 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-22 21:46:42,202 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:42,202 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-22 21:46:42,202 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-22 21:46:42,202 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:42,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:42,202 INFO L85 PathProgramCache]: Analyzing trace with hash 270405486, now seen corresponding path program 1 times [2024-11-22 21:46:42,203 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:42,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [548422309] [2024-11-22 21:46:42,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:42,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:42,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:42,377 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-22 21:46:42,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:42,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [548422309] [2024-11-22 21:46:42,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [548422309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:42,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:42,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:46:42,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603152103] [2024-11-22 21:46:42,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:42,379 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:42,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:42,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:42,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:46:42,391 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:42,392 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-22 21:46:42,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:42,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:42,392 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:42,721 INFO L124 PetriNetUnfolderBase]: 2952/4743 cut-off events. [2024-11-22 21:46:42,721 INFO L125 PetriNetUnfolderBase]: For 1127/1127 co-relation queries the response was YES. [2024-11-22 21:46:42,732 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-22 21:46:42,743 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 61 selfloop transitions, 5 changer transitions 3/84 dead transitions. [2024-11-22 21:46:42,743 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 84 transitions, 411 flow [2024-11-22 21:46:42,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:46:42,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:46:42,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2024-11-22 21:46:42,744 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5515151515151515 [2024-11-22 21:46:42,744 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 195 flow. Second operand 5 states and 182 transitions. [2024-11-22 21:46:42,744 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 84 transitions, 411 flow [2024-11-22 21:46:42,745 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 84 transitions, 404 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:42,746 INFO L231 Difference]: Finished difference. Result has 69 places, 53 transitions, 179 flow [2024-11-22 21:46:42,746 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-22 21:46:42,747 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 1 predicate places. [2024-11-22 21:46:42,747 INFO L471 AbstractCegarLoop]: Abstraction has has 69 places, 53 transitions, 179 flow [2024-11-22 21:46:42,747 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-22 21:46:42,747 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:42,747 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-22 21:46:42,747 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-22 21:46:42,747 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:42,748 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -608167966, now seen corresponding path program 1 times [2024-11-22 21:46:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:42,748 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [293663996] [2024-11-22 21:46:42,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:42,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:42,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:42,931 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-22 21:46:42,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:42,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [293663996] [2024-11-22 21:46:42,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [293663996] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:42,932 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:42,932 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-22 21:46:42,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488863006] [2024-11-22 21:46:42,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:42,934 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:42,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:42,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:42,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:46:42,950 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:42,951 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-22 21:46:42,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:42,951 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:42,951 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:43,446 INFO L124 PetriNetUnfolderBase]: 3929/5758 cut-off events. [2024-11-22 21:46:43,447 INFO L125 PetriNetUnfolderBase]: For 3032/3578 co-relation queries the response was YES. [2024-11-22 21:46:43,461 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-22 21:46:43,475 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 70 selfloop transitions, 8 changer transitions 0/93 dead transitions. [2024-11-22 21:46:43,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 93 transitions, 459 flow [2024-11-22 21:46:43,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:46:43,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:46:43,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 217 transitions. [2024-11-22 21:46:43,477 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.547979797979798 [2024-11-22 21:46:43,477 INFO L175 Difference]: Start difference. First operand has 69 places, 53 transitions, 179 flow. Second operand 6 states and 217 transitions. [2024-11-22 21:46:43,477 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 93 transitions, 459 flow [2024-11-22 21:46:43,479 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 93 transitions, 444 flow, removed 2 selfloop flow, removed 4 redundant places. [2024-11-22 21:46:43,480 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 227 flow [2024-11-22 21:46:43,480 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-22 21:46:43,481 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 3 predicate places. [2024-11-22 21:46:43,481 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 227 flow [2024-11-22 21:46:43,481 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-22 21:46:43,481 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:43,481 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-22 21:46:43,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-22 21:46:43,481 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:43,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:43,482 INFO L85 PathProgramCache]: Analyzing trace with hash -2055308796, now seen corresponding path program 2 times [2024-11-22 21:46:43,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:43,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94894927] [2024-11-22 21:46:43,482 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:46:43,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:43,514 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:46:43,515 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:46:43,645 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-22 21:46:43,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-22 21:46:43,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94894927] [2024-11-22 21:46:43,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94894927] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:43,646 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:43,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-22 21:46:43,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [357304385] [2024-11-22 21:46:43,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:43,647 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-22 21:46:43,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-22 21:46:43,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-22 21:46:43,648 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-22 21:46:43,654 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:43,655 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-22 21:46:43,655 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:43,655 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:43,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:44,533 INFO L124 PetriNetUnfolderBase]: 7315/11096 cut-off events. [2024-11-22 21:46:44,534 INFO L125 PetriNetUnfolderBase]: For 9679/10225 co-relation queries the response was YES. [2024-11-22 21:46:44,557 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-22 21:46:44,590 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 87 selfloop transitions, 10 changer transitions 0/112 dead transitions. [2024-11-22 21:46:44,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 112 transitions, 595 flow [2024-11-22 21:46:44,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-22 21:46:44,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-22 21:46:44,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 230 transitions. [2024-11-22 21:46:44,591 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5808080808080808 [2024-11-22 21:46:44,592 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 227 flow. Second operand 6 states and 230 transitions. [2024-11-22 21:46:44,592 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 112 transitions, 595 flow [2024-11-22 21:46:44,604 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 112 transitions, 582 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:44,605 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 301 flow [2024-11-22 21:46:44,605 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-22 21:46:44,605 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 10 predicate places. [2024-11-22 21:46:44,605 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 301 flow [2024-11-22 21:46:44,605 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-22 21:46:44,606 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:44,606 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-22 21:46:44,606 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-22 21:46:44,606 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:44,606 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:44,606 INFO L85 PathProgramCache]: Analyzing trace with hash -966993856, now seen corresponding path program 3 times [2024-11-22 21:46:44,606 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-22 21:46:44,606 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579695790] [2024-11-22 21:46:44,607 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-22 21:46:44,607 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-22 21:46:44,633 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-22 21:46:44,633 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-22 21:46:44,634 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-22 21:46:44,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-22 21:46:44,698 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-22 21:46:44,699 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-22 21:46:44,700 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-22 21:46:44,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-22 21:46:44,703 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-22 21:46:44,704 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5ASSERT_VIOLATIONMEMORY_LEAK (14 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (13 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (12 of 26 remaining) [2024-11-22 21:46:44,705 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (11 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (10 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-22 21:46:44,706 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-22 21:46:44,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-22 21:46:44,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread3Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-22 21:46:44,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-22 21:46:44,707 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location thread4Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 26 remaining) [2024-11-22 21:46:44,707 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-22 21:46:44,707 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:44,804 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-22 21:46:44,805 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-22 21:46:44,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.11 09:46:44 BasicIcfg [2024-11-22 21:46:44,809 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-22 21:46:44,809 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-22 21:46:44,811 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-22 21:46:44,811 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-22 21:46:44,812 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:25" (3/4) ... [2024-11-22 21:46:44,813 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-22 21:46:44,814 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-22 21:46:44,815 INFO L158 Benchmark]: Toolchain (without parser) took 20625.67ms. Allocated memory was 159.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 86.7MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 588.5MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,815 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-22 21:46:44,815 INFO L158 Benchmark]: CACSL2BoogieTranslator took 395.19ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 127.7MB in the end (delta: -41.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,815 INFO L158 Benchmark]: Boogie Procedure Inliner took 73.51ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.7MB in the beginning and 173.1MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,815 INFO L158 Benchmark]: Boogie Preprocessor took 86.02ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,816 INFO L158 Benchmark]: RCFGBuilder took 970.98ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 65.1MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,816 INFO L158 Benchmark]: TraceAbstraction took 19089.52ms. Allocated memory was 203.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 65.1MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 518.7MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,816 INFO L158 Benchmark]: Witness Printer took 4.68ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-22 21:46:44,819 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.24ms. Allocated memory is still 159.4MB. Free memory was 110.3MB in the beginning and 110.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 395.19ms. Allocated memory is still 159.4MB. Free memory was 86.5MB in the beginning and 127.7MB in the end (delta: -41.2MB). Peak memory consumption was 19.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 73.51ms. Allocated memory was 159.4MB in the beginning and 203.4MB in the end (delta: 44.0MB). Free memory was 127.7MB in the beginning and 173.1MB in the end (delta: -45.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 86.02ms. Allocated memory is still 203.4MB. Free memory was 173.1MB in the beginning and 168.9MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 970.98ms. Allocated memory is still 203.4MB. Free memory was 168.9MB in the beginning and 65.1MB in the end (delta: 103.8MB). Peak memory consumption was 104.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19089.52ms. Allocated memory was 203.4MB in the beginning and 2.5GB in the end (delta: 2.3GB). Free memory was 65.1MB in the beginning and 1.8GB in the end (delta: -1.8GB). Peak memory consumption was 518.7MB. Max. memory is 16.1GB. * Witness Printer took 4.68ms. Allocated memory is still 2.5GB. Free memory was 1.8GB in the beginning and 1.8GB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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: 18.8s, OverallIterations: 15, TraceHistogramMax: 2, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 14.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 616 SdHoareTripleChecker+Valid, 1.8s 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.8s 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, 2.9s 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-22 21:46:44,842 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/current/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-803cd42-m [2024-11-22 21:46:47,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-22 21:46:47,307 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-22 21:46:47,313 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-22 21:46:47,314 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-22 21:46:47,346 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-22 21:46:47,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-22 21:46:47,348 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-22 21:46:47,349 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-22 21:46:47,350 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-22 21:46:47,351 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-22 21:46:47,351 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-22 21:46:47,352 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-22 21:46:47,352 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-22 21:46:47,352 INFO L153 SettingsManager]: * Use SBE=true [2024-11-22 21:46:47,352 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-22 21:46:47,353 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-22 21:46:47,356 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-22 21:46:47,356 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-22 21:46:47,356 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-22 21:46:47,357 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-22 21:46:47,358 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-22 21:46:47,358 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-22 21:46:47,358 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-22 21:46:47,358 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-22 21:46:47,358 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-22 21:46:47,359 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-22 21:46:47,359 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-22 21:46:47,359 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-22 21:46:47,359 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-22 21:46:47,359 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-22 21:46:47,360 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-22 21:46:47,360 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-22 21:46:47,360 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-22 21:46:47,360 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-22 21:46:47,361 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:46:47,361 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-22 21:46:47,362 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-22 21:46:47,363 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-22 21:46:47,363 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-22 21:46:47,363 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-22 21:46:47,364 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-22 21:46:47,364 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-22 21:46:47,364 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-22 21:46:47,364 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-22 21:46:47,699 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-22 21:46:47,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-22 21:46:47,723 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-22 21:46:47,724 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-22 21:46:47,725 INFO L274 PluginConnector]: CDTParser initialized [2024-11-22 21:46:47,726 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-22 21:46:49,229 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-22 21:46:49,431 INFO L384 CDTParser]: Found 1 translation units. [2024-11-22 21:46:49,432 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/weaver/popl20-bad-buffer-mult-alt3.wvr.c [2024-11-22 21:46:49,443 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c597b351b/de2a7969476b47e080a897591c921dba/FLAG25b985cf1 [2024-11-22 21:46:49,459 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c597b351b/de2a7969476b47e080a897591c921dba [2024-11-22 21:46:49,462 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-22 21:46:49,463 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-22 21:46:49,465 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-22 21:46:49,467 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-22 21:46:49,472 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-22 21:46:49,473 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,474 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@14957bfe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49, skipping insertion in model container [2024-11-22 21:46:49,474 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,506 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-22 21:46:49,775 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-22 21:46:49,783 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:46:49,799 INFO L200 MainTranslator]: Completed pre-run [2024-11-22 21:46:49,839 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-22 21:46:49,863 INFO L204 MainTranslator]: Completed translation [2024-11-22 21:46:49,864 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49 WrapperNode [2024-11-22 21:46:49,864 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-22 21:46:49,865 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-22 21:46:49,865 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-22 21:46:49,865 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-22 21:46:49,871 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,885 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,917 INFO L138 Inliner]: procedures = 27, calls = 60, calls flagged for inlining = 18, calls inlined = 22, statements flattened = 300 [2024-11-22 21:46:49,917 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-22 21:46:49,918 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-22 21:46:49,918 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-22 21:46:49,918 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-22 21:46:49,932 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,932 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,937 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,963 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-22 21:46:49,963 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,963 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,975 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,979 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,981 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,983 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,989 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-22 21:46:49,990 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-22 21:46:49,991 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-22 21:46:49,991 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-22 21:46:49,991 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (1/1) ... [2024-11-22 21:46:49,997 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-22 21:46:50,010 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-22 21:46:50,022 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-22 21:46:50,031 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-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-22 21:46:50,068 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2024-11-22 21:46:50,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2024-11-22 21:46:50,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2024-11-22 21:46:50,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2024-11-22 21:46:50,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2024-11-22 21:46:50,069 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2024-11-22 21:46:50,069 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2024-11-22 21:46:50,070 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2024-11-22 21:46:50,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2024-11-22 21:46:50,070 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2024-11-22 21:46:50,070 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-22 21:46:50,070 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-22 21:46:50,070 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-22 21:46:50,070 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-22 21:46:50,071 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-22 21:46:50,074 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-22 21:46:50,213 INFO L238 CfgBuilder]: Building ICFG [2024-11-22 21:46:50,215 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-22 21:46:50,796 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-22 21:46:50,797 INFO L287 CfgBuilder]: Performing block encoding [2024-11-22 21:46:51,243 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-22 21:46:51,243 INFO L316 CfgBuilder]: Removed 6 assume(true) statements. [2024-11-22 21:46:51,244 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:51 BoogieIcfgContainer [2024-11-22 21:46:51,244 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-22 21:46:51,247 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-22 21:46:51,247 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-22 21:46:51,250 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-22 21:46:51,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.11 09:46:49" (1/3) ... [2024-11-22 21:46:51,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e59460b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:51, skipping insertion in model container [2024-11-22 21:46:51,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 09:46:49" (2/3) ... [2024-11-22 21:46:51,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4e59460b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.11 09:46:51, skipping insertion in model container [2024-11-22 21:46:51,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 09:46:51" (3/3) ... [2024-11-22 21:46:51,253 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-bad-buffer-mult-alt3.wvr.c [2024-11-22 21:46:51,270 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-22 21:46:51,270 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-22 21:46:51,270 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-22 21:46:51,370 INFO L143 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2024-11-22 21:46:51,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 73 places, 66 transitions, 160 flow [2024-11-22 21:46:51,442 INFO L124 PetriNetUnfolderBase]: 6/62 cut-off events. [2024-11-22 21:46:51,442 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 21:46:51,446 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-22 21:46:51,447 INFO L82 GeneralOperation]: Start removeDead. Operand has 73 places, 66 transitions, 160 flow [2024-11-22 21:46:51,451 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 68 places, 61 transitions, 146 flow [2024-11-22 21:46:51,462 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-22 21:46:51,470 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;@88235d9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-22 21:46:51,471 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-22 21:46:51,476 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-22 21:46:51,476 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-22 21:46:51,476 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:46:51,477 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:51,477 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:46:51,478 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:51,483 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:51,483 INFO L85 PathProgramCache]: Analyzing trace with hash 866650, now seen corresponding path program 1 times [2024-11-22 21:46:51,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:46:51,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [269930804] [2024-11-22 21:46:51,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:51,496 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-22 21:46:51,497 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:46:51,499 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-22 21:46:51,500 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-22 21:46:51,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:51,615 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-22 21:46:51,619 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:51,674 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-22 21:46:51,689 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-22 21:46:51,689 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:46:51,690 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:46:51,690 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [269930804] [2024-11-22 21:46:51,691 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [269930804] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:51,691 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:51,692 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-22 21:46:51,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214358136] [2024-11-22 21:46:51,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:51,700 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-22 21:46:51,704 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:46:51,724 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-22 21:46:51,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-22 21:46:51,759 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:51,761 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-22 21:46:51,764 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:51,764 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:51,765 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:53,839 INFO L124 PetriNetUnfolderBase]: 9651/13134 cut-off events. [2024-11-22 21:46:53,839 INFO L125 PetriNetUnfolderBase]: For 223/223 co-relation queries the response was YES. [2024-11-22 21:46:53,886 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-22 21:46:53,998 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 36 selfloop transitions, 2 changer transitions 0/57 dead transitions. [2024-11-22 21:46:53,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 57 transitions, 214 flow [2024-11-22 21:46:54,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-22 21:46:54,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-22 21:46:54,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2024-11-22 21:46:54,012 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5707070707070707 [2024-11-22 21:46:54,014 INFO L175 Difference]: Start difference. First operand has 68 places, 61 transitions, 146 flow. Second operand 3 states and 113 transitions. [2024-11-22 21:46:54,016 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 57 transitions, 214 flow [2024-11-22 21:46:54,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 57 transitions, 198 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-22 21:46:54,077 INFO L231 Difference]: Finished difference. Result has 58 places, 57 transitions, 126 flow [2024-11-22 21:46:54,079 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-22 21:46:54,083 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -10 predicate places. [2024-11-22 21:46:54,084 INFO L471 AbstractCegarLoop]: Abstraction has has 58 places, 57 transitions, 126 flow [2024-11-22 21:46:54,084 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-22 21:46:54,084 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:54,085 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-22 21:46:54,090 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 (2)] Ended with exit code 0 [2024-11-22 21:46:54,288 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-22 21:46:54,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:54,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:54,290 INFO L85 PathProgramCache]: Analyzing trace with hash 866651, now seen corresponding path program 1 times [2024-11-22 21:46:54,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:46:54,291 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504510810] [2024-11-22 21:46:54,291 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:54,291 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-22 21:46:54,292 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:46:54,294 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-22 21:46:54,295 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-22 21:46:54,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:54,376 INFO L255 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 21:46:54,377 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:54,401 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-22 21:46:54,479 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-22 21:46:54,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:46:54,480 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:46:54,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504510810] [2024-11-22 21:46:54,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504510810] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:54,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:54,481 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:46:54,481 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406822136] [2024-11-22 21:46:54,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:54,482 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:54,482 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:46:54,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:54,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:54,514 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:54,515 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-22 21:46:54,515 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:54,515 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:54,515 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:56,168 INFO L124 PetriNetUnfolderBase]: 9653/13140 cut-off events. [2024-11-22 21:46:56,169 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-22 21:46:56,192 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-22 21:46:56,250 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 7 changer transitions 0/63 dead transitions. [2024-11-22 21:46:56,251 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 63 transitions, 232 flow [2024-11-22 21:46:56,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:46:56,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:46:56,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 144 transitions. [2024-11-22 21:46:56,253 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5454545454545454 [2024-11-22 21:46:56,253 INFO L175 Difference]: Start difference. First operand has 58 places, 57 transitions, 126 flow. Second operand 4 states and 144 transitions. [2024-11-22 21:46:56,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 63 transitions, 232 flow [2024-11-22 21:46:56,254 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 63 transitions, 226 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-22 21:46:56,256 INFO L231 Difference]: Finished difference. Result has 62 places, 63 transitions, 178 flow [2024-11-22 21:46:56,256 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-22 21:46:56,257 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, -6 predicate places. [2024-11-22 21:46:56,257 INFO L471 AbstractCegarLoop]: Abstraction has has 62 places, 63 transitions, 178 flow [2024-11-22 21:46:56,257 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-22 21:46:56,258 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:56,258 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2024-11-22 21:46:56,261 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-22 21:46:56,458 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-22 21:46:56,459 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:56,460 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash 832880270, now seen corresponding path program 1 times [2024-11-22 21:46:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:46:56,460 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1521242118] [2024-11-22 21:46:56,460 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:56,461 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-22 21:46:56,461 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:46:56,462 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-22 21:46:56,463 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-22 21:46:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:56,525 INFO L255 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-22 21:46:56,526 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:56,538 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-22 21:46:56,752 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-22 21:46:56,752 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:46:57,019 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-22 21:46:57,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:46:57,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1521242118] [2024-11-22 21:46:57,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1521242118] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:46:57,019 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:46:57,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-22 21:46:57,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495979774] [2024-11-22 21:46:57,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:46:57,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:46:57,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:46:57,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:46:57,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=58, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:46:57,137 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:46:57,138 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-22 21:46:57,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:57,138 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:46:57,138 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:46:59,450 INFO L124 PetriNetUnfolderBase]: 9659/13158 cut-off events. [2024-11-22 21:46:59,450 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2024-11-22 21:46:59,479 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-22 21:46:59,557 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 25 changer transitions 0/81 dead transitions. [2024-11-22 21:46:59,557 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 81 transitions, 384 flow [2024-11-22 21:46:59,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:46:59,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:46:59,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 310 transitions. [2024-11-22 21:46:59,562 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4696969696969697 [2024-11-22 21:46:59,562 INFO L175 Difference]: Start difference. First operand has 62 places, 63 transitions, 178 flow. Second operand 10 states and 310 transitions. [2024-11-22 21:46:59,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 81 transitions, 384 flow [2024-11-22 21:46:59,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 81 transitions, 384 flow, removed 0 selfloop flow, removed 0 redundant places. [2024-11-22 21:46:59,569 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 340 flow [2024-11-22 21:46:59,569 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-22 21:46:59,570 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-22 21:46:59,570 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 340 flow [2024-11-22 21:46:59,571 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-22 21:46:59,571 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:46:59,571 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:46:59,575 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-22 21:46:59,772 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-22 21:46:59,773 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:46:59,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:46:59,774 INFO L85 PathProgramCache]: Analyzing trace with hash 1724412099, now seen corresponding path program 1 times [2024-11-22 21:46:59,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:46:59,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [178823271] [2024-11-22 21:46:59,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:46:59,776 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-22 21:46:59,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:46:59,779 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-22 21:46:59,781 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-22 21:46:59,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:46:59,864 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-22 21:46:59,866 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:46:59,916 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-22 21:46:59,916 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:46:59,917 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:46:59,917 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [178823271] [2024-11-22 21:46:59,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [178823271] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:46:59,917 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:46:59,917 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:46:59,917 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [775643474] [2024-11-22 21:46:59,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:46:59,918 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:46:59,918 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:46:59,919 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:46:59,919 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:46:59,933 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:46:59,934 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-22 21:46:59,934 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:46:59,935 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:46:59,935 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:01,416 INFO L124 PetriNetUnfolderBase]: 10705/14769 cut-off events. [2024-11-22 21:47:01,417 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-22 21:47:01,450 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-22 21:47:01,536 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 98 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2024-11-22 21:47:01,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 120 transitions, 700 flow [2024-11-22 21:47:01,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:47:01,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:47:01,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 178 transitions. [2024-11-22 21:47:01,539 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2024-11-22 21:47:01,539 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 340 flow. Second operand 4 states and 178 transitions. [2024-11-22 21:47:01,539 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 120 transitions, 700 flow [2024-11-22 21:47:01,542 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 120 transitions, 606 flow, removed 29 selfloop flow, removed 4 redundant places. [2024-11-22 21:47:01,544 INFO L231 Difference]: Finished difference. Result has 74 places, 81 transitions, 295 flow [2024-11-22 21:47:01,544 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-22 21:47:01,544 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-22 21:47:01,545 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 81 transitions, 295 flow [2024-11-22 21:47:01,545 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-22 21:47:01,545 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:01,545 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:01,550 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-22 21:47:01,746 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-22 21:47:01,746 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:01,747 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:01,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289958, now seen corresponding path program 1 times [2024-11-22 21:47:01,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:01,747 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263582242] [2024-11-22 21:47:01,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:47:01,748 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-22 21:47:01,748 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:01,753 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-22 21:47:01,755 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-22 21:47:01,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:47:01,829 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-22 21:47:01,832 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:01,838 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-22 21:47:01,869 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-22 21:47:01,869 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:47:01,870 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:01,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263582242] [2024-11-22 21:47:01,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263582242] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:47:01,870 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:47:01,870 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:47:01,870 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859548471] [2024-11-22 21:47:01,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:47:01,871 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:47:01,871 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:01,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:47:01,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:47:01,892 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:47:01,892 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-22 21:47:01,893 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:01,893 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:47:01,893 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:02,640 INFO L124 PetriNetUnfolderBase]: 7182/10538 cut-off events. [2024-11-22 21:47:02,640 INFO L125 PetriNetUnfolderBase]: For 855/855 co-relation queries the response was YES. [2024-11-22 21:47:02,662 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-22 21:47:02,712 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 54 selfloop transitions, 6 changer transitions 0/79 dead transitions. [2024-11-22 21:47:02,712 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 79 transitions, 411 flow [2024-11-22 21:47:02,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:47:02,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:47:02,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 134 transitions. [2024-11-22 21:47:02,714 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5075757575757576 [2024-11-22 21:47:02,714 INFO L175 Difference]: Start difference. First operand has 74 places, 81 transitions, 295 flow. Second operand 4 states and 134 transitions. [2024-11-22 21:47:02,714 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 79 transitions, 411 flow [2024-11-22 21:47:02,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 79 transitions, 407 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-22 21:47:02,718 INFO L231 Difference]: Finished difference. Result has 74 places, 79 transitions, 299 flow [2024-11-22 21:47:02,719 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-22 21:47:02,719 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 6 predicate places. [2024-11-22 21:47:02,719 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 79 transitions, 299 flow [2024-11-22 21:47:02,720 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-22 21:47:02,720 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:02,720 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:02,725 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-22 21:47:02,920 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-22 21:47:02,921 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:02,921 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:02,921 INFO L85 PathProgramCache]: Analyzing trace with hash -1238289957, now seen corresponding path program 1 times [2024-11-22 21:47:02,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:02,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [27804069] [2024-11-22 21:47:02,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:47:02,922 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-22 21:47:02,922 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:02,925 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-22 21:47:02,926 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-22 21:47:03,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:47:03,011 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-22 21:47:03,012 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:03,059 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-22 21:47:03,060 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:47:03,060 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:03,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [27804069] [2024-11-22 21:47:03,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [27804069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:47:03,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:47:03,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:47:03,061 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646146470] [2024-11-22 21:47:03,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:47:03,061 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:47:03,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:03,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:47:03,062 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:47:03,075 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:47:03,076 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-22 21:47:03,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:03,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:47:03,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:04,252 INFO L124 PetriNetUnfolderBase]: 8415/12414 cut-off events. [2024-11-22 21:47:04,253 INFO L125 PetriNetUnfolderBase]: For 1061/1061 co-relation queries the response was YES. [2024-11-22 21:47:04,279 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-22 21:47:04,328 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 77 selfloop transitions, 7 changer transitions 0/103 dead transitions. [2024-11-22 21:47:04,329 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 103 transitions, 535 flow [2024-11-22 21:47:04,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:47:04,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:47:04,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 171 transitions. [2024-11-22 21:47:04,330 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6477272727272727 [2024-11-22 21:47:04,330 INFO L175 Difference]: Start difference. First operand has 74 places, 79 transitions, 299 flow. Second operand 4 states and 171 transitions. [2024-11-22 21:47:04,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 103 transitions, 535 flow [2024-11-22 21:47:04,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 103 transitions, 520 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:47:04,336 INFO L231 Difference]: Finished difference. Result has 75 places, 79 transitions, 307 flow [2024-11-22 21:47:04,336 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-22 21:47:04,336 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 7 predicate places. [2024-11-22 21:47:04,337 INFO L471 AbstractCegarLoop]: Abstraction has has 75 places, 79 transitions, 307 flow [2024-11-22 21:47:04,337 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-22 21:47:04,337 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:04,337 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:04,341 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-22 21:47:04,538 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-22 21:47:04,539 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:04,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:04,539 INFO L85 PathProgramCache]: Analyzing trace with hash -417123471, now seen corresponding path program 1 times [2024-11-22 21:47:04,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:04,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [683562928] [2024-11-22 21:47:04,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:47:04,540 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-22 21:47:04,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:04,542 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-22 21:47:04,543 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-22 21:47:04,628 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:47:04,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-22 21:47:04,632 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:04,654 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-22 21:47:04,673 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-22 21:47:04,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:47:04,869 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-22 21:47:04,886 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:47:04,886 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-22 21:47:04,989 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-22 21:47:04,990 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:47:05,860 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-22 21:47:05,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:05,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [683562928] [2024-11-22 21:47:05,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [683562928] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:47:05,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:47:05,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2024-11-22 21:47:05,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657199896] [2024-11-22 21:47:05,863 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:47:05,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:47:05,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:05,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:47:05,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:47:06,636 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 66 [2024-11-22 21:47:06,637 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-22 21:47:06,637 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:06,638 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 66 [2024-11-22 21:47:06,638 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:13,773 INFO L124 PetriNetUnfolderBase]: 18393/27640 cut-off events. [2024-11-22 21:47:13,773 INFO L125 PetriNetUnfolderBase]: For 5198/5198 co-relation queries the response was YES. [2024-11-22 21:47:13,831 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-22 21:47:13,927 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 107 selfloop transitions, 46 changer transitions 0/170 dead transitions. [2024-11-22 21:47:13,927 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 88 places, 170 transitions, 979 flow [2024-11-22 21:47:13,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-22 21:47:13,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-22 21:47:13,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 433 transitions. [2024-11-22 21:47:13,930 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4686147186147186 [2024-11-22 21:47:13,930 INFO L175 Difference]: Start difference. First operand has 75 places, 79 transitions, 307 flow. Second operand 14 states and 433 transitions. [2024-11-22 21:47:13,930 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 88 places, 170 transitions, 979 flow [2024-11-22 21:47:13,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 170 transitions, 970 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:47:13,940 INFO L231 Difference]: Finished difference. Result has 94 places, 105 transitions, 618 flow [2024-11-22 21:47:13,941 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-22 21:47:13,941 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 26 predicate places. [2024-11-22 21:47:13,941 INFO L471 AbstractCegarLoop]: Abstraction has has 94 places, 105 transitions, 618 flow [2024-11-22 21:47:13,942 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-22 21:47:13,942 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:13,942 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:13,946 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-22 21:47:14,145 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-22 21:47:14,146 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:14,146 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:14,146 INFO L85 PathProgramCache]: Analyzing trace with hash -417123472, now seen corresponding path program 1 times [2024-11-22 21:47:14,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:14,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1807408025] [2024-11-22 21:47:14,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:47:14,147 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-22 21:47:14,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:14,150 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-22 21:47:14,151 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-22 21:47:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:47:14,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-22 21:47:14,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:14,233 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-22 21:47:14,258 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-22 21:47:14,259 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-22 21:47:14,300 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-22 21:47:14,301 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:47:14,301 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:14,301 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1807408025] [2024-11-22 21:47:14,301 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1807408025] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:47:14,301 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:47:14,301 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:47:14,301 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [34431000] [2024-11-22 21:47:14,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:47:14,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:47:14,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:14,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:47:14,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:47:14,320 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:47:14,320 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-22 21:47:14,320 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:14,320 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:47:14,320 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:15,673 INFO L124 PetriNetUnfolderBase]: 11532/18365 cut-off events. [2024-11-22 21:47:15,674 INFO L125 PetriNetUnfolderBase]: For 9067/9067 co-relation queries the response was YES. [2024-11-22 21:47:15,737 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-22 21:47:15,805 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 69 selfloop transitions, 15 changer transitions 0/103 dead transitions. [2024-11-22 21:47:15,805 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 103 transitions, 778 flow [2024-11-22 21:47:15,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-22 21:47:15,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-22 21:47:15,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2024-11-22 21:47:15,806 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4727272727272727 [2024-11-22 21:47:15,806 INFO L175 Difference]: Start difference. First operand has 94 places, 105 transitions, 618 flow. Second operand 5 states and 156 transitions. [2024-11-22 21:47:15,806 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 103 transitions, 778 flow [2024-11-22 21:47:15,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 103 transitions, 775 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-22 21:47:15,825 INFO L231 Difference]: Finished difference. Result has 95 places, 103 transitions, 637 flow [2024-11-22 21:47:15,825 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-22 21:47:15,826 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 27 predicate places. [2024-11-22 21:47:15,826 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 103 transitions, 637 flow [2024-11-22 21:47:15,827 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-22 21:47:15,827 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:15,827 INFO L204 CegarLoopForPetriNet]: trace histogram [5, 4, 1, 1] [2024-11-22 21:47:15,833 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2024-11-22 21:47:16,030 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-22 21:47:16,030 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:16,031 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:16,031 INFO L85 PathProgramCache]: Analyzing trace with hash -913765977, now seen corresponding path program 2 times [2024-11-22 21:47:16,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:16,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1063626158] [2024-11-22 21:47:16,032 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:47:16,032 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-22 21:47:16,032 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:16,033 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-22 21:47:16,034 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-22 21:47:16,103 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-22 21:47:16,104 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:47:16,106 INFO L255 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-22 21:47:16,107 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:16,122 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-22 21:47:16,387 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-22 21:47:16,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:47:16,935 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-22 21:47:16,935 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:16,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1063626158] [2024-11-22 21:47:16,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1063626158] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:47:16,936 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:47:16,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 12 [2024-11-22 21:47:16,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894851421] [2024-11-22 21:47:16,936 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:47:16,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-22 21:47:16,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:16,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-22 21:47:16,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=129, Unknown=0, NotChecked=0, Total=182 [2024-11-22 21:47:17,242 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:47:17,243 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-22 21:47:17,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:17,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:47:17,243 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:26,422 INFO L124 PetriNetUnfolderBase]: 11562/18455 cut-off events. [2024-11-22 21:47:26,422 INFO L125 PetriNetUnfolderBase]: For 9255/9255 co-relation queries the response was YES. [2024-11-22 21:47:26,468 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-22 21:47:26,528 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 39 selfloop transitions, 107 changer transitions 0/163 dead transitions. [2024-11-22 21:47:26,528 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 163 transitions, 1421 flow [2024-11-22 21:47:26,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-22 21:47:26,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2024-11-22 21:47:26,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 636 transitions. [2024-11-22 21:47:26,531 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.4380165289256198 [2024-11-22 21:47:26,531 INFO L175 Difference]: Start difference. First operand has 95 places, 103 transitions, 637 flow. Second operand 22 states and 636 transitions. [2024-11-22 21:47:26,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 163 transitions, 1421 flow [2024-11-22 21:47:26,544 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 163 transitions, 1382 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-22 21:47:26,547 INFO L231 Difference]: Finished difference. Result has 119 places, 163 transitions, 1394 flow [2024-11-22 21:47:26,547 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-22 21:47:26,548 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 51 predicate places. [2024-11-22 21:47:26,548 INFO L471 AbstractCegarLoop]: Abstraction has has 119 places, 163 transitions, 1394 flow [2024-11-22 21:47:26,548 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-22 21:47:26,548 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:26,549 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:26,552 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-22 21:47:26,749 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-22 21:47:26,749 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:26,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:26,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1036105231, now seen corresponding path program 1 times [2024-11-22 21:47:26,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:26,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1128204793] [2024-11-22 21:47:26,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-22 21:47:26,750 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-22 21:47:26,750 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:26,751 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-22 21:47:26,752 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-22 21:47:26,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-22 21:47:26,823 INFO L255 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-22 21:47:26,824 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:26,833 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-22 21:47:27,046 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-22 21:47:27,046 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-22 21:47:27,675 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-22 21:47:27,675 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:27,675 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1128204793] [2024-11-22 21:47:27,676 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1128204793] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-22 21:47:27,676 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-22 21:47:27,676 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-22 21:47:27,676 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [473589991] [2024-11-22 21:47:27,676 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-22 21:47:27,677 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-22 21:47:27,677 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:27,677 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-22 21:47:27,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-22 21:47:27,840 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:47:27,841 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-22 21:47:27,842 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:27,842 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:47:27,842 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:32,784 INFO L124 PetriNetUnfolderBase]: 23510/36119 cut-off events. [2024-11-22 21:47:32,784 INFO L125 PetriNetUnfolderBase]: For 19453/19453 co-relation queries the response was YES. [2024-11-22 21:47:32,910 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84310 conditions, 36119 events. 23510/36119 cut-off events. For 19453/19453 co-relation queries the response was YES. Maximal size of possible extension queue 1854. Compared 295942 event pairs, 16270 based on Foata normal form. 0/30315 useless extension candidates. Maximal degree in co-relation 84067. Up to 12598 conditions per place. [2024-11-22 21:47:33,185 INFO L140 encePairwiseOnDemand]: 58/66 looper letters, 118 selfloop transitions, 100 changer transitions 0/235 dead transitions. [2024-11-22 21:47:33,185 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 128 places, 235 transitions, 2054 flow [2024-11-22 21:47:33,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-22 21:47:33,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-22 21:47:33,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 363 transitions. [2024-11-22 21:47:33,187 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.55 [2024-11-22 21:47:33,187 INFO L175 Difference]: Start difference. First operand has 119 places, 163 transitions, 1394 flow. Second operand 10 states and 363 transitions. [2024-11-22 21:47:33,187 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 128 places, 235 transitions, 2054 flow [2024-11-22 21:47:33,216 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 235 transitions, 1774 flow, removed 87 selfloop flow, removed 9 redundant places. [2024-11-22 21:47:33,219 INFO L231 Difference]: Finished difference. Result has 121 places, 163 transitions, 1327 flow [2024-11-22 21:47:33,219 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1114, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=163, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=100, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1327, PETRI_PLACES=121, PETRI_TRANSITIONS=163} [2024-11-22 21:47:33,220 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 53 predicate places. [2024-11-22 21:47:33,220 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 163 transitions, 1327 flow [2024-11-22 21:47:33,220 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has 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-22 21:47:33,220 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:33,221 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:33,224 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 (11)] Ended with exit code 0 [2024-11-22 21:47:33,421 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:47:33,421 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:33,422 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:33,422 INFO L85 PathProgramCache]: Analyzing trace with hash -1008799752, now seen corresponding path program 2 times [2024-11-22 21:47:33,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:33,422 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [84439085] [2024-11-22 21:47:33,422 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:47:33,422 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-22 21:47:33,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:33,423 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:47:33,424 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-22 21:47:33,512 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:47:33,513 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:47:33,514 INFO L255 TraceCheckSpWp]: Trace formula consists of 68 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-22 21:47:33,516 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:33,525 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-22 21:47:33,531 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-22 21:47:33,646 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-22 21:47:33,646 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-22 21:47:33,657 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-22 21:47:33,657 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-22 21:47:33,702 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 21:47:33,702 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:47:33,702 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:33,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [84439085] [2024-11-22 21:47:33,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [84439085] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:47:33,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:47:33,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-22 21:47:33,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263133727] [2024-11-22 21:47:33,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:47:33,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:47:33,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:33,703 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:47:33,703 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:47:33,728 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 66 [2024-11-22 21:47:33,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 163 transitions, 1327 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-22 21:47:33,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:33,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 66 [2024-11-22 21:47:33,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-22 21:47:36,842 INFO L124 PetriNetUnfolderBase]: 19251/30868 cut-off events. [2024-11-22 21:47:36,843 INFO L125 PetriNetUnfolderBase]: For 24505/24505 co-relation queries the response was YES. [2024-11-22 21:47:36,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 69759 conditions, 30868 events. 19251/30868 cut-off events. For 24505/24505 co-relation queries the response was YES. Maximal size of possible extension queue 1614. Compared 262575 event pairs, 13413 based on Foata normal form. 1039/27585 useless extension candidates. Maximal degree in co-relation 69528. Up to 25203 conditions per place. [2024-11-22 21:47:37,074 INFO L140 encePairwiseOnDemand]: 62/66 looper letters, 130 selfloop transitions, 12 changer transitions 0/161 dead transitions. [2024-11-22 21:47:37,074 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 161 transitions, 1595 flow [2024-11-22 21:47:37,075 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-22 21:47:37,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-22 21:47:37,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 130 transitions. [2024-11-22 21:47:37,075 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.49242424242424243 [2024-11-22 21:47:37,075 INFO L175 Difference]: Start difference. First operand has 121 places, 163 transitions, 1327 flow. Second operand 4 states and 130 transitions. [2024-11-22 21:47:37,075 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 161 transitions, 1595 flow [2024-11-22 21:47:37,107 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 118 places, 161 transitions, 1527 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-22 21:47:37,110 INFO L231 Difference]: Finished difference. Result has 118 places, 161 transitions, 1267 flow [2024-11-22 21:47:37,110 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=1243, PETRI_DIFFERENCE_MINUEND_PLACES=115, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=161, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=149, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=1267, PETRI_PLACES=118, PETRI_TRANSITIONS=161} [2024-11-22 21:47:37,111 INFO L277 CegarLoopForPetriNet]: 68 programPoint places, 50 predicate places. [2024-11-22 21:47:37,111 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 161 transitions, 1267 flow [2024-11-22 21:47:37,111 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-22 21:47:37,111 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-22 21:47:37,111 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-22 21:47:37,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-22 21:47:37,314 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-22 21:47:37,315 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-22 21:47:37,315 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-22 21:47:37,315 INFO L85 PathProgramCache]: Analyzing trace with hash -1073675981, now seen corresponding path program 2 times [2024-11-22 21:47:37,316 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-22 21:47:37,316 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1678186621] [2024-11-22 21:47:37,316 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-22 21:47:37,316 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-22 21:47:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-22 21:47:37,318 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-22 21:47:37,319 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-22 21:47:37,386 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-22 21:47:37,386 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-22 21:47:37,388 INFO L255 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-22 21:47:37,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-22 21:47:37,407 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-22 21:47:37,574 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2024-11-22 21:47:37,574 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-22 21:47:37,574 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-22 21:47:37,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1678186621] [2024-11-22 21:47:37,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1678186621] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-22 21:47:37,574 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-22 21:47:37,574 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-22 21:47:37,574 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [419946258] [2024-11-22 21:47:37,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-22 21:47:37,575 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-22 21:47:37,575 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-22 21:47:37,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-22 21:47:37,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-22 21:47:37,619 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2024-11-22 21:47:37,619 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 161 transitions, 1267 flow. Second operand has 4 states, 4 states have (on average 28.25) internal successors, (113), 4 states have internal predecessors, (113), 0 states have call successors, (0), 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-22 21:47:37,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-22 21:47:37,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2024-11-22 21:47:37,620 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand