./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/pthread-memsafety/list1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:56:33,450 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:56:33,507 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 09:56:33,513 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:56:33,515 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:56:33,545 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:56:33,547 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:56:33,547 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:56:33,548 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:56:33,548 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:56:33,548 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:56:33,548 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:56:33,549 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:56:33,549 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:56:33,549 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:56:33,550 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:56:33,550 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:56:33,550 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:56:33,550 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:56:33,550 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:56:33,551 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:56:33,554 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:56:33,554 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:56:33,554 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:56:33,554 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:56:33,555 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:56:33,555 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:56:33,555 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:56:33,555 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:56:33,555 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:56:33,555 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:56:33,556 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:56:33,556 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:56:33,556 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:33,556 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:56:33,556 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:56:33,556 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 09:56:33,557 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 09:56:33,557 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:56:33,557 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:56:33,558 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:56:33,561 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:56:33,561 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-19 09:56:33,790 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:56:33,809 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:56:33,812 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:56:33,813 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:56:33,813 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:56:33,814 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-19 09:56:35,091 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:56:35,311 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:56:35,312 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-19 09:56:35,324 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87e6bdc2/80b1d20d50bc4253909e3022d2da76bf/FLAGe1923c010 [2024-11-19 09:56:35,679 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b87e6bdc2/80b1d20d50bc4253909e3022d2da76bf [2024-11-19 09:56:35,683 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:56:35,684 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:56:35,686 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:35,690 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:56:35,697 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:56:35,701 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:35" (1/1) ... [2024-11-19 09:56:35,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3eb64fd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:35, skipping insertion in model container [2024-11-19 09:56:35,706 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:35" (1/1) ... [2024-11-19 09:56:35,822 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:56:36,251 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:56:36,259 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:56:36,275 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:36,285 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:56:36,374 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:36,492 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:56:36,492 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36 WrapperNode [2024-11-19 09:56:36,495 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:36,497 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:36,497 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:56:36,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:56:36,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,516 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,531 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-19 09:56:36,531 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:36,532 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:56:36,532 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:56:36,532 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:56:36,540 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,540 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,547 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,564 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [8, 3]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 3 writes are split as follows [2, 1]. [2024-11-19 09:56:36,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,570 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,572 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,574 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,574 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,580 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:56:36,581 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:56:36,581 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:56:36,581 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:56:36,582 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (1/1) ... [2024-11-19 09:56:36,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:36,604 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:36,616 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:56:36,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:56:36,665 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:56:36,666 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:56:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:56:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:56:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:56:36,667 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:56:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:56:36,668 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-19 09:56:36,668 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-19 09:56:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-19 09:56:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-19 09:56:36,669 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:56:36,669 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:56:36,670 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:56:36,785 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:56:36,787 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:56:36,937 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:56:36,938 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:56:36,998 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:56:36,998 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:56:36,999 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:36 BoogieIcfgContainer [2024-11-19 09:56:36,999 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:56:37,000 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:56:37,000 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:56:37,003 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:56:37,003 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:56:35" (1/3) ... [2024-11-19 09:56:37,003 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b24cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:37, skipping insertion in model container [2024-11-19 09:56:37,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:36" (2/3) ... [2024-11-19 09:56:37,004 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63b24cdc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:37, skipping insertion in model container [2024-11-19 09:56:37,004 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:36" (3/3) ... [2024-11-19 09:56:37,005 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-19 09:56:37,017 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:56:37,017 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-19 09:56:37,017 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:56:37,077 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:56:37,103 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-19 09:56:37,180 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-19 09:56:37,180 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:37,182 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2024-11-19 09:56:37,182 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-19 09:56:37,188 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-19 09:56:37,202 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:56:37,207 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;@2b4ae352, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:56:37,208 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-19 09:56:37,213 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:56:37,213 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-19 09:56:37,214 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:56:37,214 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:37,215 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:56:37,215 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:37,219 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:37,219 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-19 09:56:37,226 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:37,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [246201407] [2024-11-19 09:56:37,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:37,227 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:37,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:37,583 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:37,583 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:37,583 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [246201407] [2024-11-19 09:56:37,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [246201407] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:37,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:37,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:37,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742307639] [2024-11-19 09:56:37,586 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:37,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:37,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:37,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:37,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:37,682 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-19 09:56:37,685 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:37,685 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:37,685 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-19 09:56:37,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:37,767 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-19 09:56:37,767 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:56:37,768 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 513 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2024-11-19 09:56:37,769 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-19 09:56:37,770 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-19 09:56:37,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:37,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:37,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-19 09:56:37,781 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-19 09:56:37,783 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-19 09:56:37,783 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-19 09:56:37,786 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:56:37,788 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-19 09:56:37,789 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-11-19 09:56:37,792 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-19 09:56:37,792 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-19 09:56:37,792 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:37,792 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:37,793 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:56:37,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 09:56:37,793 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:37,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:37,793 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-19 09:56:37,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:37,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455857619] [2024-11-19 09:56:37,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:37,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:37,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:37,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:37,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:37,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455857619] [2024-11-19 09:56:37,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455857619] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:37,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:37,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:37,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [451895026] [2024-11-19 09:56:37,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:37,976 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:37,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:37,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:37,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:38,037 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-19 09:56:38,038 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,038 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:38,038 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-19 09:56:38,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:38,118 INFO L124 PetriNetUnfolderBase]: 24/130 cut-off events. [2024-11-19 09:56:38,119 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:56:38,119 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 130 events. 24/130 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 412 event pairs, 8 based on Foata normal form. 4/96 useless extension candidates. Maximal degree in co-relation 63. Up to 48 conditions per place. [2024-11-19 09:56:38,120 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-11-19 09:56:38,120 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 215 flow [2024-11-19 09:56:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-11-19 09:56:38,124 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2024-11-19 09:56:38,124 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 209 transitions. [2024-11-19 09:56:38,124 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 215 flow [2024-11-19 09:56:38,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:38,127 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 156 flow [2024-11-19 09:56:38,127 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=156, PETRI_PLACES=70, PETRI_TRANSITIONS=67} [2024-11-19 09:56:38,128 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2024-11-19 09:56:38,128 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 156 flow [2024-11-19 09:56:38,128 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,128 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:38,132 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:56:38,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 09:56:38,136 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:38,137 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:38,137 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-19 09:56:38,137 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:38,137 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819323866] [2024-11-19 09:56:38,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:38,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:38,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:38,197 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:38,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:38,198 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819323866] [2024-11-19 09:56:38,198 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1819323866] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:38,198 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:38,198 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:38,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838523606] [2024-11-19 09:56:38,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:38,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:38,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:38,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:38,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:38,290 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-19 09:56:38,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 67 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:38,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-19 09:56:38,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:38,354 INFO L124 PetriNetUnfolderBase]: 26/124 cut-off events. [2024-11-19 09:56:38,354 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-19 09:56:38,354 INFO L83 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 124 events. 26/124 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 361 event pairs, 12 based on Foata normal form. 0/98 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2024-11-19 09:56:38,355 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-19 09:56:38,355 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2024-11-19 09:56:38,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:38,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:38,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-19 09:56:38,359 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-19 09:56:38,360 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 156 flow. Second operand 3 states and 155 transitions. [2024-11-19 09:56:38,360 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2024-11-19 09:56:38,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-19 09:56:38,362 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 146 flow [2024-11-19 09:56:38,363 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=142, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=146, PETRI_PLACES=65, PETRI_TRANSITIONS=63} [2024-11-19 09:56:38,364 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-19 09:56:38,364 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 146 flow [2024-11-19 09:56:38,365 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,365 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:38,365 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:56:38,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-19 09:56:38,365 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:38,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:38,366 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-19 09:56:38,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:38,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1792239160] [2024-11-19 09:56:38,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:38,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:38,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:38,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:38,434 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:38,434 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1792239160] [2024-11-19 09:56:38,434 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1792239160] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:38,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:38,435 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:38,435 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1127599602] [2024-11-19 09:56:38,435 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:38,435 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:38,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:38,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:38,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:38,462 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-19 09:56:38,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 63 transitions, 146 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:38,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-19 09:56:38,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:38,515 INFO L124 PetriNetUnfolderBase]: 24/114 cut-off events. [2024-11-19 09:56:38,516 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-19 09:56:38,516 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201 conditions, 114 events. 24/114 cut-off events. For 9/9 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 314 event pairs, 12 based on Foata normal form. 4/92 useless extension candidates. Maximal degree in co-relation 118. Up to 52 conditions per place. [2024-11-19 09:56:38,517 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-19 09:56:38,517 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 194 flow [2024-11-19 09:56:38,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:38,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:38,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-19 09:56:38,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-19 09:56:38,521 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 146 flow. Second operand 3 states and 159 transitions. [2024-11-19 09:56:38,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 194 flow [2024-11-19 09:56:38,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:38,526 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2024-11-19 09:56:38,526 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=138, PETRI_PLACES=61, PETRI_TRANSITIONS=59} [2024-11-19 09:56:38,528 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2024-11-19 09:56:38,528 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2024-11-19 09:56:38,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:38,529 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:38,529 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:38,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 09:56:38,530 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:38,531 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:38,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-19 09:56:38,531 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:38,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688119311] [2024-11-19 09:56:38,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:38,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:38,889 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:38,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:38,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688119311] [2024-11-19 09:56:38,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [688119311] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:38,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:38,890 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:56:38,890 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917873653] [2024-11-19 09:56:38,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:38,890 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:56:38,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:38,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:56:38,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:56:39,176 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-19 09:56:39,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 59 transitions, 138 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:39,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:39,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-19 09:56:39,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:39,519 INFO L124 PetriNetUnfolderBase]: 35/141 cut-off events. [2024-11-19 09:56:39,519 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-19 09:56:39,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 269 conditions, 141 events. 35/141 cut-off events. For 13/13 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 415 event pairs, 19 based on Foata normal form. 0/113 useless extension candidates. Maximal degree in co-relation 118. Up to 73 conditions per place. [2024-11-19 09:56:39,520 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 32 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-11-19 09:56:39,520 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 260 flow [2024-11-19 09:56:39,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:56:39,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:56:39,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-19 09:56:39,521 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-19 09:56:39,521 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 10 states and 483 transitions. [2024-11-19 09:56:39,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 260 flow [2024-11-19 09:56:39,522 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:39,523 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 209 flow [2024-11-19 09:56:39,523 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=134, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=209, PETRI_PLACES=74, PETRI_TRANSITIONS=67} [2024-11-19 09:56:39,524 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2024-11-19 09:56:39,524 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 209 flow [2024-11-19 09:56:39,524 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:39,524 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:39,524 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:39,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-19 09:56:39,525 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:39,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:39,525 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-19 09:56:39,525 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:39,525 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966421659] [2024-11-19 09:56:39,525 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:39,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:39,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:39,743 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:39,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966421659] [2024-11-19 09:56:39,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1966421659] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:56:39,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2040656704] [2024-11-19 09:56:39,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:39,743 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:56:39,743 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:39,745 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:56:39,746 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 09:56:39,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:39,819 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-19 09:56:39,822 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:39,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:39,903 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-19 09:56:39,903 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 24 [2024-11-19 09:56:39,919 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:56:39,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:39,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:56:39,977 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:39,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:56:40,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2024-11-19 09:56:40,347 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:56:40,347 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 135 treesize of output 339 [2024-11-19 09:56:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:40,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2040656704] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:56:40,721 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:56:40,721 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-19 09:56:40,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682834652] [2024-11-19 09:56:40,722 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:56:40,722 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-19 09:56:40,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:40,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-19 09:56:40,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-19 09:56:41,466 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2024-11-19 09:56:41,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 67 transitions, 209 flow. Second operand has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:41,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:41,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2024-11-19 09:56:41,467 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:41,685 INFO L124 PetriNetUnfolderBase]: 35/152 cut-off events. [2024-11-19 09:56:41,685 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-19 09:56:41,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 330 conditions, 152 events. 35/152 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 472 event pairs, 5 based on Foata normal form. 0/126 useless extension candidates. Maximal degree in co-relation 160. Up to 31 conditions per place. [2024-11-19 09:56:41,686 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-11-19 09:56:41,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 322 flow [2024-11-19 09:56:41,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:56:41,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:56:41,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2024-11-19 09:56:41,688 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-19 09:56:41,688 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 209 flow. Second operand 8 states and 360 transitions. [2024-11-19 09:56:41,688 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 322 flow [2024-11-19 09:56:41,689 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:41,690 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 224 flow [2024-11-19 09:56:41,690 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=224, PETRI_PLACES=78, PETRI_TRANSITIONS=66} [2024-11-19 09:56:41,690 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-19 09:56:41,691 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 224 flow [2024-11-19 09:56:41,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 40.75) internal successors, (652), 16 states have internal predecessors, (652), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:41,691 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:41,691 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:41,705 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 09:56:41,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2024-11-19 09:56:41,896 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:41,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:41,896 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-19 09:56:41,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:41,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157521550] [2024-11-19 09:56:41,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:41,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:41,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:42,254 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:42,255 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157521550] [2024-11-19 09:56:42,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157521550] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 09:56:42,255 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1144578660] [2024-11-19 09:56:42,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:42,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 09:56:42,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:42,257 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 09:56:42,258 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 09:56:42,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:42,329 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-19 09:56:42,330 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:42,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:56:42,367 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:42,381 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-19 09:56:42,381 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 15 treesize of output 15 [2024-11-19 09:56:42,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:56:42,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:56:42,423 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:42,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:56:42,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:56:42,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:56:42,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:42,460 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:56:42,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-11-19 09:56:42,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-19 09:56:42,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-19 09:56:42,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:56:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 64 treesize of output 134 [2024-11-19 09:56:42,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 64 [2024-11-19 09:56:43,013 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:43,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1144578660] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:56:43,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 09:56:43,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-19 09:56:43,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863790381] [2024-11-19 09:56:43,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 09:56:43,014 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-19 09:56:43,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:43,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-19 09:56:43,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-19 09:56:44,353 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2024-11-19 09:56:44,354 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 66 transitions, 224 flow. Second operand has 19 states, 19 states have (on average 37.63157894736842) internal successors, (715), 19 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:44,354 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:44,354 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2024-11-19 09:56:44,354 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:44,674 INFO L124 PetriNetUnfolderBase]: 33/148 cut-off events. [2024-11-19 09:56:44,675 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-19 09:56:44,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 339 conditions, 148 events. 33/148 cut-off events. For 51/51 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 455 event pairs, 5 based on Foata normal form. 0/122 useless extension candidates. Maximal degree in co-relation 168. Up to 31 conditions per place. [2024-11-19 09:56:44,677 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 35 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2024-11-19 09:56:44,678 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 333 flow [2024-11-19 09:56:44,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:56:44,679 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:56:44,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2024-11-19 09:56:44,680 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5641891891891891 [2024-11-19 09:56:44,680 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 224 flow. Second operand 8 states and 334 transitions. [2024-11-19 09:56:44,680 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 333 flow [2024-11-19 09:56:44,681 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 299 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-19 09:56:44,682 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 208 flow [2024-11-19 09:56:44,682 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2024-11-19 09:56:44,683 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-19 09:56:44,683 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 208 flow [2024-11-19 09:56:44,686 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 37.63157894736842) internal successors, (715), 19 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:44,686 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:44,686 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:44,702 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-19 09:56:44,890 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-19 09:56:44,891 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:44,894 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:44,894 INFO L85 PathProgramCache]: Analyzing trace with hash -500708698, now seen corresponding path program 1 times [2024-11-19 09:56:44,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:44,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134357263] [2024-11-19 09:56:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:44,994 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:44,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 09:56:44,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134357263] [2024-11-19 09:56:44,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134357263] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:44,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:44,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 09:56:44,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604954485] [2024-11-19 09:56:44,995 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:44,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 09:56:44,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 09:56:44,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 09:56:44,996 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 09:56:45,059 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-19 09:56:45,060 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 208 flow. Second operand has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:45,060 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:45,060 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-19 09:56:45,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:45,125 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2024-11-19 09:56:45,126 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-19 09:56:45,126 INFO L83 FinitePrefix]: Finished finitePrefix Result has 212 conditions, 77 events. 21/77 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 140 event pairs, 14 based on Foata normal form. 0/75 useless extension candidates. Maximal degree in co-relation 69. Up to 51 conditions per place. [2024-11-19 09:56:45,127 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2024-11-19 09:56:45,127 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 196 flow [2024-11-19 09:56:45,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:56:45,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:56:45,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-19 09:56:45,129 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2024-11-19 09:56:45,129 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 208 flow. Second operand 5 states and 224 transitions. [2024-11-19 09:56:45,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 196 flow [2024-11-19 09:56:45,130 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-19 09:56:45,132 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 123 flow [2024-11-19 09:56:45,132 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=123, PETRI_PLACES=45, PETRI_TRANSITIONS=35} [2024-11-19 09:56:45,132 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2024-11-19 09:56:45,132 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 123 flow [2024-11-19 09:56:45,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 43.2) internal successors, (216), 5 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:45,133 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:45,133 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:45,133 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-19 09:56:45,133 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:45,134 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:45,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1419302643, now seen corresponding path program 1 times [2024-11-19 09:56:45,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 09:56:45,135 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259170621] [2024-11-19 09:56:45,135 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:45,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 09:56:45,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:56:45,150 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-19 09:56:45,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-19 09:56:45,172 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-19 09:56:45,172 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-19 09:56:45,176 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-19 09:56:45,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2024-11-19 09:56:45,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-19 09:56:45,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-19 09:56:45,177 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-19 09:56:45,178 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-19 09:56:45,179 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2024-11-19 09:56:45,180 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-19 09:56:45,181 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-19 09:56:45,182 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2024-11-19 09:56:45,183 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2024-11-19 09:56:45,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2024-11-19 09:56:45,184 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2024-11-19 09:56:45,184 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-19 09:56:45,184 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:45,211 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-19 09:56:45,212 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-19 09:56:45,215 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 09:56:45 BasicIcfg [2024-11-19 09:56:45,215 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-19 09:56:45,215 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-19 09:56:45,215 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-19 09:56:45,215 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-19 09:56:45,216 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:36" (3/4) ... [2024-11-19 09:56:45,217 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-19 09:56:45,218 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-19 09:56:45,218 INFO L158 Benchmark]: Toolchain (without parser) took 9533.77ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 104.6MB in the beginning and 129.2MB in the end (delta: -24.6MB). Peak memory consumption was 94.7MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,218 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:56:45,218 INFO L158 Benchmark]: CACSL2BoogieTranslator took 810.18ms. Allocated memory is still 184.5MB. Free memory was 104.4MB in the beginning and 125.5MB in the end (delta: -21.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,219 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.82ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,219 INFO L158 Benchmark]: Boogie Preprocessor took 48.63ms. Allocated memory is still 184.5MB. Free memory was 123.4MB in the beginning and 120.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,219 INFO L158 Benchmark]: RCFGBuilder took 417.80ms. Allocated memory is still 184.5MB. Free memory was 120.5MB in the beginning and 91.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,219 INFO L158 Benchmark]: TraceAbstraction took 8214.41ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 90.5MB in the beginning and 129.2MB in the end (delta: -38.8MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. [2024-11-19 09:56:45,219 INFO L158 Benchmark]: Witness Printer took 2.66ms. Allocated memory is still 302.0MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-19 09:56:45,220 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 184.5MB. Free memory is still 153.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 810.18ms. Allocated memory is still 184.5MB. Free memory was 104.4MB in the beginning and 125.5MB in the end (delta: -21.1MB). Peak memory consumption was 8.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.82ms. Allocated memory is still 184.5MB. Free memory was 125.5MB in the beginning and 123.4MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 48.63ms. Allocated memory is still 184.5MB. Free memory was 123.4MB in the beginning and 120.5MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 417.80ms. Allocated memory is still 184.5MB. Free memory was 120.5MB in the beginning and 91.1MB in the end (delta: 29.4MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 8214.41ms. Allocated memory was 184.5MB in the beginning and 302.0MB in the end (delta: 117.4MB). Free memory was 90.5MB in the beginning and 129.2MB in the end (delta: -38.8MB). Peak memory consumption was 79.9MB. Max. memory is 16.1GB. * Witness Printer took 2.66ms. Allocated memory is still 302.0MB. Free memory is still 129.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 1069]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1069. Possible FailurePath: [L1070] 0 pthread_t id1, id2; [L1071] 0 struct item *list = ((void *)0); [L1072] FCALL, FORK 0 pthread_create(&id1, ((void *)0), build, list) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1048] 1 struct item *list = (struct item *)plist; [L1048] 1 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1050] CALL 1 append(&list) [L1042] 1 struct item *elem = malloc(sizeof *elem); [L1043] EXPR 1 \read(**plist) VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1043] 1 elem->next = *plist [L1044] EXPR 1 elem->next VAL [\old(plist)={0:0}, list={2:0}, plist={0:0}] [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1044] EXPR 1 (elem->next) ? elem->next->data : malloc(sizeof *elem) VAL [\old(plist)={2:0}, elem={-1:0}, plist={2:0}] [L1044] 1 elem->data = (elem->next) ? elem->next->data : malloc(sizeof *elem) [L1045] 1 *plist = elem [L1050] RET 1 append(&list) [L1051] COND FALSE 1 !(__VERIFIER_nondet_int()) [L1073] FCALL, JOIN 1 pthread_join(id1, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, argc=9, id1=-1, list={0:0}] [L1074] FCALL, FORK 0 pthread_create(&id2, ((void *)0), delete, list) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, argc=9, id1=-1, id2=0, list={0:0}] [L1055] 2 struct item *list = (struct item *)plist; VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1056] COND FALSE 2 !(\read(*list)) VAL [\old(plist)={0:0}, list={0:0}, plist={0:0}] [L1062] COND FALSE 2 !(\read(*list)) [L1075] FCALL, JOIN 2 pthread_join(id2, ((void *)0)) VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0:0}] [L1076] 0 return 0; VAL [\old(argc)=9, \old(argv)={10:11}, \old(plist)={0:0}, \result=0, \result={0:0}, argc=9, id1=-1, id2=0, list={0:0}, list={0:0}, plist={0: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: -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: 1072]: 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: 1074]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1058]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1064]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - UnprovableResult [Line: 1059]: Unable to prove that free always succeeds Unable to prove that free always succeeds Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 5 procedures, 130 locations, 61 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: 8.1s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1493 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1195 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1293 mSDsCounter, 66 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 5132 IncrementalHoareTripleChecker+Invalid, 5198 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 66 mSolverCounterUnsat, 47 mSDtfsCounter, 5132 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 125 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=224occurred in iteration=6, InterpolantAutomatonStates: 45, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 3.1s InterpolantComputationTime, 146 NumberOfCodeBlocks, 146 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 147 ConstructedInterpolants, 6 QuantifiedInterpolants, 1562 SizeOfPredicates, 37 NumberOfNonLiveVariables, 410 ConjunctsInSsa, 79 ConjunctsInUnsatCore, 12 InterpolantComputations, 6 PerfectInterpolantSequences, 6/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-19 09:56:45,260 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/pthread-memsafety/list1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 09:56:47,231 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 09:56:47,294 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-19 09:56:47,298 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 09:56:47,299 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 09:56:47,324 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 09:56:47,327 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 09:56:47,327 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 09:56:47,328 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 09:56:47,328 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 09:56:47,329 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 09:56:47,329 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 09:56:47,329 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 09:56:47,330 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 09:56:47,331 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 09:56:47,331 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 09:56:47,331 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 09:56:47,332 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 09:56:47,332 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 09:56:47,332 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 09:56:47,332 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 09:56:47,336 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 09:56:47,336 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 09:56:47,336 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 09:56:47,337 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 09:56:47,338 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 09:56:47,338 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 09:56:47,338 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 09:56:47,338 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 09:56:47,338 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 09:56:47,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:47,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 09:56:47,339 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 09:56:47,339 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-19 09:56:47,339 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-19 09:56:47,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 09:56:47,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 09:56:47,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 09:56:47,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 09:56:47,340 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 -> 1da30149a66945688e686f90b0d1749d09e30bdcfdeae7b4325d99ddbe3a8206 [2024-11-19 09:56:47,598 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 09:56:47,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 09:56:47,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 09:56:47,632 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 09:56:47,633 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 09:56:47,633 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-19 09:56:48,964 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 09:56:49,251 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 09:56:49,252 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-19 09:56:49,274 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff572b84/0e0854a29c094127ab198600f5f50251/FLAGd3e74de5b [2024-11-19 09:56:49,289 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4ff572b84/0e0854a29c094127ab198600f5f50251 [2024-11-19 09:56:49,292 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 09:56:49,294 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 09:56:49,295 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:49,296 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 09:56:49,300 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 09:56:49,301 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,301 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c5cdd50 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49, skipping insertion in model container [2024-11-19 09:56:49,302 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,357 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 09:56:49,672 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:56:49,680 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-19 09:56:49,693 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:49,701 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 09:56:49,742 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 09:56:49,827 INFO L204 MainTranslator]: Completed translation [2024-11-19 09:56:49,827 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49 WrapperNode [2024-11-19 09:56:49,831 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 09:56:49,832 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:49,832 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 09:56:49,832 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 09:56:49,840 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,870 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,889 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-19 09:56:49,890 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 09:56:49,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 09:56:49,890 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 09:56:49,890 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 09:56:49,897 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,897 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,900 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,910 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [8, 3]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [0, 1]. The 3 writes are split as follows [2, 1]. [2024-11-19 09:56:49,910 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,910 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,916 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,919 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,920 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,921 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,924 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 09:56:49,924 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 09:56:49,924 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 09:56:49,925 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 09:56:49,925 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (1/1) ... [2024-11-19 09:56:49,933 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 09:56:49,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 09:56:49,954 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 09:56:49,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 09:56:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-19 09:56:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 09:56:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 09:56:49,987 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 09:56:49,988 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-19 09:56:49,988 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-19 09:56:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-19 09:56:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-19 09:56:49,989 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 09:56:49,989 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 09:56:49,990 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-19 09:56:50,113 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 09:56:50,116 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 09:56:50,397 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-19 09:56:50,397 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 09:56:50,485 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 09:56:50,486 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-19 09:56:50,486 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:50 BoogieIcfgContainer [2024-11-19 09:56:50,488 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 09:56:50,489 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 09:56:50,489 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 09:56:50,492 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 09:56:50,492 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 09:56:49" (1/3) ... [2024-11-19 09:56:50,493 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4d9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:50, skipping insertion in model container [2024-11-19 09:56:50,493 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 09:56:49" (2/3) ... [2024-11-19 09:56:50,494 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ec4d9b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 09:56:50, skipping insertion in model container [2024-11-19 09:56:50,494 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 09:56:50" (3/3) ... [2024-11-19 09:56:50,495 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-19 09:56:50,507 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 09:56:50,507 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-19 09:56:50,507 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-19 09:56:50,598 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-19 09:56:50,625 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-19 09:56:50,652 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-19 09:56:50,652 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-19 09:56:50,655 INFO L83 FinitePrefix]: Finished finitePrefix Result has 81 conditions, 72 events. 5/72 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 206 event pairs, 0 based on Foata normal form. 0/37 useless extension candidates. Maximal degree in co-relation 42. Up to 3 conditions per place. [2024-11-19 09:56:50,655 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-19 09:56:50,658 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-19 09:56:50,669 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 09:56:50,674 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;@2e79800a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 09:56:50,675 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-19 09:56:50,678 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-19 09:56:50,678 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-19 09:56:50,678 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-19 09:56:50,678 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:50,679 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:56:50,679 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:50,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:50,682 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-19 09:56:50,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:50,691 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1938105445] [2024-11-19 09:56:50,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:50,691 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:50,694 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:50,695 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-19 09:56:50,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:50,783 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-19 09:56:50,786 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:50,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:56:50,892 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-19 09:56:50,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2024-11-19 09:56:50,913 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:50,913 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:50,913 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:50,914 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1938105445] [2024-11-19 09:56:50,914 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1938105445] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:50,915 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:50,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756932444] [2024-11-19 09:56:50,917 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:50,923 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:50,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:50,946 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:50,946 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:51,048 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-19 09:56:51,053 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 71 transitions, 154 flow. Second operand has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,053 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:51,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-19 09:56:51,054 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:51,213 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-19 09:56:51,213 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-19 09:56:51,214 INFO L83 FinitePrefix]: Finished finitePrefix Result has 227 conditions, 148 events. 25/148 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 513 event pairs, 4 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 120. Up to 31 conditions per place. [2024-11-19 09:56:51,216 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-19 09:56:51,216 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-19 09:56:51,217 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:51,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:51,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-19 09:56:51,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-19 09:56:51,226 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-19 09:56:51,226 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-19 09:56:51,228 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:56:51,230 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-19 09:56:51,231 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=159, PETRI_PLACES=71, PETRI_TRANSITIONS=69} [2024-11-19 09:56:51,233 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-19 09:56:51,233 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-19 09:56:51,233 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 45.25) internal successors, (181), 4 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,234 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:51,234 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-19 09:56:51,237 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:51,436 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:51,437 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:51,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:51,439 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-19 09:56:51,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:51,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1623385849] [2024-11-19 09:56:51,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:51,441 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:51,441 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:51,443 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:51,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-19 09:56:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:51,502 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-19 09:56:51,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:51,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:56:51,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:56:51,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:56:51,547 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:56:51,555 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:56:51,556 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:56:51,566 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:51,566 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:51,566 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:51,566 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1623385849] [2024-11-19 09:56:51,566 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1623385849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:51,566 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:51,566 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 09:56:51,567 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436134318] [2024-11-19 09:56:51,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:51,567 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 09:56:51,568 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:51,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 09:56:51,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 09:56:51,672 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-19 09:56:51,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 69 transitions, 159 flow. Second operand has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:51,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-19 09:56:51,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:51,787 INFO L124 PetriNetUnfolderBase]: 27/156 cut-off events. [2024-11-19 09:56:51,787 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-19 09:56:51,788 INFO L83 FinitePrefix]: Finished finitePrefix Result has 256 conditions, 156 events. 27/156 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 561 event pairs, 4 based on Foata normal form. 4/118 useless extension candidates. Maximal degree in co-relation 63. Up to 42 conditions per place. [2024-11-19 09:56:51,789 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2024-11-19 09:56:51,789 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 247 flow [2024-11-19 09:56:51,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 09:56:51,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-19 09:56:51,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-19 09:56:51,795 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7331081081081081 [2024-11-19 09:56:51,795 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 217 transitions. [2024-11-19 09:56:51,795 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 247 flow [2024-11-19 09:56:51,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:51,812 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 175 flow [2024-11-19 09:56:51,812 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=175, PETRI_PLACES=72, PETRI_TRANSITIONS=69} [2024-11-19 09:56:51,813 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2024-11-19 09:56:51,813 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 175 flow [2024-11-19 09:56:51,813 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 46.25) internal successors, (185), 4 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:51,813 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:51,813 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:56:51,824 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-19 09:56:52,013 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,014 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:52,015 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:52,015 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-19 09:56:52,015 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:52,015 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [544307037] [2024-11-19 09:56:52,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:52,015 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,015 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:52,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:52,024 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-19 09:56:52,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:52,081 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-19 09:56:52,082 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:52,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:56:52,097 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:52,097 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:52,098 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:52,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [544307037] [2024-11-19 09:56:52,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [544307037] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:52,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:52,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:52,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292081980] [2024-11-19 09:56:52,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:52,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:52,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:52,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:52,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:52,145 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-19 09:56:52,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 69 transitions, 175 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,146 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:52,146 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-19 09:56:52,146 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:52,221 INFO L124 PetriNetUnfolderBase]: 28/134 cut-off events. [2024-11-19 09:56:52,222 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 09:56:52,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 252 conditions, 134 events. 28/134 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 415 event pairs, 12 based on Foata normal form. 0/108 useless extension candidates. Maximal degree in co-relation 122. Up to 54 conditions per place. [2024-11-19 09:56:52,223 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-19 09:56:52,223 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 229 flow [2024-11-19 09:56:52,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:52,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:52,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-19 09:56:52,225 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-19 09:56:52,225 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 175 flow. Second operand 3 states and 155 transitions. [2024-11-19 09:56:52,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 229 flow [2024-11-19 09:56:52,226 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:52,227 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2024-11-19 09:56:52,227 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=158, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=164, PETRI_PLACES=68, PETRI_TRANSITIONS=65} [2024-11-19 09:56:52,228 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2024-11-19 09:56:52,228 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2024-11-19 09:56:52,228 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,229 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:52,229 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 09:56:52,234 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:52,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,433 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:52,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:52,433 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-19 09:56:52,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:52,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175723228] [2024-11-19 09:56:52,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:52,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:52,438 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:52,439 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-19 09:56:52,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:52,488 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-19 09:56:52,489 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:52,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:56:52,506 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:52,506 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:52,506 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:52,506 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175723228] [2024-11-19 09:56:52,506 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175723228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:52,507 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:52,507 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 09:56:52,507 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787641842] [2024-11-19 09:56:52,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:52,507 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 09:56:52,507 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:52,508 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 09:56:52,508 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 09:56:52,555 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-19 09:56:52,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 65 transitions, 164 flow. Second operand has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:52,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-19 09:56:52,555 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:52,642 INFO L124 PetriNetUnfolderBase]: 26/122 cut-off events. [2024-11-19 09:56:52,642 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-19 09:56:52,643 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 122 events. 26/122 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 362 event pairs, 12 based on Foata normal form. 4/100 useless extension candidates. Maximal degree in co-relation 118. Up to 54 conditions per place. [2024-11-19 09:56:52,643 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-19 09:56:52,643 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 214 flow [2024-11-19 09:56:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 09:56:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-19 09:56:52,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-19 09:56:52,644 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-19 09:56:52,645 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-19 09:56:52,645 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 214 flow [2024-11-19 09:56:52,645 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:52,646 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 156 flow [2024-11-19 09:56:52,646 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=156, PETRI_PLACES=64, PETRI_TRANSITIONS=61} [2024-11-19 09:56:52,647 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2024-11-19 09:56:52,647 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 156 flow [2024-11-19 09:56:52,647 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.666666666666664) internal successors, (134), 3 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:52,647 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:52,647 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:52,652 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:52,847 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,848 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:52,848 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:52,848 INFO L85 PathProgramCache]: Analyzing trace with hash 1335115542, now seen corresponding path program 1 times [2024-11-19 09:56:52,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:52,849 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342839738] [2024-11-19 09:56:52,849 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:52,849 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:52,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:52,855 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:52,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-19 09:56:52,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:52,991 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-19 09:56:52,999 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:53,089 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:56:53,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:56:53,103 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:56:53,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:56:53,120 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:53,120 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:53,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:53,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342839738] [2024-11-19 09:56:53,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342839738] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:53,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:53,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 09:56:53,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [713550154] [2024-11-19 09:56:53,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:53,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 09:56:53,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:53,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 09:56:53,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-19 09:56:53,228 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-19 09:56:53,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 61 transitions, 156 flow. Second operand has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:53,229 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:53,229 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-19 09:56:53,229 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:53,321 INFO L124 PetriNetUnfolderBase]: 27/121 cut-off events. [2024-11-19 09:56:53,321 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-19 09:56:53,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 230 conditions, 121 events. 27/121 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 350 event pairs, 8 based on Foata normal form. 2/97 useless extension candidates. Maximal degree in co-relation 118. Up to 50 conditions per place. [2024-11-19 09:56:53,322 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 26 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-19 09:56:53,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 220 flow [2024-11-19 09:56:53,323 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 09:56:53,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-19 09:56:53,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-11-19 09:56:53,324 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2024-11-19 09:56:53,324 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 156 flow. Second operand 5 states and 240 transitions. [2024-11-19 09:56:53,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 220 flow [2024-11-19 09:56:53,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:56:53,326 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 156 flow [2024-11-19 09:56:53,326 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=156, PETRI_PLACES=65, PETRI_TRANSITIONS=60} [2024-11-19 09:56:53,326 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-19 09:56:53,326 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 156 flow [2024-11-19 09:56:53,327 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 43.5) internal successors, (261), 6 states have internal predecessors, (261), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:53,327 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:53,327 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:53,331 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2024-11-19 09:56:53,527 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:53,528 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:53,528 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:53,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-19 09:56:53,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:53,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [103297137] [2024-11-19 09:56:53,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:53,529 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:53,529 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:53,531 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:53,532 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-19 09:56:53,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:53,583 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 09:56:53,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:53,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:56:53,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:56:53,678 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:53,678 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 09:56:53,679 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:53,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [103297137] [2024-11-19 09:56:53,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [103297137] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 09:56:53,679 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 09:56:53,679 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-19 09:56:53,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [213381413] [2024-11-19 09:56:53,679 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 09:56:53,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-19 09:56:53,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:53,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-19 09:56:53,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-19 09:56:53,849 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-19 09:56:53,850 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 60 transitions, 156 flow. Second operand has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:53,850 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:53,850 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-19 09:56:53,850 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:56:54,259 INFO L124 PetriNetUnfolderBase]: 36/144 cut-off events. [2024-11-19 09:56:54,259 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-19 09:56:54,260 INFO L83 FinitePrefix]: Finished finitePrefix Result has 300 conditions, 144 events. 36/144 cut-off events. For 34/34 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 437 event pairs, 20 based on Foata normal form. 2/120 useless extension candidates. Maximal degree in co-relation 118. Up to 76 conditions per place. [2024-11-19 09:56:54,261 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 33 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2024-11-19 09:56:54,261 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 288 flow [2024-11-19 09:56:54,261 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 09:56:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-19 09:56:54,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-19 09:56:54,263 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-19 09:56:54,263 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 156 flow. Second operand 10 states and 483 transitions. [2024-11-19 09:56:54,263 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 288 flow [2024-11-19 09:56:54,264 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-19 09:56:54,265 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 227 flow [2024-11-19 09:56:54,265 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=227, PETRI_PLACES=76, PETRI_TRANSITIONS=68} [2024-11-19 09:56:54,266 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-19 09:56:54,266 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 227 flow [2024-11-19 09:56:54,267 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 44.888888888888886) internal successors, (404), 9 states have internal predecessors, (404), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:54,267 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:56:54,267 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:56:54,272 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2024-11-19 09:56:54,467 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:54,468 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:56:54,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:56:54,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-19 09:56:54,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:56:54,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2111135105] [2024-11-19 09:56:54,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:56:54,470 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:56:54,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:56:54,473 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:56:54,474 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-19 09:56:54,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:56:54,582 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-19 09:56:54,584 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:56:54,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-19 09:56:54,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:54,673 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-19 09:56:54,673 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 18 treesize of output 24 [2024-11-19 09:56:54,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 09:56:54,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:56:54,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2024-11-19 09:56:54,803 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:54,803 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:56:54,934 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 32 [2024-11-19 09:56:55,147 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:56:55,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-19 09:56:55,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2111135105] [2024-11-19 09:56:55,148 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2111135105] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 09:56:55,148 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 09:56:55,148 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 14 [2024-11-19 09:56:55,148 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [715793560] [2024-11-19 09:56:55,148 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 09:56:55,148 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 09:56:55,149 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-19 09:56:55,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 09:56:55,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2024-11-19 09:56:59,188 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-19 09:56:59,812 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2024-11-19 09:56:59,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 227 flow. Second operand has 15 states, 15 states have (on average 31.733333333333334) internal successors, (476), 15 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:56:59,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-19 09:56:59,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2024-11-19 09:56:59,813 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-19 09:57:00,230 INFO L124 PetriNetUnfolderBase]: 44/168 cut-off events. [2024-11-19 09:57:00,230 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-19 09:57:00,231 INFO L83 FinitePrefix]: Finished finitePrefix Result has 392 conditions, 168 events. 44/168 cut-off events. For 41/41 co-relation queries the response was YES. Maximal size of possible extension queue 15. Compared 557 event pairs, 10 based on Foata normal form. 0/137 useless extension candidates. Maximal degree in co-relation 203. Up to 49 conditions per place. [2024-11-19 09:57:00,232 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 47 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-11-19 09:57:00,232 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 368 flow [2024-11-19 09:57:00,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 09:57:00,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-19 09:57:00,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 298 transitions. [2024-11-19 09:57:00,233 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-11-19 09:57:00,233 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 227 flow. Second operand 8 states and 298 transitions. [2024-11-19 09:57:00,233 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 368 flow [2024-11-19 09:57:00,234 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-19 09:57:00,235 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 244 flow [2024-11-19 09:57:00,235 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=74, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=244, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2024-11-19 09:57:00,236 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2024-11-19 09:57:00,236 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 244 flow [2024-11-19 09:57:00,236 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 31.733333333333334) internal successors, (476), 15 states have internal predecessors, (476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 09:57:00,236 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-19 09:57:00,237 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 09:57:00,241 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-19 09:57:00,437 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:57:00,437 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-19 09:57:00,438 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 09:57:00,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-19 09:57:00,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-19 09:57:00,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2143051777] [2024-11-19 09:57:00,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 09:57:00,439 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-19 09:57:00,439 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-19 09:57:00,441 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-19 09:57:00,442 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-19 09:57:00,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 09:57:00,540 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 09:57:00,543 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 09:57:00,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 09:57:00,565 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-19 09:57:00,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 09:57:00,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 09:57:00,654 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-19 09:57:00,655 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2024-11-19 09:57:00,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:57:00,701 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:57:00,745 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-19 09:57:00,745 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 17 treesize of output 17 [2024-11-19 09:57:00,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-19 09:57:00,776 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:57:00,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 09:57:00,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-19 09:57:00,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-19 09:57:00,850 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-19 09:57:00,864 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 09:57:00,864 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 09:57:05,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 62 [2024-11-19 09:57:05,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 94 [2024-11-19 09:57:05,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2024-11-19 09:57:07,815 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 09:57:07,816 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 10 new quantified variables, introduced 45 case distinctions, treesize of input 251 treesize of output 681