./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 c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/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-?-c7c6ca5-m [2024-11-09 10:58:24,989 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:25,059 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 10:58:25,065 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:25,066 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:25,090 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:25,092 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:25,092 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:25,092 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:25,094 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:25,094 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:25,094 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:25,095 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:25,095 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:25,095 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:25,097 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:25,098 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:25,098 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:25,098 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:25,098 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:25,099 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:25,099 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:25,100 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:25,100 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:25,101 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:25,101 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:25,101 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:25,101 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:25,101 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:25,102 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:25,102 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:25,102 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:25,102 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:25,102 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:25,103 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:25,103 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:25,103 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 10:58:25,104 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 10:58:25,104 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:25,104 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:25,104 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:25,105 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:25,105 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-09 10:58:25,308 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:25,327 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:25,330 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:25,331 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:25,331 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:25,332 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-09 10:58:26,563 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:26,753 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:26,754 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-09 10:58:26,770 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0bf125c/8eea95c7ae4f4c4e8cd9a03227789837/FLAG01e2c04d0 [2024-11-09 10:58:26,788 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ac0bf125c/8eea95c7ae4f4c4e8cd9a03227789837 [2024-11-09 10:58:26,790 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:26,791 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:26,793 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:26,794 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:26,799 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:26,800 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:26" (1/1) ... [2024-11-09 10:58:26,800 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3f8e68cc and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:26, skipping insertion in model container [2024-11-09 10:58:26,802 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:26" (1/1) ... [2024-11-09 10:58:26,844 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:27,155 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:58:27,160 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:58:27,166 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:27,172 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:27,204 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:27,240 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:27,240 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27 WrapperNode [2024-11-09 10:58:27,240 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:27,241 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:27,241 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:27,241 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:27,246 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,258 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,272 INFO L138 Inliner]: procedures = 264, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-09 10:58:27,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:27,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:27,273 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:27,273 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:27,280 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,280 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,282 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,293 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-09 10:58:27,293 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,293 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,299 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,301 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,302 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,303 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,305 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:27,305 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:27,305 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:27,305 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:27,308 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (1/1) ... [2024-11-09 10:58:27,316 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:27,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:27,338 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:58:27,339 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:58:27,380 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:58:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:58:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:58:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:58:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:27,381 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:58:27,382 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:58:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:58:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-09 10:58:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-09 10:58:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-09 10:58:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-09 10:58:27,383 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:27,383 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:27,384 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:27,501 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:27,503 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:27,735 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:27,736 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:27,809 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:27,809 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:58:27,809 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:27 BoogieIcfgContainer [2024-11-09 10:58:27,809 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:27,812 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:27,813 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:27,815 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:27,815 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:26" (1/3) ... [2024-11-09 10:58:27,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d973213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:27, skipping insertion in model container [2024-11-09 10:58:27,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:27" (2/3) ... [2024-11-09 10:58:27,816 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5d973213 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:27, skipping insertion in model container [2024-11-09 10:58:27,816 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:27" (3/3) ... [2024-11-09 10:58:27,817 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-09 10:58:27,830 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:27,831 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-09 10:58:27,831 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:27,912 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:27,938 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-09 10:58:27,967 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-09 10:58:27,967 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:27,969 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-09 10:58:27,970 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-09 10:58:27,972 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-09 10:58:27,978 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:27,984 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;@6d91469f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:27,985 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-09 10:58:27,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:27,989 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-09 10:58:27,989 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:58:27,989 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:27,990 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:58:27,990 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:27,994 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:27,994 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-09 10:58:28,000 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:28,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884185415] [2024-11-09 10:58:28,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:28,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:28,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:28,299 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:28,301 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:28,302 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884185415] [2024-11-09 10:58:28,302 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1884185415] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:28,302 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:28,302 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:28,304 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070234662] [2024-11-09 10:58:28,305 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:28,311 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:28,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:28,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:28,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:28,404 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-09 10:58:28,407 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-09 10:58:28,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:28,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-09 10:58:28,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:28,508 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-09 10:58:28,508 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:58:28,509 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-09 10:58:28,510 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-09 10:58:28,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-09 10:58:28,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:28,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-09 10:58:28,522 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-09 10:58:28,523 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-09 10:58:28,524 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-09 10:58:28,526 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:28,530 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-09 10:58:28,532 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-09 10:58:28,536 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-09 10:58:28,536 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-09 10:58:28,537 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-09 10:58:28,537 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:28,537 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:58:28,537 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 10:58:28,537 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:28,538 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:28,539 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-09 10:58:28,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:28,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164553347] [2024-11-09 10:58:28,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:28,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:28,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:28,661 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:28,662 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:28,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164553347] [2024-11-09 10:58:28,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164553347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:28,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:28,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:28,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672330726] [2024-11-09 10:58:28,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:28,664 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:28,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:28,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:28,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:28,740 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-09 10:58:28,741 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-09 10:58:28,741 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:28,742 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-09 10:58:28,743 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:28,832 INFO L124 PetriNetUnfolderBase]: 24/130 cut-off events. [2024-11-09 10:58:28,833 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:58:28,834 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-09 10:58:28,834 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/69 dead transitions. [2024-11-09 10:58:28,834 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 69 transitions, 215 flow [2024-11-09 10:58:28,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:28,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:28,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 209 transitions. [2024-11-09 10:58:28,836 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.706081081081081 [2024-11-09 10:58:28,836 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 209 transitions. [2024-11-09 10:58:28,837 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 69 transitions, 215 flow [2024-11-09 10:58:28,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 210 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:28,838 INFO L231 Difference]: Finished difference. Result has 70 places, 67 transitions, 156 flow [2024-11-09 10:58:28,839 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-09 10:58:28,839 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2024-11-09 10:58:28,839 INFO L471 AbstractCegarLoop]: Abstraction has has 70 places, 67 transitions, 156 flow [2024-11-09 10:58:28,840 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-09 10:58:28,840 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:28,840 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:58:28,840 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 10:58:28,840 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:28,841 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:28,841 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-09 10:58:28,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:28,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [187851732] [2024-11-09 10:58:28,841 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:28,841 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:28,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:28,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:28,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:28,888 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [187851732] [2024-11-09 10:58:28,888 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [187851732] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:28,888 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:28,889 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:28,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072308891] [2024-11-09 10:58:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:28,889 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:28,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:28,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:28,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:28,922 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-09 10:58:28,923 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-09 10:58:28,923 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:28,923 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-09 10:58:28,923 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:28,987 INFO L124 PetriNetUnfolderBase]: 26/124 cut-off events. [2024-11-09 10:58:28,988 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2024-11-09 10:58:28,988 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-09 10:58:28,989 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2024-11-09 10:58:28,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 208 flow [2024-11-09 10:58:28,990 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:28,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:28,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-09 10:58:28,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-09 10:58:28,991 INFO L175 Difference]: Start difference. First operand has 70 places, 67 transitions, 156 flow. Second operand 3 states and 155 transitions. [2024-11-09 10:58:28,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 208 flow [2024-11-09 10:58:28,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-09 10:58:28,993 INFO L231 Difference]: Finished difference. Result has 65 places, 63 transitions, 146 flow [2024-11-09 10:58:28,993 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-09 10:58:28,995 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-09 10:58:28,996 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 63 transitions, 146 flow [2024-11-09 10:58:28,996 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-09 10:58:28,996 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:28,996 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:58:28,996 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 10:58:28,996 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:28,997 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:28,997 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-09 10:58:28,997 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:28,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [519421578] [2024-11-09 10:58:28,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:28,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:29,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:29,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:29,057 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:29,057 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [519421578] [2024-11-09 10:58:29,058 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [519421578] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:29,058 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:29,058 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:29,058 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [557714122] [2024-11-09 10:58:29,058 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:29,058 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:29,059 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:29,059 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:29,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:29,083 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-09 10:58:29,083 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-09 10:58:29,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:29,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-09 10:58:29,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:29,134 INFO L124 PetriNetUnfolderBase]: 24/114 cut-off events. [2024-11-09 10:58:29,135 INFO L125 PetriNetUnfolderBase]: For 9/9 co-relation queries the response was YES. [2024-11-09 10:58:29,135 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-09 10:58:29,135 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2024-11-09 10:58:29,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 194 flow [2024-11-09 10:58:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:29,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:29,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-09 10:58:29,138 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-09 10:58:29,138 INFO L175 Difference]: Start difference. First operand has 65 places, 63 transitions, 146 flow. Second operand 3 states and 159 transitions. [2024-11-09 10:58:29,138 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 194 flow [2024-11-09 10:58:29,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:29,139 INFO L231 Difference]: Finished difference. Result has 61 places, 59 transitions, 138 flow [2024-11-09 10:58:29,139 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-09 10:58:29,140 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2024-11-09 10:58:29,140 INFO L471 AbstractCegarLoop]: Abstraction has has 61 places, 59 transitions, 138 flow [2024-11-09 10:58:29,141 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-09 10:58:29,141 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:29,141 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:29,141 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 10:58:29,141 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:29,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:29,142 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-09 10:58:29,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:29,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [895795061] [2024-11-09 10:58:29,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:29,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:29,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:29,405 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:29,405 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:29,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [895795061] [2024-11-09 10:58:29,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [895795061] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:29,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:29,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:58:29,407 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1185092777] [2024-11-09 10:58:29,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:29,407 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:58:29,407 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:29,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:58:29,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:58:29,515 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-09 10:58:29,516 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-09 10:58:29,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:29,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-09 10:58:29,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:29,783 INFO L124 PetriNetUnfolderBase]: 35/141 cut-off events. [2024-11-09 10:58:29,783 INFO L125 PetriNetUnfolderBase]: For 13/13 co-relation queries the response was YES. [2024-11-09 10:58:29,784 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-09 10:58:29,784 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 32 selfloop transitions, 11 changer transitions 0/73 dead transitions. [2024-11-09 10:58:29,784 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 73 transitions, 260 flow [2024-11-09 10:58:29,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:58:29,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:58:29,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-09 10:58:29,789 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-09 10:58:29,789 INFO L175 Difference]: Start difference. First operand has 61 places, 59 transitions, 138 flow. Second operand 10 states and 483 transitions. [2024-11-09 10:58:29,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 73 transitions, 260 flow [2024-11-09 10:58:29,789 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:29,790 INFO L231 Difference]: Finished difference. Result has 74 places, 67 transitions, 209 flow [2024-11-09 10:58:29,791 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-09 10:58:29,791 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2024-11-09 10:58:29,792 INFO L471 AbstractCegarLoop]: Abstraction has has 74 places, 67 transitions, 209 flow [2024-11-09 10:58:29,793 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-09 10:58:29,793 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:29,793 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:29,793 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 10:58:29,793 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:29,793 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:29,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-09 10:58:29,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:29,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775670741] [2024-11-09 10:58:29,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:29,794 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:29,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:30,040 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-09 10:58:30,040 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775670741] [2024-11-09 10:58:30,040 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775670741] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:30,040 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758643577] [2024-11-09 10:58:30,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:30,041 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:30,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:30,043 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:30,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 10:58:30,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:30,125 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 32 conjuncts are in the unsatisfiable core [2024-11-09 10:58:30,129 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:30,205 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-09 10:58:30,233 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2024-11-09 10:58:30,233 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-09 10:58:30,254 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-09 10:58:30,282 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-09 10:58:30,309 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-09 10:58:30,311 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-09 10:58:30,311 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:30,410 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-09 10:58:30,665 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:58:30,666 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-09 10:58:31,120 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-09 10:58:31,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758643577] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:31,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:58:31,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2024-11-09 10:58:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1954504197] [2024-11-09 10:58:31,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:31,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-11-09 10:58:31,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:31,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-11-09 10:58:31,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=201, Unknown=0, NotChecked=0, Total=240 [2024-11-09 10:58:31,825 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 74 [2024-11-09 10:58:31,825 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-09 10:58:31,826 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:31,826 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 74 [2024-11-09 10:58:31,826 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:32,065 INFO L124 PetriNetUnfolderBase]: 35/152 cut-off events. [2024-11-09 10:58:32,066 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2024-11-09 10:58:32,066 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-09 10:58:32,067 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 37 selfloop transitions, 10 changer transitions 0/76 dead transitions. [2024-11-09 10:58:32,067 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 76 transitions, 322 flow [2024-11-09 10:58:32,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:58:32,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:58:32,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 360 transitions. [2024-11-09 10:58:32,068 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6081081081081081 [2024-11-09 10:58:32,068 INFO L175 Difference]: Start difference. First operand has 74 places, 67 transitions, 209 flow. Second operand 8 states and 360 transitions. [2024-11-09 10:58:32,068 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 76 transitions, 322 flow [2024-11-09 10:58:32,069 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 76 transitions, 319 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:32,070 INFO L231 Difference]: Finished difference. Result has 78 places, 66 transitions, 224 flow [2024-11-09 10:58:32,071 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-09 10:58:32,071 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 5 predicate places. [2024-11-09 10:58:32,071 INFO L471 AbstractCegarLoop]: Abstraction has has 78 places, 66 transitions, 224 flow [2024-11-09 10:58:32,072 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-09 10:58:32,072 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:32,072 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:32,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 10:58:32,276 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-09 10:58:32,277 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:32,277 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:32,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-09 10:58:32,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:32,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [713190490] [2024-11-09 10:58:32,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:32,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:32,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:32,594 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-09 10:58:32,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [713190490] [2024-11-09 10:58:32,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [713190490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 10:58:32,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1032415767] [2024-11-09 10:58:32,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:32,596 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 10:58:32,596 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:32,597 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 10:58:32,598 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 10:58:32,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:32,670 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-09 10:58:32,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:32,710 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-09 10:58:32,715 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-09 10:58:32,730 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2024-11-09 10:58:32,731 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-09 10:58:32,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 10:58:32,753 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-09 10:58:32,775 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-09 10:58:32,777 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-09 10:58:32,807 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-09 10:58:32,810 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-09 10:58:32,812 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-09 10:58:32,812 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:32,966 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-09 10:58:32,978 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-09 10:58:32,981 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-09 10:58:33,086 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:58:33,086 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-09 10:58:33,098 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-09 10:58:33,212 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-09 10:58:33,212 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1032415767] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:33,213 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 10:58:33,213 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2024-11-09 10:58:33,213 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1561525474] [2024-11-09 10:58:33,213 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:33,213 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 10:58:33,214 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:33,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 10:58:33,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=292, Unknown=0, NotChecked=0, Total=342 [2024-11-09 10:58:34,499 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 74 [2024-11-09 10:58:34,500 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-09 10:58:34,500 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:34,500 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 74 [2024-11-09 10:58:34,500 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:34,819 INFO L124 PetriNetUnfolderBase]: 33/148 cut-off events. [2024-11-09 10:58:34,820 INFO L125 PetriNetUnfolderBase]: For 51/51 co-relation queries the response was YES. [2024-11-09 10:58:34,820 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-09 10:58:34,821 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 35 selfloop transitions, 10 changer transitions 0/75 dead transitions. [2024-11-09 10:58:34,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 75 transitions, 333 flow [2024-11-09 10:58:34,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:58:34,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:58:34,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2024-11-09 10:58:34,824 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5641891891891891 [2024-11-09 10:58:34,824 INFO L175 Difference]: Start difference. First operand has 78 places, 66 transitions, 224 flow. Second operand 8 states and 334 transitions. [2024-11-09 10:58:34,824 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 75 transitions, 333 flow [2024-11-09 10:58:34,825 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 75 transitions, 299 flow, removed 4 selfloop flow, removed 8 redundant places. [2024-11-09 10:58:34,826 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 208 flow [2024-11-09 10:58:34,828 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-09 10:58:34,829 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-09 10:58:34,831 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 208 flow [2024-11-09 10:58:34,832 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-09 10:58:34,832 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:34,832 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-09 10:58:34,846 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 10:58:35,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable6 [2024-11-09 10:58:35,033 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:35,034 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:35,034 INFO L85 PathProgramCache]: Analyzing trace with hash -500708698, now seen corresponding path program 1 times [2024-11-09 10:58:35,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:35,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801724500] [2024-11-09 10:58:35,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:35,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:35,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:35,192 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:35,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 10:58:35,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801724500] [2024-11-09 10:58:35,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801724500] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:35,192 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:35,193 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 10:58:35,193 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1935523445] [2024-11-09 10:58:35,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:35,193 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 10:58:35,193 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 10:58:35,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 10:58:35,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 10:58:35,245 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 74 [2024-11-09 10:58:35,246 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-09 10:58:35,246 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:35,246 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 74 [2024-11-09 10:58:35,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:35,307 INFO L124 PetriNetUnfolderBase]: 21/77 cut-off events. [2024-11-09 10:58:35,307 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2024-11-09 10:58:35,307 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-09 10:58:35,308 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/36 dead transitions. [2024-11-09 10:58:35,308 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 36 transitions, 196 flow [2024-11-09 10:58:35,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:35,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:35,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 224 transitions. [2024-11-09 10:58:35,310 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6054054054054054 [2024-11-09 10:58:35,310 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 208 flow. Second operand 5 states and 224 transitions. [2024-11-09 10:58:35,310 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 36 transitions, 196 flow [2024-11-09 10:58:35,312 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 36 transitions, 175 flow, removed 0 selfloop flow, removed 8 redundant places. [2024-11-09 10:58:35,313 INFO L231 Difference]: Finished difference. Result has 45 places, 35 transitions, 123 flow [2024-11-09 10:58:35,314 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-09 10:58:35,315 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -28 predicate places. [2024-11-09 10:58:35,315 INFO L471 AbstractCegarLoop]: Abstraction has has 45 places, 35 transitions, 123 flow [2024-11-09 10:58:35,316 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-09 10:58:35,316 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:35,316 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-09 10:58:35,316 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 10:58:35,317 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:35,317 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash -1419302643, now seen corresponding path program 1 times [2024-11-09 10:58:35,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 10:58:35,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541853616] [2024-11-09 10:58:35,318 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:35,318 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 10:58:35,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:35,334 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 10:58:35,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 10:58:35,374 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 10:58:35,374 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 10:58:35,376 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK (60 of 61 remaining) [2024-11-09 10:58:35,378 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 61 remaining) [2024-11-09 10:58:35,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 61 remaining) [2024-11-09 10:58:35,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 61 remaining) [2024-11-09 10:58:35,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 61 remaining) [2024-11-09 10:58:35,379 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 61 remaining) [2024-11-09 10:58:35,380 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (45 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (44 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 61 remaining) [2024-11-09 10:58:35,381 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (37 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (36 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (35 of 61 remaining) [2024-11-09 10:58:35,382 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (34 of 61 remaining) [2024-11-09 10:58:35,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (33 of 61 remaining) [2024-11-09 10:58:35,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (32 of 61 remaining) [2024-11-09 10:58:35,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (31 of 61 remaining) [2024-11-09 10:58:35,383 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (30 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (29 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 61 remaining) [2024-11-09 10:58:35,384 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 61 remaining) [2024-11-09 10:58:35,385 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 61 remaining) [2024-11-09 10:58:35,386 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr4ASSERT_VIOLATIONMEMORY_FREE (8 of 61 remaining) [2024-11-09 10:58:35,387 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr12ASSERT_VIOLATIONMEMORY_FREE (7 of 61 remaining) [2024-11-09 10:58:35,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr5ASSERT_VIOLATIONMEMORY_FREE (6 of 61 remaining) [2024-11-09 10:58:35,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr13ASSERT_VIOLATIONMEMORY_FREE (5 of 61 remaining) [2024-11-09 10:58:35,388 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr6ASSERT_VIOLATIONMEMORY_FREE (4 of 61 remaining) [2024-11-09 10:58:35,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr14ASSERT_VIOLATIONMEMORY_FREE (3 of 61 remaining) [2024-11-09 10:58:35,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr7ASSERT_VIOLATIONMEMORY_FREE (2 of 61 remaining) [2024-11-09 10:58:35,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr8ASSERT_VIOLATIONMEMORY_FREE (1 of 61 remaining) [2024-11-09 10:58:35,389 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location deleteErr9ASSERT_VIOLATIONMEMORY_FREE (0 of 61 remaining) [2024-11-09 10:58:35,389 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 10:58:35,389 INFO L407 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:35,440 INFO L239 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-09 10:58:35,441 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 10:58:35,444 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 10:58:35 BasicIcfg [2024-11-09 10:58:35,445 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 10:58:35,445 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 10:58:35,445 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 10:58:35,446 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 10:58:35,446 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:27" (3/4) ... [2024-11-09 10:58:35,447 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 10:58:35,448 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 10:58:35,449 INFO L158 Benchmark]: Toolchain (without parser) took 8657.88ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 102.6MB in the beginning and 226.4MB in the end (delta: -123.8MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:35,449 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 174.1MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:35,449 INFO L158 Benchmark]: CACSL2BoogieTranslator took 447.68ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 121.3MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2024-11-09 10:58:35,450 INFO L158 Benchmark]: Boogie Procedure Inliner took 31.57ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 119.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 10:58:35,450 INFO L158 Benchmark]: Boogie Preprocessor took 31.48ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 116.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 10:58:35,450 INFO L158 Benchmark]: RCFGBuilder took 504.44ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 86.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2024-11-09 10:58:35,450 INFO L158 Benchmark]: TraceAbstraction took 7632.39ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 85.7MB in the beginning and 226.4MB in the end (delta: -140.7MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:35,450 INFO L158 Benchmark]: Witness Printer took 3.05ms. Allocated memory is still 312.5MB. Free memory is still 226.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 10:58:35,452 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.14ms. Allocated memory is still 174.1MB. Free memory is still 136.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 447.68ms. Allocated memory is still 174.1MB. Free memory was 102.4MB in the beginning and 121.3MB in the end (delta: -18.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 31.57ms. Allocated memory is still 174.1MB. Free memory was 121.3MB in the beginning and 119.2MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.48ms. Allocated memory is still 174.1MB. Free memory was 119.2MB in the beginning and 116.3MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 504.44ms. Allocated memory is still 174.1MB. Free memory was 116.3MB in the beginning and 86.3MB in the end (delta: 29.9MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 7632.39ms. Allocated memory was 174.1MB in the beginning and 312.5MB in the end (delta: 138.4MB). Free memory was 85.7MB in the beginning and 226.4MB in the end (delta: -140.7MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.05ms. Allocated memory is still 312.5MB. Free memory is still 226.4MB. 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: 7.5s, OverallIterations: 9, TraceHistogramMax: 2, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 3.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1493 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1195 mSDsluCounter, 1340 SdHoareTripleChecker+Invalid, 2.5s 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, 0.8s 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, 2.8s 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-09 10:58:35,478 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-?-c7c6ca5-m [2024-11-09 10:58:37,252 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 10:58:37,316 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 10:58:37,322 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 10:58:37,322 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 10:58:37,343 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 10:58:37,347 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 10:58:37,347 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 10:58:37,347 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 10:58:37,347 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 10:58:37,348 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 10:58:37,348 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 10:58:37,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 10:58:37,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 10:58:37,349 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 10:58:37,349 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 10:58:37,349 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 10:58:37,350 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 10:58:37,350 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 10:58:37,350 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 10:58:37,353 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 10:58:37,354 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 10:58:37,355 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 10:58:37,355 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 10:58:37,355 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 10:58:37,355 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 10:58:37,355 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 10:58:37,355 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 10:58:37,356 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 10:58:37,356 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 10:58:37,356 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:37,356 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 10:58:37,356 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 10:58:37,356 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 10:58:37,357 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 10:58:37,357 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 10:58:37,358 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 10:58:37,358 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 10:58:37,359 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 10:58:37,359 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-09 10:58:37,619 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 10:58:37,639 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 10:58:37,641 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 10:58:37,642 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 10:58:37,642 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 10:58:37,643 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-09 10:58:38,904 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 10:58:39,137 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 10:58:39,139 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/pthread-memsafety/list1.i [2024-11-09 10:58:39,155 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ee3e129/3b57d6f70d864cbab0d2d60d91585ae2/FLAG75d7aa552 [2024-11-09 10:58:39,166 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/22ee3e129/3b57d6f70d864cbab0d2d60d91585ae2 [2024-11-09 10:58:39,167 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 10:58:39,168 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 10:58:39,169 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:39,169 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 10:58:39,173 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 10:58:39,175 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,176 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b9e72ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39, skipping insertion in model container [2024-11-09 10:58:39,176 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,216 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 10:58:39,580 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:58:39,586 WARN L1070 CHandler]: saw a pointer cast to a type that we could not get a type size for, not adapting memory model [2024-11-09 10:58:39,598 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:39,607 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 10:58:39,660 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 10:58:39,710 INFO L204 MainTranslator]: Completed translation [2024-11-09 10:58:39,710 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39 WrapperNode [2024-11-09 10:58:39,710 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 10:58:39,711 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:39,711 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 10:58:39,711 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 10:58:39,716 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,741 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,767 INFO L138 Inliner]: procedures = 265, calls = 23, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 61 [2024-11-09 10:58:39,767 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 10:58:39,769 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 10:58:39,769 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 10:58:39,769 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 10:58:39,778 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,778 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,784 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,801 INFO L175 MemorySlicer]: Split 11 memory accesses to 2 slices as follows [3, 8]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 3 writes are split as follows [1, 2]. [2024-11-09 10:58:39,801 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,801 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,815 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,817 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,821 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,822 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,827 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 10:58:39,828 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 10:58:39,828 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 10:58:39,828 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 10:58:39,829 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (1/1) ... [2024-11-09 10:58:39,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 10:58:39,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 10:58:39,856 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 10:58:39,859 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 10:58:39,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 10:58:39,895 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-09 10:58:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure delete [2024-11-09 10:58:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure delete [2024-11-09 10:58:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure build [2024-11-09 10:58:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure build [2024-11-09 10:58:39,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 10:58:39,896 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 10:58:39,897 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-09 10:58:40,041 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 10:58:40,043 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 10:58:40,349 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-09 10:58:40,349 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 10:58:40,448 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 10:58:40,448 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-09 10:58:40,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:40 BoogieIcfgContainer [2024-11-09 10:58:40,449 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 10:58:40,451 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 10:58:40,451 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 10:58:40,454 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 10:58:40,455 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 10:58:39" (1/3) ... [2024-11-09 10:58:40,455 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c152681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:40, skipping insertion in model container [2024-11-09 10:58:40,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 10:58:39" (2/3) ... [2024-11-09 10:58:40,456 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c152681 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 10:58:40, skipping insertion in model container [2024-11-09 10:58:40,456 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 10:58:40" (3/3) ... [2024-11-09 10:58:40,457 INFO L112 eAbstractionObserver]: Analyzing ICFG list1.i [2024-11-09 10:58:40,471 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 10:58:40,471 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 30 error locations. [2024-11-09 10:58:40,471 INFO L489 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-09 10:58:40,549 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-09 10:58:40,580 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 74 transitions, 162 flow [2024-11-09 10:58:40,614 INFO L124 PetriNetUnfolderBase]: 5/72 cut-off events. [2024-11-09 10:58:40,614 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-09 10:58:40,617 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-09 10:58:40,617 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 74 transitions, 162 flow [2024-11-09 10:58:40,620 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 71 transitions, 154 flow [2024-11-09 10:58:40,629 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 10:58:40,633 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;@58210235, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 10:58:40,634 INFO L334 AbstractCegarLoop]: Starting to check reachability of 61 error locations. [2024-11-09 10:58:40,636 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-09 10:58:40,637 INFO L124 PetriNetUnfolderBase]: 0/8 cut-off events. [2024-11-09 10:58:40,637 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2024-11-09 10:58:40,637 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:40,637 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:58:40,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:40,641 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:40,642 INFO L85 PathProgramCache]: Analyzing trace with hash 273116001, now seen corresponding path program 1 times [2024-11-09 10:58:40,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:40,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [297411173] [2024-11-09 10:58:40,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:40,653 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-09 10:58:40,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:40,655 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-09 10:58:40,656 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-09 10:58:40,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:40,740 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 7 conjuncts are in the unsatisfiable core [2024-11-09 10:58:40,744 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:40,790 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-09 10:58:40,829 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 10:58:40,830 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-09 10:58:40,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:40,849 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:40,850 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:40,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [297411173] [2024-11-09 10:58:40,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [297411173] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:40,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:40,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:40,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164646808] [2024-11-09 10:58:40,852 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:40,858 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:40,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:40,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:40,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:40,992 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-09 10:58:40,995 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-09 10:58:40,995 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:40,995 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-09 10:58:40,996 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:41,174 INFO L124 PetriNetUnfolderBase]: 25/148 cut-off events. [2024-11-09 10:58:41,174 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2024-11-09 10:58:41,177 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-09 10:58:41,179 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 28 selfloop transitions, 5 changer transitions 0/75 dead transitions. [2024-11-09 10:58:41,179 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 75 transitions, 231 flow [2024-11-09 10:58:41,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:41,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:41,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 212 transitions. [2024-11-09 10:58:41,201 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-09 10:58:41,202 INFO L175 Difference]: Start difference. First operand has 73 places, 71 transitions, 154 flow. Second operand 4 states and 212 transitions. [2024-11-09 10:58:41,202 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 75 transitions, 231 flow [2024-11-09 10:58:41,206 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 75 transitions, 221 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:41,209 INFO L231 Difference]: Finished difference. Result has 71 places, 69 transitions, 159 flow [2024-11-09 10:58:41,211 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-09 10:58:41,214 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2024-11-09 10:58:41,214 INFO L471 AbstractCegarLoop]: Abstraction has has 71 places, 69 transitions, 159 flow [2024-11-09 10:58:41,215 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-09 10:58:41,215 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:41,215 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 10:58:41,221 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-09 10:58:41,418 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-09 10:58:41,419 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:41,419 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:41,419 INFO L85 PathProgramCache]: Analyzing trace with hash 273116002, now seen corresponding path program 1 times [2024-11-09 10:58:41,420 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:41,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [849380081] [2024-11-09 10:58:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:41,420 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-09 10:58:41,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:41,423 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-09 10:58:41,423 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-09 10:58:41,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:41,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 44 conjuncts, 12 conjuncts are in the unsatisfiable core [2024-11-09 10:58:41,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:41,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-09 10:58:41,518 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-09 10:58:41,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:58:41,566 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-09 10:58:41,577 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:58:41,577 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-09 10:58:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:41,587 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:41,587 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:41,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [849380081] [2024-11-09 10:58:41,587 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [849380081] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:41,587 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:41,587 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 10:58:41,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [955107060] [2024-11-09 10:58:41,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:41,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 10:58:41,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:41,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 10:58:41,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 10:58:41,712 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 45 out of 74 [2024-11-09 10:58:41,712 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-09 10:58:41,712 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:41,712 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 45 of 74 [2024-11-09 10:58:41,712 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:41,843 INFO L124 PetriNetUnfolderBase]: 27/156 cut-off events. [2024-11-09 10:58:41,844 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2024-11-09 10:58:41,844 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-09 10:58:41,845 INFO L140 encePairwiseOnDemand]: 66/74 looper letters, 29 selfloop transitions, 6 changer transitions 0/76 dead transitions. [2024-11-09 10:58:41,845 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 76 transitions, 247 flow [2024-11-09 10:58:41,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 10:58:41,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-09 10:58:41,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 217 transitions. [2024-11-09 10:58:41,849 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7331081081081081 [2024-11-09 10:58:41,849 INFO L175 Difference]: Start difference. First operand has 71 places, 69 transitions, 159 flow. Second operand 4 states and 217 transitions. [2024-11-09 10:58:41,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 76 transitions, 247 flow [2024-11-09 10:58:41,850 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 76 transitions, 241 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:41,851 INFO L231 Difference]: Finished difference. Result has 72 places, 69 transitions, 175 flow [2024-11-09 10:58:41,851 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-09 10:58:41,852 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2024-11-09 10:58:41,852 INFO L471 AbstractCegarLoop]: Abstraction has has 72 places, 69 transitions, 175 flow [2024-11-09 10:58:41,853 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-09 10:58:41,853 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:41,853 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:58:41,857 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-09 10:58:42,053 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-09 10:58:42,054 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:42,054 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:42,054 INFO L85 PathProgramCache]: Analyzing trace with hash -123338293, now seen corresponding path program 1 times [2024-11-09 10:58:42,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:42,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [468900164] [2024-11-09 10:58:42,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:42,055 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-09 10:58:42,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:42,057 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-09 10:58:42,058 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-09 10:58:42,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:42,108 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 10:58:42,110 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:42,116 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-09 10:58:42,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:42,128 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:42,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:42,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [468900164] [2024-11-09 10:58:42,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [468900164] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:42,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:42,129 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:42,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193145226] [2024-11-09 10:58:42,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:42,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:42,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:42,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:42,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:42,178 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 74 [2024-11-09 10:58:42,178 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-09 10:58:42,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:42,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 74 [2024-11-09 10:58:42,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:42,243 INFO L124 PetriNetUnfolderBase]: 28/134 cut-off events. [2024-11-09 10:58:42,243 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:58:42,243 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-09 10:58:42,244 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 27 selfloop transitions, 3 changer transitions 0/66 dead transitions. [2024-11-09 10:58:42,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 229 flow [2024-11-09 10:58:42,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:42,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:42,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2024-11-09 10:58:42,245 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6981981981981982 [2024-11-09 10:58:42,245 INFO L175 Difference]: Start difference. First operand has 72 places, 69 transitions, 175 flow. Second operand 3 states and 155 transitions. [2024-11-09 10:58:42,245 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 229 flow [2024-11-09 10:58:42,246 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:42,247 INFO L231 Difference]: Finished difference. Result has 68 places, 65 transitions, 164 flow [2024-11-09 10:58:42,247 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-09 10:58:42,247 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2024-11-09 10:58:42,247 INFO L471 AbstractCegarLoop]: Abstraction has has 68 places, 65 transitions, 164 flow [2024-11-09 10:58:42,248 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-09 10:58:42,248 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:42,248 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-09 10:58:42,252 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 (4)] Ended with exit code 0 [2024-11-09 10:58:42,450 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-09 10:58:42,451 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting buildErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:42,451 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:42,452 INFO L85 PathProgramCache]: Analyzing trace with hash -123338292, now seen corresponding path program 1 times [2024-11-09 10:58:42,452 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:42,452 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [182304976] [2024-11-09 10:58:42,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:42,452 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-09 10:58:42,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:42,454 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-09 10:58:42,455 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-09 10:58:42,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:42,500 INFO L255 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 10:58:42,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:42,507 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-09 10:58:42,525 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:42,525 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:42,525 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:42,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [182304976] [2024-11-09 10:58:42,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [182304976] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:42,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:42,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 10:58:42,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108134976] [2024-11-09 10:58:42,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:42,526 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 10:58:42,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:42,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 10:58:42,526 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 10:58:42,580 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 43 out of 74 [2024-11-09 10:58:42,581 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-09 10:58:42,581 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:42,581 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 43 of 74 [2024-11-09 10:58:42,581 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:42,646 INFO L124 PetriNetUnfolderBase]: 26/122 cut-off events. [2024-11-09 10:58:42,646 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2024-11-09 10:58:42,646 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-09 10:58:42,647 INFO L140 encePairwiseOnDemand]: 68/74 looper letters, 25 selfloop transitions, 3 changer transitions 0/62 dead transitions. [2024-11-09 10:58:42,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 214 flow [2024-11-09 10:58:42,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 10:58:42,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-09 10:58:42,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2024-11-09 10:58:42,648 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7162162162162162 [2024-11-09 10:58:42,648 INFO L175 Difference]: Start difference. First operand has 68 places, 65 transitions, 164 flow. Second operand 3 states and 159 transitions. [2024-11-09 10:58:42,648 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 214 flow [2024-11-09 10:58:42,649 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:42,650 INFO L231 Difference]: Finished difference. Result has 64 places, 61 transitions, 156 flow [2024-11-09 10:58:42,650 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-09 10:58:42,651 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2024-11-09 10:58:42,651 INFO L471 AbstractCegarLoop]: Abstraction has has 64 places, 61 transitions, 156 flow [2024-11-09 10:58:42,651 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-09 10:58:42,651 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:42,651 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:42,655 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-09 10:58:42,851 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-09 10:58:42,852 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting buildErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:42,852 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:42,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1335115542, now seen corresponding path program 1 times [2024-11-09 10:58:42,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:42,853 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [651303556] [2024-11-09 10:58:42,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:42,853 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-09 10:58:42,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:42,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-09 10:58:42,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-09 10:58:42,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:42,919 INFO L255 TraceCheckSpWp]: Trace formula consists of 88 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 10:58:42,923 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:42,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 10:58:42,991 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-09 10:58:43,000 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2024-11-09 10:58:43,000 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-09 10:58:43,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:43,021 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:43,021 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:43,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [651303556] [2024-11-09 10:58:43,022 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [651303556] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:43,022 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:43,022 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 10:58:43,022 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1540023990] [2024-11-09 10:58:43,022 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:43,022 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 10:58:43,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:43,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 10:58:43,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-09 10:58:43,133 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 42 out of 74 [2024-11-09 10:58:43,133 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-09 10:58:43,133 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:43,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 42 of 74 [2024-11-09 10:58:43,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:43,238 INFO L124 PetriNetUnfolderBase]: 27/121 cut-off events. [2024-11-09 10:58:43,238 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2024-11-09 10:58:43,238 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-09 10:58:43,239 INFO L140 encePairwiseOnDemand]: 69/74 looper letters, 26 selfloop transitions, 5 changer transitions 0/63 dead transitions. [2024-11-09 10:58:43,239 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 220 flow [2024-11-09 10:58:43,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 10:58:43,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-09 10:58:43,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 240 transitions. [2024-11-09 10:58:43,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6486486486486487 [2024-11-09 10:58:43,240 INFO L175 Difference]: Start difference. First operand has 64 places, 61 transitions, 156 flow. Second operand 5 states and 240 transitions. [2024-11-09 10:58:43,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 220 flow [2024-11-09 10:58:43,241 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 214 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:43,241 INFO L231 Difference]: Finished difference. Result has 65 places, 60 transitions, 156 flow [2024-11-09 10:58:43,241 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-09 10:58:43,242 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2024-11-09 10:58:43,242 INFO L471 AbstractCegarLoop]: Abstraction has has 65 places, 60 transitions, 156 flow [2024-11-09 10:58:43,242 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-09 10:58:43,242 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:43,242 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:43,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 10:58:43,445 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-09 10:58:43,446 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:43,446 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:43,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1335114422, now seen corresponding path program 1 times [2024-11-09 10:58:43,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:43,447 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [186824648] [2024-11-09 10:58:43,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:43,447 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-09 10:58:43,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:43,449 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-09 10:58:43,450 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-09 10:58:43,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:43,501 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-09 10:58:43,503 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:43,591 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-09 10:58:43,596 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-09 10:58:43,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 10:58:43,631 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 10:58:43,631 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:43,631 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [186824648] [2024-11-09 10:58:43,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [186824648] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 10:58:43,631 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 10:58:43,631 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 10:58:43,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1862423814] [2024-11-09 10:58:43,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 10:58:43,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 10:58:43,632 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:43,632 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 10:58:43,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-11-09 10:58:43,804 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 44 out of 74 [2024-11-09 10:58:43,804 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-09 10:58:43,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:43,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 44 of 74 [2024-11-09 10:58:43,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:44,166 INFO L124 PetriNetUnfolderBase]: 36/144 cut-off events. [2024-11-09 10:58:44,166 INFO L125 PetriNetUnfolderBase]: For 34/34 co-relation queries the response was YES. [2024-11-09 10:58:44,167 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-09 10:58:44,167 INFO L140 encePairwiseOnDemand]: 63/74 looper letters, 33 selfloop transitions, 11 changer transitions 0/74 dead transitions. [2024-11-09 10:58:44,167 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 74 transitions, 288 flow [2024-11-09 10:58:44,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 10:58:44,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2024-11-09 10:58:44,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 483 transitions. [2024-11-09 10:58:44,169 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6527027027027027 [2024-11-09 10:58:44,169 INFO L175 Difference]: Start difference. First operand has 65 places, 60 transitions, 156 flow. Second operand 10 states and 483 transitions. [2024-11-09 10:58:44,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 74 transitions, 288 flow [2024-11-09 10:58:44,170 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 74 transitions, 272 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-09 10:58:44,170 INFO L231 Difference]: Finished difference. Result has 76 places, 68 transitions, 227 flow [2024-11-09 10:58:44,171 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-09 10:58:44,171 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 3 predicate places. [2024-11-09 10:58:44,171 INFO L471 AbstractCegarLoop]: Abstraction has has 76 places, 68 transitions, 227 flow [2024-11-09 10:58:44,172 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-09 10:58:44,172 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:44,172 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:44,175 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 10:58:44,372 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-09 10:58:44,373 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting buildErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:44,373 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185515, now seen corresponding path program 1 times [2024-11-09 10:58:44,373 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:44,374 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1312998428] [2024-11-09 10:58:44,374 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:44,374 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 10:58:44,374 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:44,377 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-09 10:58:44,378 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-09 10:58:44,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:44,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-09 10:58:44,456 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:44,464 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-09 10:58:44,550 INFO L349 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2024-11-09 10:58:44,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 20 [2024-11-09 10:58:44,575 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-09 10:58:44,598 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2024-11-09 10:58:44,598 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-09 10:58:44,623 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-09 10:58:44,643 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-09 10:58:44,669 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-09 10:58:44,691 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-09 10:58:44,692 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:44,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 36 treesize of output 32 [2024-11-09 10:58:49,133 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-09 10:58:49,133 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 10:58:49,133 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1312998428] [2024-11-09 10:58:49,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1312998428] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 10:58:49,133 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 10:58:49,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2024-11-09 10:58:49,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1008951312] [2024-11-09 10:58:49,134 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 10:58:49,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-09 10:58:49,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 10:58:49,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-09 10:58:49,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=127, Unknown=0, NotChecked=0, Total=156 [2024-11-09 10:58:53,151 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-09 10:58:53,578 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 74 [2024-11-09 10:58:53,578 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 68 transitions, 227 flow. Second operand has 13 states, 13 states have (on average 32.30769230769231) internal successors, (420), 13 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:53,578 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-09 10:58:53,578 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 74 [2024-11-09 10:58:53,578 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-09 10:58:53,961 INFO L124 PetriNetUnfolderBase]: 44/168 cut-off events. [2024-11-09 10:58:53,961 INFO L125 PetriNetUnfolderBase]: For 41/41 co-relation queries the response was YES. [2024-11-09 10:58:53,962 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-09 10:58:53,962 INFO L140 encePairwiseOnDemand]: 65/74 looper letters, 47 selfloop transitions, 11 changer transitions 0/80 dead transitions. [2024-11-09 10:58:53,962 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 80 transitions, 368 flow [2024-11-09 10:58:53,964 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 10:58:53,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-09 10:58:53,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 298 transitions. [2024-11-09 10:58:53,964 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5033783783783784 [2024-11-09 10:58:53,964 INFO L175 Difference]: Start difference. First operand has 76 places, 68 transitions, 227 flow. Second operand 8 states and 298 transitions. [2024-11-09 10:58:53,965 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 80 transitions, 368 flow [2024-11-09 10:58:53,966 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 80 transitions, 365 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-09 10:58:53,966 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 244 flow [2024-11-09 10:58:53,966 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-09 10:58:53,967 INFO L277 CegarLoopForPetriNet]: 73 programPoint places, 7 predicate places. [2024-11-09 10:58:53,971 INFO L471 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 244 flow [2024-11-09 10:58:53,971 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 32.30769230769231) internal successors, (420), 13 states have internal predecessors, (420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 10:58:53,972 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-09 10:58:53,972 INFO L204 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 10:58:53,978 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-09 10:58:54,172 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-09 10:58:54,172 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting buildErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [buildErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, buildErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 58 more)] === [2024-11-09 10:58:54,173 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 10:58:54,173 INFO L85 PathProgramCache]: Analyzing trace with hash 1227185516, now seen corresponding path program 1 times [2024-11-09 10:58:54,173 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 10:58:54,173 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1662277432] [2024-11-09 10:58:54,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 10:58:54,173 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-09 10:58:54,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 10:58:54,174 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-09 10:58:54,175 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-09 10:58:54,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 10:58:54,252 INFO L255 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 10:58:54,254 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 10:58:54,290 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 10:58:54,328 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-09 10:58:54,333 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-09 10:58:54,376 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 10:58:54,376 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 21 [2024-11-09 10:58:54,395 INFO L349 Elim1Store]: treesize reduction 6, result has 57.1 percent of original size [2024-11-09 10:58:54,395 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-09 10:58:54,417 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-09 10:58:54,446 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-09 10:58:54,449 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-09 10:58:54,489 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-09 10:58:54,493 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-09 10:58:54,507 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-09 10:58:54,507 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 10:58:54,813 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-09 10:58:54,832 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-09 10:58:54,835 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-09 10:58:57,318 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 10:58:57,319 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