./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 23:07:33,672 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 23:07:33,762 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 23:07:33,768 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 23:07:33,768 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 23:07:33,807 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 23:07:33,811 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 23:07:33,812 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 23:07:33,813 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 23:07:33,818 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 23:07:33,819 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 23:07:33,820 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 23:07:33,821 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 23:07:33,822 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 23:07:33,823 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 23:07:33,823 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 23:07:33,824 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 23:07:33,824 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 23:07:33,825 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 23:07:33,825 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 23:07:33,825 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 23:07:33,826 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 23:07:33,826 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 23:07:33,827 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 23:07:33,827 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 23:07:33,828 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 23:07:33,829 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 23:07:33,829 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 23:07:33,829 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 23:07:33,830 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:33,831 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 23:07:33,831 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 23:07:33,832 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 23:07:33,832 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 23:07:33,832 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 23:07:33,832 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 23:07:33,833 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 23:07:33,833 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 23:07:33,833 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 531fb1e21d8f5a9631a3764359a014fcdd0042558e9afceaf1b553fa03cda562 [2023-11-06 23:07:34,102 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 23:07:34,178 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 23:07:34,181 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 23:07:34,182 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 23:07:34,197 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 23:07:34,198 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2023-11-06 23:07:37,384 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 23:07:37,754 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 23:07:37,757 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/sv-benchmarks/c/goblint-regression/09-regions_09-arraylist-deref.i [2023-11-06 23:07:37,786 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/data/e3ce3aa24/d301d6e010e24290b5dc8f32d0aa0674/FLAGb55640f2d [2023-11-06 23:07:37,809 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/data/e3ce3aa24/d301d6e010e24290b5dc8f32d0aa0674 [2023-11-06 23:07:37,813 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 23:07:37,815 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 23:07:37,816 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:37,816 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 23:07:37,822 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 23:07:37,823 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:37" (1/1) ... [2023-11-06 23:07:37,824 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5a4402a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:37, skipping insertion in model container [2023-11-06 23:07:37,824 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 11:07:37" (1/1) ... [2023-11-06 23:07:37,897 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 23:07:38,615 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:38,630 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 23:07:38,677 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 23:07:38,782 INFO L206 MainTranslator]: Completed translation [2023-11-06 23:07:38,783 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38 WrapperNode [2023-11-06 23:07:38,783 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 23:07:38,784 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:38,785 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 23:07:38,785 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 23:07:38,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,841 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,888 INFO L138 Inliner]: procedures = 371, calls = 35, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 112 [2023-11-06 23:07:38,888 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 23:07:38,889 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 23:07:38,889 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 23:07:38,889 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 23:07:38,899 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,899 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,916 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,916 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,925 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,927 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,949 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,951 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,955 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 23:07:38,956 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 23:07:38,956 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 23:07:38,956 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 23:07:38,957 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (1/1) ... [2023-11-06 23:07:38,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 23:07:39,015 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 23:07:39,035 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 23:07:39,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 23:07:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 23:07:39,093 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 23:07:39,095 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 23:07:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-06 23:07:39,096 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2023-11-06 23:07:39,096 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2023-11-06 23:07:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 23:07:39,097 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 23:07:39,097 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 23:07:39,099 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 23:07:39,299 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 23:07:39,301 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 23:07:39,792 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 23:07:39,802 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 23:07:39,808 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-06 23:07:39,811 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:39 BoogieIcfgContainer [2023-11-06 23:07:39,812 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 23:07:39,815 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 23:07:39,815 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 23:07:39,819 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 23:07:39,819 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 11:07:37" (1/3) ... [2023-11-06 23:07:39,820 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb6a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:39, skipping insertion in model container [2023-11-06 23:07:39,820 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 11:07:38" (2/3) ... [2023-11-06 23:07:39,822 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@deb6a4b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 11:07:39, skipping insertion in model container [2023-11-06 23:07:39,822 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:39" (3/3) ... [2023-11-06 23:07:39,824 INFO L112 eAbstractionObserver]: Analyzing ICFG 09-regions_09-arraylist-deref.i [2023-11-06 23:07:39,843 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 23:07:39,843 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2023-11-06 23:07:39,844 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 23:07:40,013 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-06 23:07:40,060 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 183 places, 181 transitions, 366 flow [2023-11-06 23:07:40,139 INFO L124 PetriNetUnfolderBase]: 2/180 cut-off events. [2023-11-06 23:07:40,140 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:40,145 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 189 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-06 23:07:40,146 INFO L82 GeneralOperation]: Start removeDead. Operand has 183 places, 181 transitions, 366 flow [2023-11-06 23:07:40,153 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 182 places, 180 transitions, 363 flow [2023-11-06 23:07:40,157 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 23:07:40,168 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 180 transitions, 363 flow [2023-11-06 23:07:40,172 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 182 places, 180 transitions, 363 flow [2023-11-06 23:07:40,172 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 182 places, 180 transitions, 363 flow [2023-11-06 23:07:40,223 INFO L124 PetriNetUnfolderBase]: 2/180 cut-off events. [2023-11-06 23:07:40,226 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:07:40,228 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184 conditions, 180 events. 2/180 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 189 event pairs, 0 based on Foata normal form. 0/139 useless extension candidates. Maximal degree in co-relation 94. Up to 2 conditions per place. [2023-11-06 23:07:40,231 INFO L119 LiptonReduction]: Number of co-enabled transitions 3192 [2023-11-06 23:08:13,011 WARN L293 SmtUtils]: Spent 7.30s on a formula simplification. DAG size of input: 197 DAG size of output: 187 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:08:23,701 WARN L293 SmtUtils]: Spent 7.66s on a formula simplification. DAG size of input: 194 DAG size of output: 184 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:08:39,121 WARN L293 SmtUtils]: Spent 12.69s on a formula simplification. DAG size of input: 238 DAG size of output: 229 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:08:44,836 WARN L293 SmtUtils]: Spent 5.71s on a formula simplification that was a NOOP. DAG size: 219 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:08:59,106 WARN L293 SmtUtils]: Spent 14.27s on a formula simplification. DAG size of input: 240 DAG size of output: 231 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:09:05,208 WARN L293 SmtUtils]: Spent 6.10s on a formula simplification that was a NOOP. DAG size: 221 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:09:29,758 WARN L293 SmtUtils]: Spent 24.23s on a formula simplification. DAG size of input: 250 DAG size of output: 247 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:09:38,782 WARN L293 SmtUtils]: Spent 9.02s on a formula simplification that was a NOOP. DAG size: 228 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:09:59,985 WARN L293 SmtUtils]: Spent 21.20s on a formula simplification. DAG size of input: 252 DAG size of output: 246 (called from [L 279] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:10:07,695 WARN L293 SmtUtils]: Spent 7.69s on a formula simplification that was a NOOP. DAG size: 227 (called from [L 302] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.cfg.transitions.TransFormulaUtils.sequentialComposition) [2023-11-06 23:10:08,086 INFO L134 LiptonReduction]: Checked pairs total: 15539 [2023-11-06 23:10:08,086 INFO L136 LiptonReduction]: Total number of compositions: 270 [2023-11-06 23:10:08,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 23:10:08,114 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@40dda350, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 23:10:08,114 INFO L358 AbstractCegarLoop]: Starting to check reachability of 52 error locations. [2023-11-06 23:10:08,117 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 23:10:08,117 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-06 23:10:08,117 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:08,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:08,118 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-06 23:10:08,119 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:08,125 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:08,126 INFO L85 PathProgramCache]: Analyzing trace with hash 712, now seen corresponding path program 1 times [2023-11-06 23:10:08,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:08,139 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1800034816] [2023-11-06 23:10:08,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:08,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:08,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:08,317 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:08,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:08,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1800034816] [2023-11-06 23:10:08,319 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1800034816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:08,320 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:08,320 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-06 23:10:08,322 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31648679] [2023-11-06 23:10:08,323 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:08,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-06 23:10:08,342 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:08,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-06 23:10:08,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-06 23:10:08,384 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 178 out of 451 [2023-11-06 23:10:08,391 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 58 transitions, 119 flow. Second operand has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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) [2023-11-06 23:10:08,392 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:08,392 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 178 of 451 [2023-11-06 23:10:08,393 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:08,775 INFO L124 PetriNetUnfolderBase]: 192/453 cut-off events. [2023-11-06 23:10:08,775 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:08,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 872 conditions, 453 events. 192/453 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2253 event pairs, 192 based on Foata normal form. 0/272 useless extension candidates. Maximal degree in co-relation 863. Up to 415 conditions per place. [2023-11-06 23:10:08,786 INFO L140 encePairwiseOnDemand]: 429/451 looper letters, 30 selfloop transitions, 0 changer transitions 0/36 dead transitions. [2023-11-06 23:10:08,786 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 36 transitions, 135 flow [2023-11-06 23:10:08,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-06 23:10:08,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-06 23:10:08,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 408 transitions. [2023-11-06 23:10:08,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4523281596452328 [2023-11-06 23:10:08,814 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 408 transitions. [2023-11-06 23:10:08,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 408 transitions. [2023-11-06 23:10:08,819 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:08,822 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 408 transitions. [2023-11-06 23:10:08,828 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 204.0) internal successors, (408), 2 states have internal predecessors, (408), 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) [2023-11-06 23:10:08,834 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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) [2023-11-06 23:10:08,836 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 451.0) internal successors, (1353), 3 states have internal predecessors, (1353), 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) [2023-11-06 23:10:08,838 INFO L175 Difference]: Start difference. First operand has 62 places, 58 transitions, 119 flow. Second operand 2 states and 408 transitions. [2023-11-06 23:10:08,840 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 36 transitions, 135 flow [2023-11-06 23:10:08,843 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 36 transitions, 134 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:08,846 INFO L231 Difference]: Finished difference. Result has 40 places, 36 transitions, 74 flow [2023-11-06 23:10:08,848 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=40, PETRI_TRANSITIONS=36} [2023-11-06 23:10:08,854 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -22 predicate places. [2023-11-06 23:10:08,854 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 36 transitions, 74 flow [2023-11-06 23:10:08,855 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 178.5) internal successors, (357), 2 states have internal predecessors, (357), 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) [2023-11-06 23:10:08,855 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:08,855 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 23:10:08,855 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 23:10:08,856 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:08,857 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:08,857 INFO L85 PathProgramCache]: Analyzing trace with hash 22271031, now seen corresponding path program 1 times [2023-11-06 23:10:08,858 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:08,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [156024837] [2023-11-06 23:10:08,859 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:08,859 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:09,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:09,615 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [156024837] [2023-11-06 23:10:09,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [156024837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:09,616 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:09,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:09,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381916197] [2023-11-06 23:10:09,616 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:09,618 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:09,618 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:09,619 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:09,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:09,821 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 168 out of 451 [2023-11-06 23:10:09,823 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 36 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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) [2023-11-06 23:10:09,823 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:09,823 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 168 of 451 [2023-11-06 23:10:09,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:10,100 INFO L124 PetriNetUnfolderBase]: 214/499 cut-off events. [2023-11-06 23:10:10,100 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 23:10:10,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 980 conditions, 499 events. 214/499 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2467 event pairs, 131 based on Foata normal form. 0/311 useless extension candidates. Maximal degree in co-relation 977. Up to 345 conditions per place. [2023-11-06 23:10:10,106 INFO L140 encePairwiseOnDemand]: 445/451 looper letters, 46 selfloop transitions, 4 changer transitions 0/54 dead transitions. [2023-11-06 23:10:10,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 54 transitions, 210 flow [2023-11-06 23:10:10,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:10,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:10,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 556 transitions. [2023-11-06 23:10:10,111 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4109386548410939 [2023-11-06 23:10:10,111 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 556 transitions. [2023-11-06 23:10:10,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 556 transitions. [2023-11-06 23:10:10,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:10,113 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 556 transitions. [2023-11-06 23:10:10,115 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 185.33333333333334) internal successors, (556), 3 states have internal predecessors, (556), 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) [2023-11-06 23:10:10,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:10,123 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:10,123 INFO L175 Difference]: Start difference. First operand has 40 places, 36 transitions, 74 flow. Second operand 3 states and 556 transitions. [2023-11-06 23:10:10,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 54 transitions, 210 flow [2023-11-06 23:10:10,124 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 54 transitions, 210 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:10:10,126 INFO L231 Difference]: Finished difference. Result has 43 places, 37 transitions, 98 flow [2023-11-06 23:10:10,127 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=43, PETRI_TRANSITIONS=37} [2023-11-06 23:10:10,128 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -19 predicate places. [2023-11-06 23:10:10,128 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 37 transitions, 98 flow [2023-11-06 23:10:10,129 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 169.33333333333334) internal successors, (508), 3 states have internal predecessors, (508), 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) [2023-11-06 23:10:10,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:10,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2023-11-06 23:10:10,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 23:10:10,130 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:10,131 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:10,131 INFO L85 PathProgramCache]: Analyzing trace with hash 22271032, now seen corresponding path program 1 times [2023-11-06 23:10:10,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:10,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600651253] [2023-11-06 23:10:10,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:10,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:10,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:10,477 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:10,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:10,478 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600651253] [2023-11-06 23:10:10,479 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600651253] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:10,479 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:10,479 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 23:10:10,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51083819] [2023-11-06 23:10:10,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:10,480 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:10,480 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:10,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:10,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:10,653 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 164 out of 451 [2023-11-06 23:10:10,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 37 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2023-11-06 23:10:10,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:10,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 164 of 451 [2023-11-06 23:10:10,655 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:11,057 INFO L124 PetriNetUnfolderBase]: 330/800 cut-off events. [2023-11-06 23:10:11,057 INFO L125 PetriNetUnfolderBase]: For 38/39 co-relation queries the response was YES. [2023-11-06 23:10:11,062 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1625 conditions, 800 events. 330/800 cut-off events. For 38/39 co-relation queries the response was YES. Maximal size of possible extension queue 61. Compared 5086 event pairs, 76 based on Foata normal form. 0/489 useless extension candidates. Maximal degree in co-relation 1620. Up to 414 conditions per place. [2023-11-06 23:10:11,070 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 55 selfloop transitions, 4 changer transitions 0/65 dead transitions. [2023-11-06 23:10:11,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 65 transitions, 284 flow [2023-11-06 23:10:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:11,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 548 transitions. [2023-11-06 23:10:11,074 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4050258684405026 [2023-11-06 23:10:11,074 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 548 transitions. [2023-11-06 23:10:11,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 548 transitions. [2023-11-06 23:10:11,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:11,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 548 transitions. [2023-11-06 23:10:11,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.66666666666666) internal successors, (548), 3 states have internal predecessors, (548), 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) [2023-11-06 23:10:11,083 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:11,085 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:11,086 INFO L175 Difference]: Start difference. First operand has 43 places, 37 transitions, 98 flow. Second operand 3 states and 548 transitions. [2023-11-06 23:10:11,086 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 65 transitions, 284 flow [2023-11-06 23:10:11,092 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 65 transitions, 272 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:11,094 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 120 flow [2023-11-06 23:10:11,094 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=90, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-06 23:10:11,096 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -17 predicate places. [2023-11-06 23:10:11,097 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 120 flow [2023-11-06 23:10:11,098 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 165.33333333333334) internal successors, (496), 3 states have internal predecessors, (496), 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) [2023-11-06 23:10:11,099 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:11,099 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:11,099 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 23:10:11,099 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:11,100 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:11,100 INFO L85 PathProgramCache]: Analyzing trace with hash 690483227, now seen corresponding path program 1 times [2023-11-06 23:10:11,101 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:11,101 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1222871411] [2023-11-06 23:10:11,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:11,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:11,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:11,306 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:11,307 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:11,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1222871411] [2023-11-06 23:10:11,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1222871411] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:11,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:11,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:11,308 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659628439] [2023-11-06 23:10:11,309 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:11,309 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:11,309 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:11,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:11,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:11,461 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 451 [2023-11-06 23:10:11,463 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-06 23:10:11,463 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:11,463 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 451 [2023-11-06 23:10:11,463 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:11,905 INFO L124 PetriNetUnfolderBase]: 348/794 cut-off events. [2023-11-06 23:10:11,905 INFO L125 PetriNetUnfolderBase]: For 170/170 co-relation queries the response was YES. [2023-11-06 23:10:11,907 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1781 conditions, 794 events. 348/794 cut-off events. For 170/170 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 4601 event pairs, 252 based on Foata normal form. 0/516 useless extension candidates. Maximal degree in co-relation 1775. Up to 728 conditions per place. [2023-11-06 23:10:11,914 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 44 selfloop transitions, 5 changer transitions 0/54 dead transitions. [2023-11-06 23:10:11,914 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 54 transitions, 256 flow [2023-11-06 23:10:11,915 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:11,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:11,917 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2023-11-06 23:10:11,918 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41685144124168516 [2023-11-06 23:10:11,918 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 564 transitions. [2023-11-06 23:10:11,919 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 564 transitions. [2023-11-06 23:10:11,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:11,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 564 transitions. [2023-11-06 23:10:11,923 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 188.0) internal successors, (564), 3 states have internal predecessors, (564), 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) [2023-11-06 23:10:11,928 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:11,930 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:11,930 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 120 flow. Second operand 3 states and 564 transitions. [2023-11-06 23:10:11,931 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 54 transitions, 256 flow [2023-11-06 23:10:11,933 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 54 transitions, 246 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:11,936 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 143 flow [2023-11-06 23:10:11,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=143, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-11-06 23:10:11,938 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2023-11-06 23:10:11,939 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 143 flow [2023-11-06 23:10:11,940 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-06 23:10:11,940 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:11,940 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:11,940 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 23:10:11,941 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:11,941 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:11,941 INFO L85 PathProgramCache]: Analyzing trace with hash 690483257, now seen corresponding path program 1 times [2023-11-06 23:10:11,942 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:11,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756103401] [2023-11-06 23:10:11,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:11,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:12,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:12,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:12,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:12,154 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756103401] [2023-11-06 23:10:12,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756103401] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:12,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:12,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:12,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994517384] [2023-11-06 23:10:12,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:12,162 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:12,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:12,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:12,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:12,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 451 [2023-11-06 23:10:12,336 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 143 flow. Second operand has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-06 23:10:12,336 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:12,336 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 451 [2023-11-06 23:10:12,337 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:12,746 INFO L124 PetriNetUnfolderBase]: 304/716 cut-off events. [2023-11-06 23:10:12,746 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-06 23:10:12,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1618 conditions, 716 events. 304/716 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 57. Compared 4289 event pairs, 219 based on Foata normal form. 0/461 useless extension candidates. Maximal degree in co-relation 1611. Up to 628 conditions per place. [2023-11-06 23:10:12,753 INFO L140 encePairwiseOnDemand]: 447/451 looper letters, 41 selfloop transitions, 5 changer transitions 0/53 dead transitions. [2023-11-06 23:10:12,753 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 53 transitions, 258 flow [2023-11-06 23:10:12,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:12,754 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:12,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 559 transitions. [2023-11-06 23:10:12,756 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4131559497413156 [2023-11-06 23:10:12,756 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 559 transitions. [2023-11-06 23:10:12,756 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 559 transitions. [2023-11-06 23:10:12,757 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:12,757 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 559 transitions. [2023-11-06 23:10:12,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 186.33333333333334) internal successors, (559), 3 states have internal predecessors, (559), 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) [2023-11-06 23:10:12,763 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:12,765 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:12,765 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 143 flow. Second operand 3 states and 559 transitions. [2023-11-06 23:10:12,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 53 transitions, 258 flow [2023-11-06 23:10:12,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 53 transitions, 254 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:12,771 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 140 flow [2023-11-06 23:10:12,771 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-11-06 23:10:12,774 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -16 predicate places. [2023-11-06 23:10:12,774 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 140 flow [2023-11-06 23:10:12,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 174.66666666666666) internal successors, (524), 3 states have internal predecessors, (524), 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) [2023-11-06 23:10:12,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:12,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:12,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 23:10:12,775 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:12,776 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:12,776 INFO L85 PathProgramCache]: Analyzing trace with hash 690402290, now seen corresponding path program 1 times [2023-11-06 23:10:12,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:12,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145247715] [2023-11-06 23:10:12,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:12,778 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:12,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:13,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:13,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:13,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145247715] [2023-11-06 23:10:13,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145247715] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:13,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:13,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:13,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169792373] [2023-11-06 23:10:13,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:13,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:13,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:13,454 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:13,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:13,783 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 156 out of 451 [2023-11-06 23:10:13,784 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 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) [2023-11-06 23:10:13,784 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:13,784 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 156 of 451 [2023-11-06 23:10:13,784 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:14,331 INFO L124 PetriNetUnfolderBase]: 345/799 cut-off events. [2023-11-06 23:10:14,331 INFO L125 PetriNetUnfolderBase]: For 210/211 co-relation queries the response was YES. [2023-11-06 23:10:14,332 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1849 conditions, 799 events. 345/799 cut-off events. For 210/211 co-relation queries the response was YES. Maximal size of possible extension queue 65. Compared 4740 event pairs, 145 based on Foata normal form. 0/521 useless extension candidates. Maximal degree in co-relation 1842. Up to 626 conditions per place. [2023-11-06 23:10:14,337 INFO L140 encePairwiseOnDemand]: 442/451 looper letters, 50 selfloop transitions, 14 changer transitions 0/68 dead transitions. [2023-11-06 23:10:14,338 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 68 transitions, 354 flow [2023-11-06 23:10:14,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:14,338 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:10:14,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 839 transitions. [2023-11-06 23:10:14,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3720620842572062 [2023-11-06 23:10:14,342 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 839 transitions. [2023-11-06 23:10:14,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 839 transitions. [2023-11-06 23:10:14,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:14,344 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 839 transitions. [2023-11-06 23:10:14,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 167.8) internal successors, (839), 5 states have internal predecessors, (839), 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) [2023-11-06 23:10:14,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:14,354 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:14,355 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 140 flow. Second operand 5 states and 839 transitions. [2023-11-06 23:10:14,355 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 68 transitions, 354 flow [2023-11-06 23:10:14,357 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 68 transitions, 336 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 23:10:14,360 INFO L231 Difference]: Finished difference. Result has 52 places, 49 transitions, 224 flow [2023-11-06 23:10:14,360 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=130, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=224, PETRI_PLACES=52, PETRI_TRANSITIONS=49} [2023-11-06 23:10:14,363 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -10 predicate places. [2023-11-06 23:10:14,363 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 49 transitions, 224 flow [2023-11-06 23:10:14,364 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 157.25) internal successors, (629), 4 states have internal predecessors, (629), 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) [2023-11-06 23:10:14,364 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:14,364 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 23:10:14,364 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 23:10:14,364 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:14,365 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:14,365 INFO L85 PathProgramCache]: Analyzing trace with hash 690402291, now seen corresponding path program 1 times [2023-11-06 23:10:14,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:14,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [367763308] [2023-11-06 23:10:14,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:14,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:14,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:15,118 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:15,119 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:15,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [367763308] [2023-11-06 23:10:15,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [367763308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:15,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:15,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:15,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498541699] [2023-11-06 23:10:15,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:15,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 23:10:15,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 23:10:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 23:10:15,317 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 157 out of 451 [2023-11-06 23:10:15,318 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 49 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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) [2023-11-06 23:10:15,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:15,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 157 of 451 [2023-11-06 23:10:15,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:15,749 INFO L124 PetriNetUnfolderBase]: 361/816 cut-off events. [2023-11-06 23:10:15,749 INFO L125 PetriNetUnfolderBase]: For 386/398 co-relation queries the response was YES. [2023-11-06 23:10:15,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2160 conditions, 816 events. 361/816 cut-off events. For 386/398 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 4948 event pairs, 139 based on Foata normal form. 28/562 useless extension candidates. Maximal degree in co-relation 2150. Up to 613 conditions per place. [2023-11-06 23:10:15,757 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 55 selfloop transitions, 15 changer transitions 0/77 dead transitions. [2023-11-06 23:10:15,757 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 77 transitions, 456 flow [2023-11-06 23:10:15,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:15,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:10:15,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 849 transitions. [2023-11-06 23:10:15,765 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3764966740576497 [2023-11-06 23:10:15,766 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 849 transitions. [2023-11-06 23:10:15,766 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 849 transitions. [2023-11-06 23:10:15,766 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:15,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 849 transitions. [2023-11-06 23:10:15,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 169.8) internal successors, (849), 5 states have internal predecessors, (849), 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) [2023-11-06 23:10:15,774 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:15,775 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:15,775 INFO L175 Difference]: Start difference. First operand has 52 places, 49 transitions, 224 flow. Second operand 5 states and 849 transitions. [2023-11-06 23:10:15,776 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 77 transitions, 456 flow [2023-11-06 23:10:15,778 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 77 transitions, 456 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 23:10:15,781 INFO L231 Difference]: Finished difference. Result has 59 places, 56 transitions, 329 flow [2023-11-06 23:10:15,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=224, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=329, PETRI_PLACES=59, PETRI_TRANSITIONS=56} [2023-11-06 23:10:15,782 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -3 predicate places. [2023-11-06 23:10:15,782 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 56 transitions, 329 flow [2023-11-06 23:10:15,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 158.25) internal successors, (633), 4 states have internal predecessors, (633), 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) [2023-11-06 23:10:15,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:15,783 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:15,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 23:10:15,783 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:15,784 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:15,784 INFO L85 PathProgramCache]: Analyzing trace with hash -69767709, now seen corresponding path program 1 times [2023-11-06 23:10:15,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:15,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040123094] [2023-11-06 23:10:15,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:15,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:15,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:15,910 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:15,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:15,911 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040123094] [2023-11-06 23:10:15,911 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2040123094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:15,911 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:15,911 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:15,911 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1225727430] [2023-11-06 23:10:15,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:15,912 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:15,912 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:15,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:15,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:15,931 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 173 out of 451 [2023-11-06 23:10:15,932 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 56 transitions, 329 flow. Second operand has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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) [2023-11-06 23:10:15,932 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:15,932 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 173 of 451 [2023-11-06 23:10:15,932 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:16,273 INFO L124 PetriNetUnfolderBase]: 72/228 cut-off events. [2023-11-06 23:10:16,273 INFO L125 PetriNetUnfolderBase]: For 141/145 co-relation queries the response was YES. [2023-11-06 23:10:16,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 639 conditions, 228 events. 72/228 cut-off events. For 141/145 co-relation queries the response was YES. Maximal size of possible extension queue 32. Compared 1174 event pairs, 51 based on Foata normal form. 20/175 useless extension candidates. Maximal degree in co-relation 625. Up to 183 conditions per place. [2023-11-06 23:10:16,276 INFO L140 encePairwiseOnDemand]: 447/451 looper letters, 41 selfloop transitions, 4 changer transitions 2/55 dead transitions. [2023-11-06 23:10:16,277 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 55 transitions, 389 flow [2023-11-06 23:10:16,277 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:16,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:16,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 552 transitions. [2023-11-06 23:10:16,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4079822616407982 [2023-11-06 23:10:16,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 552 transitions. [2023-11-06 23:10:16,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 552 transitions. [2023-11-06 23:10:16,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:16,282 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 552 transitions. [2023-11-06 23:10:16,283 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 184.0) internal successors, (552), 3 states have internal predecessors, (552), 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) [2023-11-06 23:10:16,287 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:16,288 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:16,288 INFO L175 Difference]: Start difference. First operand has 59 places, 56 transitions, 329 flow. Second operand 3 states and 552 transitions. [2023-11-06 23:10:16,289 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 55 transitions, 389 flow [2023-11-06 23:10:16,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 364 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-06 23:10:16,294 INFO L231 Difference]: Finished difference. Result has 56 places, 50 transitions, 256 flow [2023-11-06 23:10:16,294 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=254, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=56, PETRI_TRANSITIONS=50} [2023-11-06 23:10:16,295 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -6 predicate places. [2023-11-06 23:10:16,295 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 50 transitions, 256 flow [2023-11-06 23:10:16,296 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 175.0) internal successors, (525), 3 states have internal predecessors, (525), 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) [2023-11-06 23:10:16,296 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:16,296 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:16,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 23:10:16,297 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:16,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:16,298 INFO L85 PathProgramCache]: Analyzing trace with hash -69855081, now seen corresponding path program 1 times [2023-11-06 23:10:16,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:16,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561706423] [2023-11-06 23:10:16,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:16,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:16,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:16,377 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:16,377 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561706423] [2023-11-06 23:10:16,378 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561706423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:16,378 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:16,378 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 23:10:16,378 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131083204] [2023-11-06 23:10:16,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:16,379 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 23:10:16,379 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:16,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 23:10:16,380 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 23:10:16,531 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 170 out of 451 [2023-11-06 23:10:16,532 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 50 transitions, 256 flow. Second operand has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-06 23:10:16,532 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:16,533 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 170 of 451 [2023-11-06 23:10:16,533 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:16,882 INFO L124 PetriNetUnfolderBase]: 91/259 cut-off events. [2023-11-06 23:10:16,883 INFO L125 PetriNetUnfolderBase]: For 205/206 co-relation queries the response was YES. [2023-11-06 23:10:16,883 INFO L83 FinitePrefix]: Finished finitePrefix Result has 740 conditions, 259 events. 91/259 cut-off events. For 205/206 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1221 event pairs, 67 based on Foata normal form. 0/176 useless extension candidates. Maximal degree in co-relation 728. Up to 239 conditions per place. [2023-11-06 23:10:16,886 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 44 selfloop transitions, 8 changer transitions 0/56 dead transitions. [2023-11-06 23:10:16,886 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 56 transitions, 382 flow [2023-11-06 23:10:16,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 23:10:16,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 23:10:16,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 547 transitions. [2023-11-06 23:10:16,890 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4042867701404287 [2023-11-06 23:10:16,890 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 547 transitions. [2023-11-06 23:10:16,891 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 547 transitions. [2023-11-06 23:10:16,891 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:16,891 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 547 transitions. [2023-11-06 23:10:16,894 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 182.33333333333334) internal successors, (547), 3 states have internal predecessors, (547), 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) [2023-11-06 23:10:16,897 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:16,899 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 451.0) internal successors, (1804), 4 states have internal predecessors, (1804), 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) [2023-11-06 23:10:16,899 INFO L175 Difference]: Start difference. First operand has 56 places, 50 transitions, 256 flow. Second operand 3 states and 547 transitions. [2023-11-06 23:10:16,899 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 56 transitions, 382 flow [2023-11-06 23:10:16,902 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 56 transitions, 378 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:16,904 INFO L231 Difference]: Finished difference. Result has 58 places, 53 transitions, 296 flow [2023-11-06 23:10:16,905 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=296, PETRI_PLACES=58, PETRI_TRANSITIONS=53} [2023-11-06 23:10:16,905 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, -4 predicate places. [2023-11-06 23:10:16,906 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 53 transitions, 296 flow [2023-11-06 23:10:16,906 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 172.0) internal successors, (516), 3 states have internal predecessors, (516), 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) [2023-11-06 23:10:16,906 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:16,907 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:16,907 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 23:10:16,907 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:16,908 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:16,908 INFO L85 PathProgramCache]: Analyzing trace with hash -72360296, now seen corresponding path program 1 times [2023-11-06 23:10:16,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:16,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [607521530] [2023-11-06 23:10:16,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:16,909 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:17,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:18,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:18,145 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:18,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [607521530] [2023-11-06 23:10:18,146 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [607521530] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:18,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:18,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:18,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776340042] [2023-11-06 23:10:18,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:18,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:18,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:18,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:18,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:18,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 154 out of 451 [2023-11-06 23:10:18,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 53 transitions, 296 flow. Second operand has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 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) [2023-11-06 23:10:18,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:18,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 154 of 451 [2023-11-06 23:10:18,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:19,151 INFO L124 PetriNetUnfolderBase]: 88/257 cut-off events. [2023-11-06 23:10:19,151 INFO L125 PetriNetUnfolderBase]: For 300/302 co-relation queries the response was YES. [2023-11-06 23:10:19,152 INFO L83 FinitePrefix]: Finished finitePrefix Result has 777 conditions, 257 events. 88/257 cut-off events. For 300/302 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1211 event pairs, 61 based on Foata normal form. 0/180 useless extension candidates. Maximal degree in co-relation 763. Up to 218 conditions per place. [2023-11-06 23:10:19,154 INFO L140 encePairwiseOnDemand]: 443/451 looper letters, 53 selfloop transitions, 12 changer transitions 0/70 dead transitions. [2023-11-06 23:10:19,154 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 70 transitions, 487 flow [2023-11-06 23:10:19,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:19,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:19,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1132 transitions. [2023-11-06 23:10:19,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3585682610072854 [2023-11-06 23:10:19,161 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1132 transitions. [2023-11-06 23:10:19,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1132 transitions. [2023-11-06 23:10:19,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:19,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1132 transitions. [2023-11-06 23:10:19,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 161.71428571428572) internal successors, (1132), 7 states have internal predecessors, (1132), 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) [2023-11-06 23:10:19,172 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 451.0) internal successors, (3608), 8 states have internal predecessors, (3608), 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) [2023-11-06 23:10:19,174 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 451.0) internal successors, (3608), 8 states have internal predecessors, (3608), 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) [2023-11-06 23:10:19,174 INFO L175 Difference]: Start difference. First operand has 58 places, 53 transitions, 296 flow. Second operand 7 states and 1132 transitions. [2023-11-06 23:10:19,175 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 70 transitions, 487 flow [2023-11-06 23:10:19,197 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 70 transitions, 472 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 23:10:19,202 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 311 flow [2023-11-06 23:10:19,203 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=275, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=311, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-06 23:10:19,204 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 1 predicate places. [2023-11-06 23:10:19,204 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 311 flow [2023-11-06 23:10:19,205 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 155.2) internal successors, (776), 5 states have internal predecessors, (776), 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) [2023-11-06 23:10:19,205 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:19,205 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:19,205 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 23:10:19,205 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:19,206 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:19,206 INFO L85 PathProgramCache]: Analyzing trace with hash -72360295, now seen corresponding path program 1 times [2023-11-06 23:10:19,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:19,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1650533688] [2023-11-06 23:10:19,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:19,207 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:19,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:20,496 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:20,496 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:20,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1650533688] [2023-11-06 23:10:20,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1650533688] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:20,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:20,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:20,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456480749] [2023-11-06 23:10:20,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:20,498 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:20,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:20,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:20,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:20,881 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 155 out of 451 [2023-11-06 23:10:20,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 311 flow. Second operand has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 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) [2023-11-06 23:10:20,883 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:20,883 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 155 of 451 [2023-11-06 23:10:20,883 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:21,461 INFO L124 PetriNetUnfolderBase]: 80/242 cut-off events. [2023-11-06 23:10:21,461 INFO L125 PetriNetUnfolderBase]: For 231/232 co-relation queries the response was YES. [2023-11-06 23:10:21,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 701 conditions, 242 events. 80/242 cut-off events. For 231/232 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1174 event pairs, 20 based on Foata normal form. 0/169 useless extension candidates. Maximal degree in co-relation 687. Up to 115 conditions per place. [2023-11-06 23:10:21,464 INFO L140 encePairwiseOnDemand]: 444/451 looper letters, 56 selfloop transitions, 11 changer transitions 1/77 dead transitions. [2023-11-06 23:10:21,464 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 77 transitions, 513 flow [2023-11-06 23:10:21,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 23:10:21,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 23:10:21,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1142 transitions. [2023-11-06 23:10:21,470 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3617358251504593 [2023-11-06 23:10:21,470 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1142 transitions. [2023-11-06 23:10:21,470 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1142 transitions. [2023-11-06 23:10:21,471 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:21,472 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1142 transitions. [2023-11-06 23:10:21,475 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 163.14285714285714) internal successors, (1142), 7 states have internal predecessors, (1142), 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) [2023-11-06 23:10:21,481 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 451.0) internal successors, (3608), 8 states have internal predecessors, (3608), 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) [2023-11-06 23:10:21,483 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 451.0) internal successors, (3608), 8 states have internal predecessors, (3608), 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) [2023-11-06 23:10:21,483 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 311 flow. Second operand 7 states and 1142 transitions. [2023-11-06 23:10:21,483 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 77 transitions, 513 flow [2023-11-06 23:10:21,486 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 77 transitions, 476 flow, removed 3 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:21,488 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 285 flow [2023-11-06 23:10:21,488 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=263, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=285, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-06 23:10:21,489 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 2 predicate places. [2023-11-06 23:10:21,489 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 285 flow [2023-11-06 23:10:21,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 156.2) internal successors, (781), 5 states have internal predecessors, (781), 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) [2023-11-06 23:10:21,490 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:21,490 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 23:10:21,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-06 23:10:21,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:21,491 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:21,491 INFO L85 PathProgramCache]: Analyzing trace with hash -69854855, now seen corresponding path program 1 times [2023-11-06 23:10:21,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:21,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [828247630] [2023-11-06 23:10:21,492 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:21,492 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:21,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 23:10:22,077 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 23:10:22,077 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 23:10:22,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [828247630] [2023-11-06 23:10:22,078 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [828247630] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 23:10:22,078 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 23:10:22,078 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 23:10:22,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1089343877] [2023-11-06 23:10:22,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 23:10:22,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 23:10:22,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 23:10:22,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 23:10:22,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 23:10:22,593 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 169 out of 451 [2023-11-06 23:10:22,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 285 flow. Second operand has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 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) [2023-11-06 23:10:22,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 23:10:22,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 169 of 451 [2023-11-06 23:10:22,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 23:10:23,052 INFO L124 PetriNetUnfolderBase]: 115/332 cut-off events. [2023-11-06 23:10:23,052 INFO L125 PetriNetUnfolderBase]: For 376/379 co-relation queries the response was YES. [2023-11-06 23:10:23,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 971 conditions, 332 events. 115/332 cut-off events. For 376/379 co-relation queries the response was YES. Maximal size of possible extension queue 34. Compared 1731 event pairs, 70 based on Foata normal form. 0/234 useless extension candidates. Maximal degree in co-relation 957. Up to 168 conditions per place. [2023-11-06 23:10:23,056 INFO L140 encePairwiseOnDemand]: 446/451 looper letters, 67 selfloop transitions, 9 changer transitions 0/81 dead transitions. [2023-11-06 23:10:23,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 81 transitions, 543 flow [2023-11-06 23:10:23,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 23:10:23,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 23:10:23,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 910 transitions. [2023-11-06 23:10:23,062 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4035476718403548 [2023-11-06 23:10:23,062 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 910 transitions. [2023-11-06 23:10:23,062 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 910 transitions. [2023-11-06 23:10:23,063 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 23:10:23,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 910 transitions. [2023-11-06 23:10:23,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 182.0) internal successors, (910), 5 states have internal predecessors, (910), 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) [2023-11-06 23:10:23,071 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:23,073 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 451.0) internal successors, (2706), 6 states have internal predecessors, (2706), 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) [2023-11-06 23:10:23,073 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 285 flow. Second operand 5 states and 910 transitions. [2023-11-06 23:10:23,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 81 transitions, 543 flow [2023-11-06 23:10:23,076 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 81 transitions, 509 flow, removed 4 selfloop flow, removed 5 redundant places. [2023-11-06 23:10:23,078 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 322 flow [2023-11-06 23:10:23,078 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=451, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=322, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-06 23:10:23,079 INFO L281 CegarLoopForPetriNet]: 62 programPoint places, 4 predicate places. [2023-11-06 23:10:23,079 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 322 flow [2023-11-06 23:10:23,080 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 170.2) internal successors, (851), 5 states have internal predecessors, (851), 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) [2023-11-06 23:10:23,080 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 23:10:23,080 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:23,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-06 23:10:23,081 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 49 more)] === [2023-11-06 23:10:23,082 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 23:10:23,082 INFO L85 PathProgramCache]: Analyzing trace with hash 2129466052, now seen corresponding path program 1 times [2023-11-06 23:10:23,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 23:10:23,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581822792] [2023-11-06 23:10:23,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 23:10:23,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 23:10:23,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:23,191 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-06 23:10:23,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-06 23:10:23,288 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-06 23:10:23,288 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-06 23:10:23,289 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 52 remaining) [2023-11-06 23:10:23,291 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 52 remaining) [2023-11-06 23:10:23,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 52 remaining) [2023-11-06 23:10:23,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 52 remaining) [2023-11-06 23:10:23,292 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 52 remaining) [2023-11-06 23:10:23,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 52 remaining) [2023-11-06 23:10:23,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 52 remaining) [2023-11-06 23:10:23,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 52 remaining) [2023-11-06 23:10:23,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 52 remaining) [2023-11-06 23:10:23,293 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 52 remaining) [2023-11-06 23:10:23,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 52 remaining) [2023-11-06 23:10:23,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 52 remaining) [2023-11-06 23:10:23,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 52 remaining) [2023-11-06 23:10:23,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 52 remaining) [2023-11-06 23:10:23,294 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 52 remaining) [2023-11-06 23:10:23,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 52 remaining) [2023-11-06 23:10:23,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 52 remaining) [2023-11-06 23:10:23,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 52 remaining) [2023-11-06 23:10:23,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 52 remaining) [2023-11-06 23:10:23,295 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 52 remaining) [2023-11-06 23:10:23,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 52 remaining) [2023-11-06 23:10:23,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 52 remaining) [2023-11-06 23:10:23,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 52 remaining) [2023-11-06 23:10:23,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 52 remaining) [2023-11-06 23:10:23,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 52 remaining) [2023-11-06 23:10:23,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 52 remaining) [2023-11-06 23:10:23,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 52 remaining) [2023-11-06 23:10:23,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_LEAK (24 of 52 remaining) [2023-11-06 23:10:23,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 52 remaining) [2023-11-06 23:10:23,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 52 remaining) [2023-11-06 23:10:23,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 52 remaining) [2023-11-06 23:10:23,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 52 remaining) [2023-11-06 23:10:23,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 52 remaining) [2023-11-06 23:10:23,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 52 remaining) [2023-11-06 23:10:23,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 52 remaining) [2023-11-06 23:10:23,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 52 remaining) [2023-11-06 23:10:23,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 52 remaining) [2023-11-06 23:10:23,299 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 52 remaining) [2023-11-06 23:10:23,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 52 remaining) [2023-11-06 23:10:23,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 52 remaining) [2023-11-06 23:10:23,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 52 remaining) [2023-11-06 23:10:23,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 52 remaining) [2023-11-06 23:10:23,300 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 52 remaining) [2023-11-06 23:10:23,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 52 remaining) [2023-11-06 23:10:23,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 52 remaining) [2023-11-06 23:10:23,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 52 remaining) [2023-11-06 23:10:23,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 52 remaining) [2023-11-06 23:10:23,301 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 52 remaining) [2023-11-06 23:10:23,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 52 remaining) [2023-11-06 23:10:23,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 52 remaining) [2023-11-06 23:10:23,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 52 remaining) [2023-11-06 23:10:23,302 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 52 remaining) [2023-11-06 23:10:23,302 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-06 23:10:23,303 INFO L445 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 23:10:23,310 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-06 23:10:23,311 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-06 23:10:23,349 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 06.11 11:10:23 BasicIcfg [2023-11-06 23:10:23,349 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-06 23:10:23,350 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-06 23:10:23,350 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-06 23:10:23,350 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-06 23:10:23,350 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 11:07:39" (3/4) ... [2023-11-06 23:10:23,351 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2023-11-06 23:10:23,399 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/witness.graphml.graphml [2023-11-06 23:10:23,399 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-06 23:10:23,400 INFO L158 Benchmark]: Toolchain (without parser) took 165585.14ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 111.8MB in the beginning and 134.5MB in the end (delta: -22.7MB). Peak memory consumption was 86.9MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,400 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 117.4MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 23:10:23,400 INFO L158 Benchmark]: CACSL2BoogieTranslator took 967.43ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 73.1MB in the end (delta: 38.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,401 INFO L158 Benchmark]: Boogie Procedure Inliner took 103.99ms. Allocated memory is still 146.8MB. Free memory was 73.1MB in the beginning and 70.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,401 INFO L158 Benchmark]: Boogie Preprocessor took 66.17ms. Allocated memory is still 146.8MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,402 INFO L158 Benchmark]: RCFGBuilder took 856.79ms. Allocated memory is still 146.8MB. Free memory was 68.1MB in the beginning and 99.1MB in the end (delta: -31.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,402 INFO L158 Benchmark]: TraceAbstraction took 163534.02ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 98.3MB in the beginning and 137.7MB in the end (delta: -39.4MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,402 INFO L158 Benchmark]: Witness Printer took 49.44ms. Allocated memory is still 255.9MB. Free memory was 137.7MB in the beginning and 134.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-06 23:10:23,404 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.20ms. Allocated memory is still 117.4MB. Free memory is still 92.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 967.43ms. Allocated memory is still 146.8MB. Free memory was 111.4MB in the beginning and 73.1MB in the end (delta: 38.3MB). Peak memory consumption was 39.8MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 103.99ms. Allocated memory is still 146.8MB. Free memory was 73.1MB in the beginning and 70.2MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.17ms. Allocated memory is still 146.8MB. Free memory was 70.2MB in the beginning and 68.1MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 856.79ms. Allocated memory is still 146.8MB. Free memory was 68.1MB in the beginning and 99.1MB in the end (delta: -31.0MB). Peak memory consumption was 8.1MB. Max. memory is 16.1GB. * TraceAbstraction took 163534.02ms. Allocated memory was 146.8MB in the beginning and 255.9MB in the end (delta: 109.1MB). Free memory was 98.3MB in the beginning and 137.7MB in the end (delta: -39.4MB). Peak memory consumption was 70.4MB. Max. memory is 16.1GB. * Witness Printer took 49.44ms. Allocated memory is still 255.9MB. Free memory was 137.7MB in the beginning and 134.5MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks Lipton Reduction Statistics: ReductionTime: 147.9s, 182 PlacesBefore, 62 PlacesAfterwards, 180 TransitionsBefore, 58 TransitionsAfterwards, 3192 CoEnabledTransitionPairs, 11 FixpointIterations, 184 TrivialSequentialCompositions, 75 ConcurrentSequentialCompositions, 4 TrivialYvCompositions, 5 ConcurrentYvCompositions, 2 ChoiceCompositions, 270 TotalNumberOfCompositions, 15539 MoverChecksTotal, Independence Relation Statistics: CachedIndependenceRelation.Independence Queries: [ total: 7110, independent: 6424, independent conditional: 0, independent unconditional: 6424, dependent: 686, dependent conditional: 0, dependent unconditional: 686, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , CachedIndependenceRelation.Statistics on underlying relation: SyntacticIndependenceRelation.Independence Queries: [ total: 1803, independent: 1735, independent conditional: 0, independent unconditional: 1735, dependent: 68, dependent conditional: 0, dependent unconditional: 68, unknown: 0, unknown conditional: 0, unknown unconditional: 0] , Cache Queries: [ total: 7110, independent: 4689, independent conditional: 0, independent unconditional: 4689, dependent: 618, dependent conditional: 0, dependent unconditional: 618, unknown: 1803, unknown conditional: 0, unknown unconditional: 1803] , Statistics on independence cache: Total cache size (in pairs): 256, Positive cache size: 215, Positive conditional cache size: 0, Positive unconditional cache size: 215, Negative cache size: 41, Negative conditional cache size: 0, Negative unconditional cache size: 41, Unknown cache size: 0, Unknown conditional cache size: 0, Unknown unconditional cache size: 0 - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex = { { 0, 0, 0, 0, 0, { { 0, 0 } } } }; [L1244] 0 struct s *slot[10]; [L1254] 0 int j = __VERIFIER_nondet_int(); [L1255] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1255] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1256] 0 pthread_t t1; [L1257] 0 struct s *p; [L1258] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1258] RET, EXPR 0 new(1) [L1258] 0 slot[j] = new(1) [L1259] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1259] RET, EXPR 0 new(2) [L1259] EXPR 0 slot[j] [L1259] CALL 0 list_add(new(2), slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node [L1241] 0 node->next = temp [L1259] RET 0 list_add(new(2), slot[j]) [L1260] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=8, mutex={1:0}, pthread_create(&t1, ((void *)0), t_fun, ((void *)0))=0, slot={2:0}, t1={13:0}] [L1246] 1 int i = __VERIFIER_nondet_int(); [L1247] CALL 1 assume_abort_if_not(0 <= i && i < 10) [L11] COND FALSE 1 !(!cond) [L1247] RET 1 assume_abort_if_not(0 <= i && i < 10) [L1249] CALL, EXPR 1 new(3) [L1233] 1 struct s *p = malloc(sizeof(struct s)); [L1234] 1 p->datum = x VAL [\old(x)=3, \result={5:0}, mutex={1:0}, p={11:0}, slot={2:0}, x=3] [L1235] 1 p->next = ((void *)0) [L1236] 1 return p; [L1249] RET, EXPR 1 new(3) [L1249] EXPR 1 slot[i] [L1249] CALL 1 list_add(new(3), slot[i]) [L1239] 1 list->next - 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: -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: 1253]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 1260]: 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: -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. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 3 procedures, 238 locations, 52 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: 163.3s, OverallIterations: 13, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 8.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 148.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2182 SdHoareTripleChecker+Valid, 6.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1083 mSDsluCounter, 448 SdHoareTripleChecker+Invalid, 5.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 94 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3295 IncrementalHoareTripleChecker+Invalid, 3389 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 94 mSolverCounterUnsat, 365 mSDtfsCounter, 3295 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 33 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=329occurred in iteration=7, InterpolantAutomatonStates: 49, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 66 NumberOfCodeBlocks, 66 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 47 ConstructedInterpolants, 0 QuantifiedInterpolants, 628 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 12 InterpolantComputations, 12 PerfectInterpolantSequences, 0/0 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 proved your program to be incorrect! [2023-11-06 23:10:23,437 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cd7ffb63-3f91-4bdf-b294-12823a9d283b/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)