./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version d790fecc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 --- Real Ultimate output --- This is Ultimate 0.3.0-dev-d790fec [2024-11-28 03:34:03,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-28 03:34:03,798 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-28 03:34:03,808 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-28 03:34:03,808 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-28 03:34:03,856 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-28 03:34:03,860 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-28 03:34:03,860 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-28 03:34:03,861 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-28 03:34:03,861 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-28 03:34:03,861 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-28 03:34:03,861 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-28 03:34:03,861 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-28 03:34:03,861 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-28 03:34:03,863 INFO L153 SettingsManager]: * Use SBE=true [2024-11-28 03:34:03,863 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-28 03:34:03,863 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-28 03:34:03,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-28 03:34:03,864 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-28 03:34:03,864 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-28 03:34:03,864 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-28 03:34:03,865 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-28 03:34:03,866 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:03,866 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:03,867 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-28 03:34:03,867 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-28 03:34:03,867 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-28 03:34:03,867 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-28 03:34:03,867 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:03,867 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-28 03:34:03,868 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-28 03:34:03,869 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 573c853979782f78b60122afde2824ab47c3f9d6394b4ee74285d458320f7321 [2024-11-28 03:34:04,159 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-28 03:34:04,167 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-28 03:34:04,169 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-28 03:34:04,171 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-28 03:34:04,171 INFO L274 PluginConnector]: CDTParser initialized [2024-11-28 03:34:04,172 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/../../sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-11-28 03:34:07,202 INFO L533 CDTParser]: Created temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/data/8ab7c107c/6b9ca63535244a5cbe8a72c0b7393706/FLAG19847de7f [2024-11-28 03:34:07,613 INFO L384 CDTParser]: Found 1 translation units. [2024-11-28 03:34:07,618 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/sv-benchmarks/c/goblint-regression/09-regions_12-arraycollapse_rc-deref.i [2024-11-28 03:34:07,641 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/data/8ab7c107c/6b9ca63535244a5cbe8a72c0b7393706/FLAG19847de7f [2024-11-28 03:34:07,657 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/data/8ab7c107c/6b9ca63535244a5cbe8a72c0b7393706 [2024-11-28 03:34:07,659 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-28 03:34:07,661 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-28 03:34:07,662 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:07,662 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-28 03:34:07,667 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-28 03:34:07,668 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:07" (1/1) ... [2024-11-28 03:34:07,669 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@222ed6c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:07, skipping insertion in model container [2024-11-28 03:34:07,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:34:07" (1/1) ... [2024-11-28 03:34:07,723 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-28 03:34:08,476 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:08,511 INFO L200 MainTranslator]: Completed pre-run [2024-11-28 03:34:08,614 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-28 03:34:08,719 INFO L204 MainTranslator]: Completed translation [2024-11-28 03:34:08,720 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08 WrapperNode [2024-11-28 03:34:08,721 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-28 03:34:08,722 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:08,722 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-28 03:34:08,723 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-28 03:34:08,729 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,748 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,782 INFO L138 Inliner]: procedures = 372, calls = 99, calls flagged for inlining = 16, calls inlined = 16, statements flattened = 248 [2024-11-28 03:34:08,782 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-28 03:34:08,783 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-28 03:34:08,783 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-28 03:34:08,783 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-28 03:34:08,793 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,793 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,799 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,842 INFO L175 MemorySlicer]: Split 97 memory accesses to 3 slices as follows [50, 18, 29]. 52 percent of accesses are in the largest equivalence class. The 60 initializations are split as follows [50, 10, 0]. The 24 writes are split as follows [0, 2, 22]. [2024-11-28 03:34:08,846 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,846 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,871 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,876 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,878 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,881 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,882 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,886 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-28 03:34:08,887 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-28 03:34:08,887 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-28 03:34:08,887 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-28 03:34:08,888 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (1/1) ... [2024-11-28 03:34:08,895 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-28 03:34:08,916 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:08,928 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-28 03:34:08,930 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-28 03:34:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-28 03:34:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-28 03:34:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-28 03:34:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-28 03:34:08,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-28 03:34:08,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-28 03:34:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure t_fun [2024-11-28 03:34:08,954 INFO L138 BoogieDeclarations]: Found implementation of procedure t_fun [2024-11-28 03:34:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-28 03:34:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-28 03:34:08,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-28 03:34:08,955 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-28 03:34:08,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-28 03:34:08,956 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-28 03:34:09,137 INFO L234 CfgBuilder]: Building ICFG [2024-11-28 03:34:09,140 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-28 03:34:09,997 INFO L279 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-28 03:34:09,997 INFO L283 CfgBuilder]: Performing block encoding [2024-11-28 03:34:10,538 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-28 03:34:10,540 INFO L312 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-28 03:34:10,540 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:10 BoogieIcfgContainer [2024-11-28 03:34:10,541 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-28 03:34:10,542 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-28 03:34:10,543 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-28 03:34:10,547 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-28 03:34:10,547 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:34:07" (1/3) ... [2024-11-28 03:34:10,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55293c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:10, skipping insertion in model container [2024-11-28 03:34:10,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:34:08" (2/3) ... [2024-11-28 03:34:10,548 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55293c4c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:34:10, skipping insertion in model container [2024-11-28 03:34:10,548 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:10" (3/3) ... [2024-11-28 03:34:10,549 INFO L128 eAbstractionObserver]: Analyzing ICFG 09-regions_12-arraycollapse_rc-deref.i [2024-11-28 03:34:10,567 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-28 03:34:10,570 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG 09-regions_12-arraycollapse_rc-deref.i that has 2 procedures, 128 locations, 1 initial locations, 1 loop locations, and 75 error locations. [2024-11-28 03:34:10,571 INFO L491 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-28 03:34:10,679 INFO L143 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2024-11-28 03:34:10,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 131 places, 128 transitions, 260 flow [2024-11-28 03:34:10,820 INFO L124 PetriNetUnfolderBase]: 1/127 cut-off events. [2024-11-28 03:34:10,823 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:34:10,828 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131 conditions, 127 events. 1/127 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 248 event pairs, 0 based on Foata normal form. 0/51 useless extension candidates. Maximal degree in co-relation 87. Up to 2 conditions per place. [2024-11-28 03:34:10,828 INFO L82 GeneralOperation]: Start removeDead. Operand has 131 places, 128 transitions, 260 flow [2024-11-28 03:34:10,835 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 130 places, 127 transitions, 257 flow [2024-11-28 03:34:10,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-28 03:34:10,870 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@41f93848, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-28 03:34:10,872 INFO L334 AbstractCegarLoop]: Starting to check reachability of 88 error locations. [2024-11-28 03:34:10,882 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-28 03:34:10,882 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2024-11-28 03:34:10,882 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:34:10,882 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:10,883 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2024-11-28 03:34:10,883 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:10,890 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:10,890 INFO L85 PathProgramCache]: Analyzing trace with hash 727841, now seen corresponding path program 1 times [2024-11-28 03:34:10,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:10,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888628670] [2024-11-28 03:34:10,900 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:10,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:11,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:11,255 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:11,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:11,256 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888628670] [2024-11-28 03:34:11,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888628670] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:11,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:11,257 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:34:11,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397204002] [2024-11-28 03:34:11,262 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:11,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:34:11,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:11,305 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:34:11,306 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:34:11,309 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-28 03:34:11,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 127 transitions, 257 flow. Second operand has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:11,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:11,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-28 03:34:11,315 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:11,567 INFO L124 PetriNetUnfolderBase]: 64/324 cut-off events. [2024-11-28 03:34:11,567 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:34:11,568 INFO L83 FinitePrefix]: Finished finitePrefix Result has 495 conditions, 324 events. 64/324 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1331 event pairs, 63 based on Foata normal form. 0/237 useless extension candidates. Maximal degree in co-relation 377. Up to 166 conditions per place. [2024-11-28 03:34:11,571 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 2 changer transitions 0/128 dead transitions. [2024-11-28 03:34:11,572 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 132 places, 128 transitions, 339 flow [2024-11-28 03:34:11,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:34:11,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:34:11,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 308 transitions. [2024-11-28 03:34:11,586 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8020833333333334 [2024-11-28 03:34:11,588 INFO L175 Difference]: Start difference. First operand has 130 places, 127 transitions, 257 flow. Second operand 3 states and 308 transitions. [2024-11-28 03:34:11,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 132 places, 128 transitions, 339 flow [2024-11-28 03:34:11,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 131 places, 128 transitions, 338 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-28 03:34:11,601 INFO L231 Difference]: Finished difference. Result has 132 places, 128 transitions, 268 flow [2024-11-28 03:34:11,604 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=268, PETRI_PLACES=132, PETRI_TRANSITIONS=128} [2024-11-28 03:34:11,607 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-11-28 03:34:11,607 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 128 transitions, 268 flow [2024-11-28 03:34:11,608 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.66666666666667) internal successors, (269), 3 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:11,608 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:11,608 INFO L206 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1] [2024-11-28 03:34:11,608 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-28 03:34:11,608 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:11,609 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:11,609 INFO L85 PathProgramCache]: Analyzing trace with hash 22561761, now seen corresponding path program 1 times [2024-11-28 03:34:11,609 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:11,609 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326787309] [2024-11-28 03:34:11,609 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:11,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:11,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:11,765 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:11,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326787309] [2024-11-28 03:34:11,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326787309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:11,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791634081] [2024-11-28 03:34:11,766 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:11,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:11,766 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:11,773 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:11,774 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-28 03:34:11,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:11,944 INFO L256 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-28 03:34:11,948 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:11,991 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:11,991 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:12,014 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:12,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791634081] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:12,014 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:12,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 6 [2024-11-28 03:34:12,015 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [951073620] [2024-11-28 03:34:12,015 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:12,016 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:12,016 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:12,016 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:12,016 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:12,022 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-28 03:34:12,025 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 128 transitions, 268 flow. Second operand has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:12,025 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:12,025 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-28 03:34:12,025 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:12,348 INFO L124 PetriNetUnfolderBase]: 64/327 cut-off events. [2024-11-28 03:34:12,349 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-28 03:34:12,350 INFO L83 FinitePrefix]: Finished finitePrefix Result has 510 conditions, 327 events. 64/327 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1314 event pairs, 63 based on Foata normal form. 0/240 useless extension candidates. Maximal degree in co-relation 499. Up to 166 conditions per place. [2024-11-28 03:34:12,352 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 5 changer transitions 0/131 dead transitions. [2024-11-28 03:34:12,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 131 transitions, 366 flow [2024-11-28 03:34:12,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:34:12,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:34:12,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 580 transitions. [2024-11-28 03:34:12,357 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7552083333333334 [2024-11-28 03:34:12,357 INFO L175 Difference]: Start difference. First operand has 132 places, 128 transitions, 268 flow. Second operand 6 states and 580 transitions. [2024-11-28 03:34:12,357 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 131 transitions, 366 flow [2024-11-28 03:34:12,359 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 131 transitions, 362 flow, removed 1 selfloop flow, removed 1 redundant places. [2024-11-28 03:34:12,362 INFO L231 Difference]: Finished difference. Result has 139 places, 131 transitions, 300 flow [2024-11-28 03:34:12,362 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=300, PETRI_PLACES=139, PETRI_TRANSITIONS=131} [2024-11-28 03:34:12,363 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 9 predicate places. [2024-11-28 03:34:12,363 INFO L471 AbstractCegarLoop]: Abstraction has has 139 places, 131 transitions, 300 flow [2024-11-28 03:34:12,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 90.14285714285714) internal successors, (631), 7 states have internal predecessors, (631), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:12,364 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:12,364 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-28 03:34:12,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-28 03:34:12,567 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:12,568 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:12,568 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:12,568 INFO L85 PathProgramCache]: Analyzing trace with hash 2121222945, now seen corresponding path program 2 times [2024-11-28 03:34:12,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:12,568 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1286832012] [2024-11-28 03:34:12,568 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:34:12,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:12,610 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:34:12,610 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:34:12,770 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-28 03:34:12,770 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:12,770 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1286832012] [2024-11-28 03:34:12,770 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1286832012] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:12,770 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:12,770 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:34:12,771 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [298401955] [2024-11-28 03:34:12,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:12,771 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:34:12,771 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:12,772 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:34:12,772 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:34:12,941 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-11-28 03:34:12,942 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 139 places, 131 transitions, 300 flow. Second operand has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:12,942 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:12,942 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-11-28 03:34:12,942 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:13,168 INFO L124 PetriNetUnfolderBase]: 64/317 cut-off events. [2024-11-28 03:34:13,168 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-28 03:34:13,169 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 317 events. 64/317 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1270 event pairs, 63 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 485. Up to 165 conditions per place. [2024-11-28 03:34:13,171 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 38 selfloop transitions, 10 changer transitions 0/121 dead transitions. [2024-11-28 03:34:13,171 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 131 places, 121 transitions, 376 flow [2024-11-28 03:34:13,172 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:34:13,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:34:13,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 276 transitions. [2024-11-28 03:34:13,173 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.71875 [2024-11-28 03:34:13,174 INFO L175 Difference]: Start difference. First operand has 139 places, 131 transitions, 300 flow. Second operand 3 states and 276 transitions. [2024-11-28 03:34:13,174 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 131 places, 121 transitions, 376 flow [2024-11-28 03:34:13,175 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 121 transitions, 362 flow, removed 6 selfloop flow, removed 1 redundant places. [2024-11-28 03:34:13,178 INFO L231 Difference]: Finished difference. Result has 130 places, 121 transitions, 286 flow [2024-11-28 03:34:13,178 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=111, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=286, PETRI_PLACES=130, PETRI_TRANSITIONS=121} [2024-11-28 03:34:13,179 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 0 predicate places. [2024-11-28 03:34:13,179 INFO L471 AbstractCegarLoop]: Abstraction has has 130 places, 121 transitions, 286 flow [2024-11-28 03:34:13,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 75.33333333333333) internal successors, (226), 3 states have internal predecessors, (226), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:13,180 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:13,180 INFO L206 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1] [2024-11-28 03:34:13,180 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-28 03:34:13,180 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:13,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:13,181 INFO L85 PathProgramCache]: Analyzing trace with hash 2121222946, now seen corresponding path program 1 times [2024-11-28 03:34:13,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:13,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1301008477] [2024-11-28 03:34:13,181 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:13,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:13,207 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:13,424 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:13,424 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:13,424 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1301008477] [2024-11-28 03:34:13,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1301008477] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:13,425 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [567406178] [2024-11-28 03:34:13,425 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:13,425 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:13,425 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:13,428 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:13,434 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-28 03:34:13,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:13,564 INFO L256 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-28 03:34:13,565 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:13,595 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:13,595 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:13,717 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-28 03:34:13,718 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [567406178] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:13,718 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:13,718 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2024-11-28 03:34:13,718 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605807454] [2024-11-28 03:34:13,718 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:13,718 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-28 03:34:13,719 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:13,719 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-28 03:34:13,719 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2024-11-28 03:34:13,724 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 89 out of 128 [2024-11-28 03:34:13,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 130 places, 121 transitions, 286 flow. Second operand has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:13,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:13,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 89 of 128 [2024-11-28 03:34:13,728 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:13,937 INFO L124 PetriNetUnfolderBase]: 64/323 cut-off events. [2024-11-28 03:34:13,937 INFO L125 PetriNetUnfolderBase]: For 54/54 co-relation queries the response was YES. [2024-11-28 03:34:13,939 INFO L83 FinitePrefix]: Finished finitePrefix Result has 541 conditions, 323 events. 64/323 cut-off events. For 54/54 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1263 event pairs, 63 based on Foata normal form. 6/253 useless extension candidates. Maximal degree in co-relation 490. Up to 166 conditions per place. [2024-11-28 03:34:13,943 INFO L140 encePairwiseOnDemand]: 125/128 looper letters, 38 selfloop transitions, 11 changer transitions 0/127 dead transitions. [2024-11-28 03:34:13,943 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 127 transitions, 420 flow [2024-11-28 03:34:13,944 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-28 03:34:13,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2024-11-28 03:34:13,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 1123 transitions. [2024-11-28 03:34:13,946 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7311197916666666 [2024-11-28 03:34:13,947 INFO L175 Difference]: Start difference. First operand has 130 places, 121 transitions, 286 flow. Second operand 12 states and 1123 transitions. [2024-11-28 03:34:13,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 127 transitions, 420 flow [2024-11-28 03:34:13,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 127 transitions, 400 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:34:13,955 INFO L231 Difference]: Finished difference. Result has 145 places, 127 transitions, 350 flow [2024-11-28 03:34:13,955 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=128, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=115, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=350, PETRI_PLACES=145, PETRI_TRANSITIONS=127} [2024-11-28 03:34:13,959 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 15 predicate places. [2024-11-28 03:34:13,959 INFO L471 AbstractCegarLoop]: Abstraction has has 145 places, 127 transitions, 350 flow [2024-11-28 03:34:13,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 90.07692307692308) internal successors, (1171), 13 states have internal predecessors, (1171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:13,960 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:13,961 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1] [2024-11-28 03:34:13,972 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-28 03:34:14,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:14,162 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:14,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:14,162 INFO L85 PathProgramCache]: Analyzing trace with hash -297233630, now seen corresponding path program 2 times [2024-11-28 03:34:14,163 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:14,163 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [662731638] [2024-11-28 03:34:14,163 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-28 03:34:14,163 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:14,199 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2024-11-28 03:34:14,199 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-28 03:34:14,310 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:14,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:14,313 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [662731638] [2024-11-28 03:34:14,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [662731638] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:14,313 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:14,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:34:14,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213412890] [2024-11-28 03:34:14,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:14,313 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:34:14,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:14,314 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:34:14,314 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:34:14,492 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 79 out of 128 [2024-11-28 03:34:14,493 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 145 places, 127 transitions, 350 flow. Second operand has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:14,493 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:14,493 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 79 of 128 [2024-11-28 03:34:14,493 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:14,678 INFO L124 PetriNetUnfolderBase]: 64/313 cut-off events. [2024-11-28 03:34:14,678 INFO L125 PetriNetUnfolderBase]: For 31/31 co-relation queries the response was YES. [2024-11-28 03:34:14,680 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 313 events. 64/313 cut-off events. For 31/31 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1243 event pairs, 63 based on Foata normal form. 5/247 useless extension candidates. Maximal degree in co-relation 476. Up to 171 conditions per place. [2024-11-28 03:34:14,683 INFO L140 encePairwiseOnDemand]: 108/128 looper letters, 39 selfloop transitions, 10 changer transitions 0/117 dead transitions. [2024-11-28 03:34:14,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 137 places, 117 transitions, 428 flow [2024-11-28 03:34:14,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:34:14,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:34:14,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 286 transitions. [2024-11-28 03:34:14,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7447916666666666 [2024-11-28 03:34:14,686 INFO L175 Difference]: Start difference. First operand has 145 places, 127 transitions, 350 flow. Second operand 3 states and 286 transitions. [2024-11-28 03:34:14,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 137 places, 117 transitions, 428 flow [2024-11-28 03:34:14,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 132 places, 117 transitions, 380 flow, removed 19 selfloop flow, removed 5 redundant places. [2024-11-28 03:34:14,692 INFO L231 Difference]: Finished difference. Result has 132 places, 117 transitions, 302 flow [2024-11-28 03:34:14,692 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=130, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=107, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=302, PETRI_PLACES=132, PETRI_TRANSITIONS=117} [2024-11-28 03:34:14,693 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 2 predicate places. [2024-11-28 03:34:14,693 INFO L471 AbstractCegarLoop]: Abstraction has has 132 places, 117 transitions, 302 flow [2024-11-28 03:34:14,693 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.33333333333333) internal successors, (241), 3 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:14,693 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:14,693 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1] [2024-11-28 03:34:14,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-28 03:34:14,693 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:14,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:14,694 INFO L85 PathProgramCache]: Analyzing trace with hash 2121312960, now seen corresponding path program 1 times [2024-11-28 03:34:14,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:14,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218728170] [2024-11-28 03:34:14,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:14,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:14,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:15,096 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:15,097 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:15,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218728170] [2024-11-28 03:34:15,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218728170] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:15,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:15,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-28 03:34:15,097 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [402649612] [2024-11-28 03:34:15,097 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:15,098 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:15,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:15,100 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:15,100 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:15,687 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 76 out of 128 [2024-11-28 03:34:15,688 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 132 places, 117 transitions, 302 flow. Second operand has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:15,688 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:15,688 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 76 of 128 [2024-11-28 03:34:15,688 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:16,018 INFO L124 PetriNetUnfolderBase]: 73/321 cut-off events. [2024-11-28 03:34:16,018 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-28 03:34:16,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 564 conditions, 321 events. 73/321 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1307 event pairs, 63 based on Foata normal form. 2/262 useless extension candidates. Maximal degree in co-relation 513. Up to 158 conditions per place. [2024-11-28 03:34:16,021 INFO L140 encePairwiseOnDemand]: 104/128 looper letters, 44 selfloop transitions, 12 changer transitions 3/114 dead transitions. [2024-11-28 03:34:16,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 114 transitions, 414 flow [2024-11-28 03:34:16,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:16,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:34:16,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 442 transitions. [2024-11-28 03:34:16,026 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.690625 [2024-11-28 03:34:16,027 INFO L175 Difference]: Start difference. First operand has 132 places, 117 transitions, 302 flow. Second operand 5 states and 442 transitions. [2024-11-28 03:34:16,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 114 transitions, 414 flow [2024-11-28 03:34:16,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 114 transitions, 394 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:34:16,035 INFO L231 Difference]: Finished difference. Result has 122 places, 105 transitions, 282 flow [2024-11-28 03:34:16,035 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=282, PETRI_PLACES=122, PETRI_TRANSITIONS=105} [2024-11-28 03:34:16,036 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -8 predicate places. [2024-11-28 03:34:16,036 INFO L471 AbstractCegarLoop]: Abstraction has has 122 places, 105 transitions, 282 flow [2024-11-28 03:34:16,036 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.0) internal successors, (385), 5 states have internal predecessors, (385), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:16,036 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:16,036 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:16,036 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-28 03:34:16,039 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:16,039 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:16,042 INFO L85 PathProgramCache]: Analyzing trace with hash 770909431, now seen corresponding path program 1 times [2024-11-28 03:34:16,042 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:16,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616495972] [2024-11-28 03:34:16,042 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:16,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:16,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:16,567 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:16,568 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:16,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616495972] [2024-11-28 03:34:16,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616495972] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:16,569 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:16,569 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:34:16,569 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840912235] [2024-11-28 03:34:16,569 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:16,569 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:16,570 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:16,570 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:16,570 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:17,293 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-11-28 03:34:17,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 105 transitions, 282 flow. Second operand has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:17,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:17,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-11-28 03:34:17,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:17,617 INFO L124 PetriNetUnfolderBase]: 64/289 cut-off events. [2024-11-28 03:34:17,618 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:34:17,618 INFO L83 FinitePrefix]: Finished finitePrefix Result has 536 conditions, 289 events. 64/289 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1113 event pairs, 63 based on Foata normal form. 0/243 useless extension candidates. Maximal degree in co-relation 484. Up to 166 conditions per place. [2024-11-28 03:34:17,620 INFO L140 encePairwiseOnDemand]: 107/128 looper letters, 45 selfloop transitions, 16 changer transitions 0/100 dead transitions. [2024-11-28 03:34:17,620 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 100 transitions, 394 flow [2024-11-28 03:34:17,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:34:17,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:34:17,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 552 transitions. [2024-11-28 03:34:17,623 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5390625 [2024-11-28 03:34:17,623 INFO L175 Difference]: Start difference. First operand has 122 places, 105 transitions, 282 flow. Second operand 8 states and 552 transitions. [2024-11-28 03:34:17,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 100 transitions, 394 flow [2024-11-28 03:34:17,627 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 100 transitions, 370 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:34:17,628 INFO L231 Difference]: Finished difference. Result has 120 places, 100 transitions, 280 flow [2024-11-28 03:34:17,631 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=113, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=280, PETRI_PLACES=120, PETRI_TRANSITIONS=100} [2024-11-28 03:34:17,632 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -10 predicate places. [2024-11-28 03:34:17,632 INFO L471 AbstractCegarLoop]: Abstraction has has 120 places, 100 transitions, 280 flow [2024-11-28 03:34:17,633 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 63.42857142857143) internal successors, (444), 7 states have internal predecessors, (444), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:17,633 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:17,634 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:17,634 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-28 03:34:17,635 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:17,635 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:17,635 INFO L85 PathProgramCache]: Analyzing trace with hash 770909432, now seen corresponding path program 1 times [2024-11-28 03:34:17,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:17,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930924457] [2024-11-28 03:34:17,639 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:17,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:17,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:18,300 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:18,300 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:18,300 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930924457] [2024-11-28 03:34:18,300 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930924457] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:18,300 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:18,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:34:18,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [201288169] [2024-11-28 03:34:18,301 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:18,301 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:18,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:18,301 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:18,301 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:19,302 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2024-11-28 03:34:19,303 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 100 transitions, 280 flow. Second operand has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:19,303 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:19,304 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2024-11-28 03:34:19,304 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:19,680 INFO L124 PetriNetUnfolderBase]: 64/287 cut-off events. [2024-11-28 03:34:19,680 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-28 03:34:19,681 INFO L83 FinitePrefix]: Finished finitePrefix Result has 528 conditions, 287 events. 64/287 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1132 event pairs, 63 based on Foata normal form. 1/245 useless extension candidates. Maximal degree in co-relation 477. Up to 172 conditions per place. [2024-11-28 03:34:19,683 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 49 selfloop transitions, 11 changer transitions 0/98 dead transitions. [2024-11-28 03:34:19,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 98 transitions, 396 flow [2024-11-28 03:34:19,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:34:19,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:34:19,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 444 transitions. [2024-11-28 03:34:19,686 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.4955357142857143 [2024-11-28 03:34:19,686 INFO L175 Difference]: Start difference. First operand has 120 places, 100 transitions, 280 flow. Second operand 7 states and 444 transitions. [2024-11-28 03:34:19,686 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 98 transitions, 396 flow [2024-11-28 03:34:19,688 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 98 transitions, 364 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 03:34:19,691 INFO L231 Difference]: Finished difference. Result has 117 places, 98 transitions, 266 flow [2024-11-28 03:34:19,691 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=87, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=266, PETRI_PLACES=117, PETRI_TRANSITIONS=98} [2024-11-28 03:34:19,693 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -13 predicate places. [2024-11-28 03:34:19,693 INFO L471 AbstractCegarLoop]: Abstraction has has 117 places, 98 transitions, 266 flow [2024-11-28 03:34:19,694 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 57.42857142857143) internal successors, (402), 7 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:19,695 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:19,695 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:19,695 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-28 03:34:19,696 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:19,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:19,696 INFO L85 PathProgramCache]: Analyzing trace with hash 2109613251, now seen corresponding path program 1 times [2024-11-28 03:34:19,696 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:19,696 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [102478345] [2024-11-28 03:34:19,696 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:19,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:20,059 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [102478345] [2024-11-28 03:34:20,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [102478345] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:20,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:20,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:20,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260310010] [2024-11-28 03:34:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:20,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:20,061 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:20,061 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:20,378 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-28 03:34:20,379 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 117 places, 98 transitions, 266 flow. Second operand has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:20,379 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:20,379 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-28 03:34:20,380 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:20,606 INFO L124 PetriNetUnfolderBase]: 64/286 cut-off events. [2024-11-28 03:34:20,606 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-28 03:34:20,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 514 conditions, 286 events. 64/286 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1121 event pairs, 63 based on Foata normal form. 1/240 useless extension candidates. Maximal degree in co-relation 463. Up to 171 conditions per place. [2024-11-28 03:34:20,609 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 41 selfloop transitions, 11 changer transitions 0/97 dead transitions. [2024-11-28 03:34:20,609 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 120 places, 97 transitions, 368 flow [2024-11-28 03:34:20,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:20,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:34:20,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 418 transitions. [2024-11-28 03:34:20,611 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.653125 [2024-11-28 03:34:20,611 INFO L175 Difference]: Start difference. First operand has 117 places, 98 transitions, 266 flow. Second operand 5 states and 418 transitions. [2024-11-28 03:34:20,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 120 places, 97 transitions, 368 flow [2024-11-28 03:34:20,613 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 97 transitions, 346 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:34:20,614 INFO L231 Difference]: Finished difference. Result has 114 places, 97 transitions, 264 flow [2024-11-28 03:34:20,614 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=264, PETRI_PLACES=114, PETRI_TRANSITIONS=97} [2024-11-28 03:34:20,615 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -16 predicate places. [2024-11-28 03:34:20,615 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 97 transitions, 264 flow [2024-11-28 03:34:20,616 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 76.8) internal successors, (384), 5 states have internal predecessors, (384), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:20,616 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:20,616 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:20,616 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-28 03:34:20,616 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:20,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:20,617 INFO L85 PathProgramCache]: Analyzing trace with hash 2109613250, now seen corresponding path program 1 times [2024-11-28 03:34:20,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:20,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805614795] [2024-11-28 03:34:20,617 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:20,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:20,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:20,765 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-28 03:34:20,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:20,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805614795] [2024-11-28 03:34:20,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805614795] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:20,766 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:20,766 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:20,766 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111796860] [2024-11-28 03:34:20,766 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:20,767 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:20,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:20,767 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:20,767 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:21,163 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-11-28 03:34:21,164 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 97 transitions, 264 flow. Second operand has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:21,165 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:21,165 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-11-28 03:34:21,165 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:21,393 INFO L124 PetriNetUnfolderBase]: 64/285 cut-off events. [2024-11-28 03:34:21,394 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:34:21,394 INFO L83 FinitePrefix]: Finished finitePrefix Result has 518 conditions, 285 events. 64/285 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1120 event pairs, 63 based on Foata normal form. 1/239 useless extension candidates. Maximal degree in co-relation 467. Up to 171 conditions per place. [2024-11-28 03:34:21,396 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 46 selfloop transitions, 11 changer transitions 0/96 dead transitions. [2024-11-28 03:34:21,396 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 96 transitions, 376 flow [2024-11-28 03:34:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:34:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 398 transitions. [2024-11-28 03:34:21,397 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.621875 [2024-11-28 03:34:21,398 INFO L175 Difference]: Start difference. First operand has 114 places, 97 transitions, 264 flow. Second operand 5 states and 398 transitions. [2024-11-28 03:34:21,398 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 96 transitions, 376 flow [2024-11-28 03:34:21,399 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 96 transitions, 354 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:34:21,403 INFO L231 Difference]: Finished difference. Result has 113 places, 96 transitions, 262 flow [2024-11-28 03:34:21,404 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=109, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=262, PETRI_PLACES=113, PETRI_TRANSITIONS=96} [2024-11-28 03:34:21,405 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -17 predicate places. [2024-11-28 03:34:21,406 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 96 transitions, 262 flow [2024-11-28 03:34:21,407 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 72.2) internal successors, (361), 5 states have internal predecessors, (361), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:21,407 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:21,407 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:21,407 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-28 03:34:21,407 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:21,408 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:21,408 INFO L85 PathProgramCache]: Analyzing trace with hash -767315298, now seen corresponding path program 1 times [2024-11-28 03:34:21,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:21,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409399620] [2024-11-28 03:34:21,408 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:21,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:21,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:21,941 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:21,941 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:21,941 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [409399620] [2024-11-28 03:34:21,941 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [409399620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:21,941 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:21,941 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:21,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142045558] [2024-11-28 03:34:21,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:21,942 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:34:21,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:21,942 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:34:21,944 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:34:22,518 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 128 [2024-11-28 03:34:22,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 96 transitions, 262 flow. Second operand has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:22,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:22,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 128 [2024-11-28 03:34:22,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:22,718 INFO L124 PetriNetUnfolderBase]: 73/309 cut-off events. [2024-11-28 03:34:22,718 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-28 03:34:22,719 INFO L83 FinitePrefix]: Finished finitePrefix Result has 553 conditions, 309 events. 73/309 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1282 event pairs, 63 based on Foata normal form. 1/256 useless extension candidates. Maximal degree in co-relation 502. Up to 163 conditions per place. [2024-11-28 03:34:22,720 INFO L140 encePairwiseOnDemand]: 122/128 looper letters, 53 selfloop transitions, 3 changer transitions 3/102 dead transitions. [2024-11-28 03:34:22,720 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 102 transitions, 392 flow [2024-11-28 03:34:22,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-28 03:34:22,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-28 03:34:22,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 360 transitions. [2024-11-28 03:34:22,722 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.703125 [2024-11-28 03:34:22,722 INFO L175 Difference]: Start difference. First operand has 113 places, 96 transitions, 262 flow. Second operand 4 states and 360 transitions. [2024-11-28 03:34:22,722 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 102 transitions, 392 flow [2024-11-28 03:34:22,724 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 102 transitions, 370 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:34:22,726 INFO L231 Difference]: Finished difference. Result has 109 places, 93 transitions, 240 flow [2024-11-28 03:34:22,726 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=106, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=93, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=90, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=240, PETRI_PLACES=109, PETRI_TRANSITIONS=93} [2024-11-28 03:34:22,727 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -21 predicate places. [2024-11-28 03:34:22,727 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 93 transitions, 240 flow [2024-11-28 03:34:22,727 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 78.83333333333333) internal successors, (473), 6 states have internal predecessors, (473), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:22,727 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:22,727 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:22,728 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-28 03:34:22,728 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:22,728 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:22,728 INFO L85 PathProgramCache]: Analyzing trace with hash -818887018, now seen corresponding path program 1 times [2024-11-28 03:34:22,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:22,729 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532393472] [2024-11-28 03:34:22,729 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:22,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:22,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:23,448 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:34:23,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:23,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532393472] [2024-11-28 03:34:23,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532393472] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:23,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:23,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:34:23,449 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065334195] [2024-11-28 03:34:23,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:23,450 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:23,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:23,450 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:23,451 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:24,393 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 128 [2024-11-28 03:34:24,394 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 93 transitions, 240 flow. Second operand has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:24,394 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:24,394 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 128 [2024-11-28 03:34:24,394 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:24,695 INFO L124 PetriNetUnfolderBase]: 64/278 cut-off events. [2024-11-28 03:34:24,695 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:34:24,696 INFO L83 FinitePrefix]: Finished finitePrefix Result has 511 conditions, 278 events. 64/278 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1107 event pairs, 54 based on Foata normal form. 2/237 useless extension candidates. Maximal degree in co-relation 459. Up to 132 conditions per place. [2024-11-28 03:34:24,698 INFO L140 encePairwiseOnDemand]: 110/128 looper letters, 48 selfloop transitions, 14 changer transitions 3/98 dead transitions. [2024-11-28 03:34:24,698 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 98 transitions, 380 flow [2024-11-28 03:34:24,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-28 03:34:24,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-28 03:34:24,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 451 transitions. [2024-11-28 03:34:24,701 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5033482142857143 [2024-11-28 03:34:24,701 INFO L175 Difference]: Start difference. First operand has 109 places, 93 transitions, 240 flow. Second operand 7 states and 451 transitions. [2024-11-28 03:34:24,701 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 98 transitions, 380 flow [2024-11-28 03:34:24,704 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 98 transitions, 374 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-28 03:34:24,706 INFO L231 Difference]: Finished difference. Result has 108 places, 89 transitions, 254 flow [2024-11-28 03:34:24,706 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=254, PETRI_PLACES=108, PETRI_TRANSITIONS=89} [2024-11-28 03:34:24,707 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -22 predicate places. [2024-11-28 03:34:24,708 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 89 transitions, 254 flow [2024-11-28 03:34:24,709 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 58.57142857142857) internal successors, (410), 7 states have internal predecessors, (410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:24,709 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:24,709 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:24,709 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-28 03:34:24,709 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:24,710 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:24,710 INFO L85 PathProgramCache]: Analyzing trace with hash -818887019, now seen corresponding path program 1 times [2024-11-28 03:34:24,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:24,710 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592738596] [2024-11-28 03:34:24,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:24,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:24,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:25,076 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:34:25,076 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:25,076 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592738596] [2024-11-28 03:34:25,076 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592738596] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:25,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:25,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-28 03:34:25,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872712647] [2024-11-28 03:34:25,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:25,076 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-28 03:34:25,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:25,077 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-28 03:34:25,077 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-28 03:34:25,697 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 62 out of 128 [2024-11-28 03:34:25,698 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 89 transitions, 254 flow. Second operand has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:25,698 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:25,698 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 62 of 128 [2024-11-28 03:34:25,699 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:26,028 INFO L124 PetriNetUnfolderBase]: 64/276 cut-off events. [2024-11-28 03:34:26,028 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:34:26,029 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 276 events. 64/276 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1111 event pairs, 54 based on Foata normal form. 0/233 useless extension candidates. Maximal degree in co-relation 472. Up to 130 conditions per place. [2024-11-28 03:34:26,030 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 48 selfloop transitions, 17 changer transitions 3/96 dead transitions. [2024-11-28 03:34:26,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 113 places, 96 transitions, 404 flow [2024-11-28 03:34:26,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:34:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:34:26,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 556 transitions. [2024-11-28 03:34:26,033 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.54296875 [2024-11-28 03:34:26,033 INFO L175 Difference]: Start difference. First operand has 108 places, 89 transitions, 254 flow. Second operand 8 states and 556 transitions. [2024-11-28 03:34:26,033 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 113 places, 96 transitions, 404 flow [2024-11-28 03:34:26,035 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 96 transitions, 376 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-28 03:34:26,036 INFO L231 Difference]: Finished difference. Result has 107 places, 87 transitions, 256 flow [2024-11-28 03:34:26,036 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=256, PETRI_PLACES=107, PETRI_TRANSITIONS=87} [2024-11-28 03:34:26,037 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -23 predicate places. [2024-11-28 03:34:26,037 INFO L471 AbstractCegarLoop]: Abstraction has has 107 places, 87 transitions, 256 flow [2024-11-28 03:34:26,037 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 64.71428571428571) internal successors, (453), 7 states have internal predecessors, (453), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:26,037 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:26,038 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:26,038 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-28 03:34:26,038 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:26,038 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:26,038 INFO L85 PathProgramCache]: Analyzing trace with hash -971384534, now seen corresponding path program 1 times [2024-11-28 03:34:26,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:26,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139980197] [2024-11-28 03:34:26,039 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:26,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:26,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 58 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:34:26,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139980197] [2024-11-28 03:34:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139980197] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [669855460] [2024-11-28 03:34:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:26,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:26,198 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:26,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:26,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:26,562 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 70 out of 128 [2024-11-28 03:34:26,562 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 87 transitions, 256 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:26,562 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:26,563 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 70 of 128 [2024-11-28 03:34:26,563 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:26,774 INFO L124 PetriNetUnfolderBase]: 64/275 cut-off events. [2024-11-28 03:34:26,774 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-28 03:34:26,775 INFO L83 FinitePrefix]: Finished finitePrefix Result has 522 conditions, 275 events. 64/275 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1118 event pairs, 63 based on Foata normal form. 1/235 useless extension candidates. Maximal degree in co-relation 471. Up to 170 conditions per place. [2024-11-28 03:34:26,776 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 45 selfloop transitions, 11 changer transitions 0/86 dead transitions. [2024-11-28 03:34:26,776 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 86 transitions, 366 flow [2024-11-28 03:34:26,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:26,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:34:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 397 transitions. [2024-11-28 03:34:26,778 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6203125 [2024-11-28 03:34:26,779 INFO L175 Difference]: Start difference. First operand has 107 places, 87 transitions, 256 flow. Second operand 5 states and 397 transitions. [2024-11-28 03:34:26,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 86 transitions, 366 flow [2024-11-28 03:34:26,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 86 transitions, 332 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 03:34:26,782 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 242 flow [2024-11-28 03:34:26,782 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=220, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2024-11-28 03:34:26,782 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -27 predicate places. [2024-11-28 03:34:26,783 INFO L471 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 242 flow [2024-11-28 03:34:26,783 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:26,783 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:26,783 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:26,783 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-28 03:34:26,783 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:26,784 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:26,784 INFO L85 PathProgramCache]: Analyzing trace with hash -971384533, now seen corresponding path program 1 times [2024-11-28 03:34:26,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:26,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [859616558] [2024-11-28 03:34:26,784 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:26,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:26,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:27,088 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-28 03:34:27,088 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:27,088 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [859616558] [2024-11-28 03:34:27,088 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [859616558] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:34:27,088 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:34:27,088 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:34:27,088 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1732869168] [2024-11-28 03:34:27,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:34:27,089 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:34:27,089 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:27,089 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:34:27,089 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:34:27,575 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-28 03:34:27,576 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:27,576 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:34:27,576 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-28 03:34:27,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:34:27,805 INFO L124 PetriNetUnfolderBase]: 64/274 cut-off events. [2024-11-28 03:34:27,806 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2024-11-28 03:34:27,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 501 conditions, 274 events. 64/274 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1107 event pairs, 63 based on Foata normal form. 1/232 useless extension candidates. Maximal degree in co-relation 450. Up to 170 conditions per place. [2024-11-28 03:34:27,808 INFO L140 encePairwiseOnDemand]: 116/128 looper letters, 40 selfloop transitions, 11 changer transitions 0/85 dead transitions. [2024-11-28 03:34:27,808 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 85 transitions, 342 flow [2024-11-28 03:34:27,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:34:27,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:34:27,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 417 transitions. [2024-11-28 03:34:27,810 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6515625 [2024-11-28 03:34:27,810 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 242 flow. Second operand 5 states and 417 transitions. [2024-11-28 03:34:27,810 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 85 transitions, 342 flow [2024-11-28 03:34:27,811 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 85 transitions, 320 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:34:27,813 INFO L231 Difference]: Finished difference. Result has 102 places, 85 transitions, 240 flow [2024-11-28 03:34:27,814 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=240, PETRI_PLACES=102, PETRI_TRANSITIONS=85} [2024-11-28 03:34:27,815 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -28 predicate places. [2024-11-28 03:34:27,815 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 85 transitions, 240 flow [2024-11-28 03:34:27,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 78.0) internal successors, (390), 5 states have internal predecessors, (390), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:34:27,815 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:34:27,815 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:34:27,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-28 03:34:27,815 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:34:27,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:34:27,816 INFO L85 PathProgramCache]: Analyzing trace with hash 121452936, now seen corresponding path program 1 times [2024-11-28 03:34:27,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:34:27,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116064318] [2024-11-28 03:34:27,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:27,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:34:27,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:29,939 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:29,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:34:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116064318] [2024-11-28 03:34:29,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2116064318] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:34:29,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1736392559] [2024-11-28 03:34:29,941 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:34:29,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:34:29,942 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:34:29,944 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:34:29,948 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-28 03:34:30,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:34:30,247 INFO L256 TraceCheckSpWp]: Trace formula consists of 706 conjuncts, 95 conjuncts are in the unsatisfiable core [2024-11-28 03:34:30,252 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:34:30,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:34:30,323 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-28 03:34:30,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:34:30,442 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:34:30,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:30,451 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 17 [2024-11-28 03:34:30,476 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-28 03:34:30,476 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2024-11-28 03:34:30,587 INFO L349 Elim1Store]: treesize reduction 39, result has 25.0 percent of original size [2024-11-28 03:34:30,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 22 [2024-11-28 03:34:30,757 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 03:34:30,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-28 03:34:30,790 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-28 03:34:30,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 21 [2024-11-28 03:34:30,827 INFO L349 Elim1Store]: treesize reduction 68, result has 21.8 percent of original size [2024-11-28 03:34:30,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 30 [2024-11-28 03:34:31,503 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:34:31,530 INFO L349 Elim1Store]: treesize reduction 108, result has 15.0 percent of original size [2024-11-28 03:34:31,530 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 46 [2024-11-28 03:34:31,552 INFO L349 Elim1Store]: treesize reduction 4, result has 75.0 percent of original size [2024-11-28 03:34:31,553 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 19 [2024-11-28 03:34:32,897 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:32,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 26 [2024-11-28 03:34:32,916 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-28 03:34:32,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 7 [2024-11-28 03:34:33,013 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:33,013 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:34:33,286 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:34:33,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 61 treesize of output 79 [2024-11-28 03:34:34,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 93 [2024-11-28 03:34:34,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 117 [2024-11-28 03:34:35,000 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 3 proven. 3 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:34:35,001 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1736392559] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:34:35,001 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:34:35,001 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 11] total 38 [2024-11-28 03:34:35,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021241362] [2024-11-28 03:34:35,001 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:34:35,002 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-28 03:34:35,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:34:35,003 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-28 03:34:35,004 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=1259, Unknown=1, NotChecked=0, Total=1482 [2024-11-28 03:34:36,783 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:38,346 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.34s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:39,847 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.37s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:41,567 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:43,088 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:44,714 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:45,769 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:47,325 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:48,927 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:51,358 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:52,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:34:54,611 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:01,004 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:04,226 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:06,119 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:07,857 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.53s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:09,360 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:12,532 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:15,766 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:18,471 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:19,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:22,272 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.25s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:24,100 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.16s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:25,483 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:28,719 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:29,829 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:32,163 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:34,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:37,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:38,718 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.08s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:40,134 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:42,054 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:43,420 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:44,434 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:46,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:48,793 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.10s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2024-11-28 03:35:48,793 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 18 out of 128 [2024-11-28 03:35:48,794 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 85 transitions, 240 flow. Second operand has 39 states, 39 states have (on average 19.871794871794872) internal successors, (775), 39 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:48,794 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:48,794 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 18 of 128 [2024-11-28 03:35:48,794 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:51,728 INFO L124 PetriNetUnfolderBase]: 177/483 cut-off events. [2024-11-28 03:35:51,728 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2024-11-28 03:35:51,729 INFO L83 FinitePrefix]: Finished finitePrefix Result has 958 conditions, 483 events. 177/483 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2260 event pairs, 160 based on Foata normal form. 0/337 useless extension candidates. Maximal degree in co-relation 907. Up to 349 conditions per place. [2024-11-28 03:35:51,731 INFO L140 encePairwiseOnDemand]: 106/128 looper letters, 66 selfloop transitions, 20 changer transitions 3/99 dead transitions. [2024-11-28 03:35:51,731 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 99 transitions, 446 flow [2024-11-28 03:35:51,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-28 03:35:51,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2024-11-28 03:35:51,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 369 transitions. [2024-11-28 03:35:51,734 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.18017578125 [2024-11-28 03:35:51,735 INFO L175 Difference]: Start difference. First operand has 102 places, 85 transitions, 240 flow. Second operand 16 states and 369 transitions. [2024-11-28 03:35:51,735 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 99 transitions, 446 flow [2024-11-28 03:35:51,736 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 111 places, 99 transitions, 424 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:35:51,737 INFO L231 Difference]: Finished difference. Result has 111 places, 83 transitions, 254 flow [2024-11-28 03:35:51,737 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=254, PETRI_PLACES=111, PETRI_TRANSITIONS=83} [2024-11-28 03:35:51,738 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -19 predicate places. [2024-11-28 03:35:51,738 INFO L471 AbstractCegarLoop]: Abstraction has has 111 places, 83 transitions, 254 flow [2024-11-28 03:35:51,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 19.871794871794872) internal successors, (775), 39 states have internal predecessors, (775), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:51,738 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:51,738 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:51,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-28 03:35:51,943 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-28 03:35:51,943 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:51,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:51,943 INFO L85 PathProgramCache]: Analyzing trace with hash 121452935, now seen corresponding path program 1 times [2024-11-28 03:35:51,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:51,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986950942] [2024-11-28 03:35:51,944 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:51,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:52,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:52,716 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 59 trivial. 0 not checked. [2024-11-28 03:35:52,716 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:52,716 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986950942] [2024-11-28 03:35:52,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [986950942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:52,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:52,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-28 03:35:52,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299384806] [2024-11-28 03:35:52,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:52,717 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-28 03:35:52,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:52,718 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-28 03:35:52,718 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-28 03:35:53,668 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 128 [2024-11-28 03:35:53,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 83 transitions, 254 flow. Second operand has 9 states, 9 states have (on average 74.77777777777777) internal successors, (673), 9 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:53,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:53,669 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 128 [2024-11-28 03:35:53,669 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:53,949 INFO L124 PetriNetUnfolderBase]: 64/271 cut-off events. [2024-11-28 03:35:53,949 INFO L125 PetriNetUnfolderBase]: For 58/58 co-relation queries the response was YES. [2024-11-28 03:35:53,950 INFO L83 FinitePrefix]: Finished finitePrefix Result has 523 conditions, 271 events. 64/271 cut-off events. For 58/58 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1099 event pairs, 54 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 471. Up to 133 conditions per place. [2024-11-28 03:35:53,951 INFO L140 encePairwiseOnDemand]: 115/128 looper letters, 52 selfloop transitions, 12 changer transitions 3/91 dead transitions. [2024-11-28 03:35:53,951 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 117 places, 91 transitions, 404 flow [2024-11-28 03:35:53,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-28 03:35:53,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-28 03:35:53,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 634 transitions. [2024-11-28 03:35:53,954 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.619140625 [2024-11-28 03:35:53,954 INFO L175 Difference]: Start difference. First operand has 111 places, 83 transitions, 254 flow. Second operand 8 states and 634 transitions. [2024-11-28 03:35:53,954 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 117 places, 91 transitions, 404 flow [2024-11-28 03:35:53,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 91 transitions, 364 flow, removed 0 selfloop flow, removed 15 redundant places. [2024-11-28 03:35:53,956 INFO L231 Difference]: Finished difference. Result has 102 places, 82 transitions, 236 flow [2024-11-28 03:35:53,957 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=212, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=236, PETRI_PLACES=102, PETRI_TRANSITIONS=82} [2024-11-28 03:35:53,957 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -28 predicate places. [2024-11-28 03:35:53,957 INFO L471 AbstractCegarLoop]: Abstraction has has 102 places, 82 transitions, 236 flow [2024-11-28 03:35:53,958 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 74.77777777777777) internal successors, (673), 9 states have internal predecessors, (673), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:53,958 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:53,958 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:53,958 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-28 03:35:53,958 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:53,959 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:53,959 INFO L85 PathProgramCache]: Analyzing trace with hash 752180238, now seen corresponding path program 1 times [2024-11-28 03:35:53,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:53,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2087793261] [2024-11-28 03:35:53,959 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:53,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:54,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:54,148 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-28 03:35:54,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:54,149 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2087793261] [2024-11-28 03:35:54,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2087793261] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:54,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:54,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:35:54,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1426565404] [2024-11-28 03:35:54,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:54,149 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:35:54,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:54,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:35:54,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:35:54,526 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 128 [2024-11-28 03:35:54,527 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 82 transitions, 236 flow. Second operand has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:54,527 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:54,527 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 128 [2024-11-28 03:35:54,527 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:54,743 INFO L124 PetriNetUnfolderBase]: 73/287 cut-off events. [2024-11-28 03:35:54,743 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2024-11-28 03:35:54,744 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 287 events. 73/287 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 1179 event pairs, 45 based on Foata normal form. 2/246 useless extension candidates. Maximal degree in co-relation 495. Up to 108 conditions per place. [2024-11-28 03:35:54,745 INFO L140 encePairwiseOnDemand]: 109/128 looper letters, 47 selfloop transitions, 17 changer transitions 0/89 dead transitions. [2024-11-28 03:35:54,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 89 transitions, 378 flow [2024-11-28 03:35:54,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:35:54,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:35:54,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 401 transitions. [2024-11-28 03:35:54,747 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6265625 [2024-11-28 03:35:54,747 INFO L175 Difference]: Start difference. First operand has 102 places, 82 transitions, 236 flow. Second operand 5 states and 401 transitions. [2024-11-28 03:35:54,747 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 89 transitions, 378 flow [2024-11-28 03:35:54,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 89 transitions, 354 flow, removed 0 selfloop flow, removed 7 redundant places. [2024-11-28 03:35:54,750 INFO L231 Difference]: Finished difference. Result has 97 places, 80 transitions, 242 flow [2024-11-28 03:35:54,750 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=208, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=242, PETRI_PLACES=97, PETRI_TRANSITIONS=80} [2024-11-28 03:35:54,750 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -33 predicate places. [2024-11-28 03:35:54,751 INFO L471 AbstractCegarLoop]: Abstraction has has 97 places, 80 transitions, 242 flow [2024-11-28 03:35:54,751 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 73.8) internal successors, (369), 5 states have internal predecessors, (369), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:54,751 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:54,751 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:54,751 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-28 03:35:54,751 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:54,752 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:54,752 INFO L85 PathProgramCache]: Analyzing trace with hash 752180239, now seen corresponding path program 1 times [2024-11-28 03:35:54,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:54,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196872771] [2024-11-28 03:35:54,752 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:54,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:54,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:55,048 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 65 trivial. 0 not checked. [2024-11-28 03:35:55,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:55,049 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196872771] [2024-11-28 03:35:55,049 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196872771] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:55,049 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:55,049 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-28 03:35:55,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743053666] [2024-11-28 03:35:55,049 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:55,050 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-28 03:35:55,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:55,050 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-28 03:35:55,051 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-28 03:35:55,447 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 128 [2024-11-28 03:35:55,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 80 transitions, 242 flow. Second operand has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:55,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:55,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 128 [2024-11-28 03:35:55,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:55,652 INFO L124 PetriNetUnfolderBase]: 73/274 cut-off events. [2024-11-28 03:35:55,652 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2024-11-28 03:35:55,653 INFO L83 FinitePrefix]: Finished finitePrefix Result has 551 conditions, 274 events. 73/274 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1081 event pairs, 18 based on Foata normal form. 2/251 useless extension candidates. Maximal degree in co-relation 500. Up to 135 conditions per place. [2024-11-28 03:35:55,654 INFO L140 encePairwiseOnDemand]: 111/128 looper letters, 44 selfloop transitions, 15 changer transitions 0/87 dead transitions. [2024-11-28 03:35:55,654 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 87 transitions, 374 flow [2024-11-28 03:35:55,654 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-28 03:35:55,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2024-11-28 03:35:55,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 421 transitions. [2024-11-28 03:35:55,656 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6578125 [2024-11-28 03:35:55,656 INFO L175 Difference]: Start difference. First operand has 97 places, 80 transitions, 242 flow. Second operand 5 states and 421 transitions. [2024-11-28 03:35:55,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 87 transitions, 374 flow [2024-11-28 03:35:55,657 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 87 transitions, 340 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:35:55,659 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 234 flow [2024-11-28 03:35:55,659 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=204, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=234, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2024-11-28 03:35:55,660 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -35 predicate places. [2024-11-28 03:35:55,661 INFO L471 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 234 flow [2024-11-28 03:35:55,661 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 77.8) internal successors, (389), 5 states have internal predecessors, (389), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:55,661 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:55,661 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:55,661 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-28 03:35:55,661 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:55,662 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:55,662 INFO L85 PathProgramCache]: Analyzing trace with hash 715227645, now seen corresponding path program 1 times [2024-11-28 03:35:55,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:55,662 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847263850] [2024-11-28 03:35:55,662 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:55,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:55,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:55,796 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-28 03:35:55,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:55,797 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847263850] [2024-11-28 03:35:55,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847263850] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:55,797 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:55,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:55,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [838191081] [2024-11-28 03:35:55,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:55,799 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:55,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:55,799 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:55,799 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:55,894 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 86 out of 128 [2024-11-28 03:35:55,895 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 234 flow. Second operand has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:55,895 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:55,895 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 86 of 128 [2024-11-28 03:35:55,895 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:56,043 INFO L124 PetriNetUnfolderBase]: 71/277 cut-off events. [2024-11-28 03:35:56,043 INFO L125 PetriNetUnfolderBase]: For 76/76 co-relation queries the response was YES. [2024-11-28 03:35:56,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 531 conditions, 277 events. 71/277 cut-off events. For 76/76 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1122 event pairs, 56 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 480. Up to 161 conditions per place. [2024-11-28 03:35:56,045 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 55 selfloop transitions, 2 changer transitions 0/83 dead transitions. [2024-11-28 03:35:56,045 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 83 transitions, 360 flow [2024-11-28 03:35:56,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:56,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:56,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 307 transitions. [2024-11-28 03:35:56,046 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.7994791666666666 [2024-11-28 03:35:56,046 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 234 flow. Second operand 3 states and 307 transitions. [2024-11-28 03:35:56,046 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 83 transitions, 360 flow [2024-11-28 03:35:56,048 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 83 transitions, 328 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:35:56,049 INFO L231 Difference]: Finished difference. Result has 91 places, 76 transitions, 204 flow [2024-11-28 03:35:56,049 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=204, PETRI_PLACES=91, PETRI_TRANSITIONS=76} [2024-11-28 03:35:56,050 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -39 predicate places. [2024-11-28 03:35:56,050 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 76 transitions, 204 flow [2024-11-28 03:35:56,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 95.0) internal successors, (285), 3 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:56,050 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:56,050 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:56,051 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-28 03:35:56,051 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:56,051 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:56,051 INFO L85 PathProgramCache]: Analyzing trace with hash 715227646, now seen corresponding path program 1 times [2024-11-28 03:35:56,051 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:56,051 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103070015] [2024-11-28 03:35:56,051 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:56,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:56,251 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-28 03:35:56,252 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:56,252 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103070015] [2024-11-28 03:35:56,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2103070015] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:56,252 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:56,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-28 03:35:56,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1136282855] [2024-11-28 03:35:56,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:56,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-28 03:35:56,254 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:56,254 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-28 03:35:56,254 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-28 03:35:56,367 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 87 out of 128 [2024-11-28 03:35:56,368 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 76 transitions, 204 flow. Second operand has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:56,368 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:56,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 87 of 128 [2024-11-28 03:35:56,368 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:56,497 INFO L124 PetriNetUnfolderBase]: 64/254 cut-off events. [2024-11-28 03:35:56,497 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-28 03:35:56,498 INFO L83 FinitePrefix]: Finished finitePrefix Result has 484 conditions, 254 events. 64/254 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 963 event pairs, 56 based on Foata normal form. 16/244 useless extension candidates. Maximal degree in co-relation 433. Up to 161 conditions per place. [2024-11-28 03:35:56,499 INFO L140 encePairwiseOnDemand]: 124/128 looper letters, 54 selfloop transitions, 2 changer transitions 0/81 dead transitions. [2024-11-28 03:35:56,499 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 81 transitions, 326 flow [2024-11-28 03:35:56,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-28 03:35:56,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-28 03:35:56,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 309 transitions. [2024-11-28 03:35:56,500 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.8046875 [2024-11-28 03:35:56,501 INFO L175 Difference]: Start difference. First operand has 91 places, 76 transitions, 204 flow. Second operand 3 states and 309 transitions. [2024-11-28 03:35:56,501 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 81 transitions, 326 flow [2024-11-28 03:35:56,502 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 81 transitions, 322 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:56,503 INFO L231 Difference]: Finished difference. Result has 89 places, 74 transitions, 200 flow [2024-11-28 03:35:56,503 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=74, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=72, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=200, PETRI_PLACES=89, PETRI_TRANSITIONS=74} [2024-11-28 03:35:56,504 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -41 predicate places. [2024-11-28 03:35:56,504 INFO L471 AbstractCegarLoop]: Abstraction has has 89 places, 74 transitions, 200 flow [2024-11-28 03:35:56,504 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 96.0) internal successors, (288), 3 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:56,504 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:56,504 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:56,504 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-28 03:35:56,504 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:56,505 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:56,505 INFO L85 PathProgramCache]: Analyzing trace with hash 581115993, now seen corresponding path program 1 times [2024-11-28 03:35:56,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:56,505 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1624361929] [2024-11-28 03:35:56,505 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:56,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:56,550 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:56,702 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-28 03:35:56,702 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:56,702 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1624361929] [2024-11-28 03:35:56,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1624361929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:56,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:56,702 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:56,702 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [746366619] [2024-11-28 03:35:56,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:56,703 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:35:56,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:56,703 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:35:56,703 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:57,065 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-28 03:35:57,066 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 74 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:57,066 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:57,066 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-28 03:35:57,066 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:57,301 INFO L124 PetriNetUnfolderBase]: 73/271 cut-off events. [2024-11-28 03:35:57,302 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2024-11-28 03:35:57,302 INFO L83 FinitePrefix]: Finished finitePrefix Result has 526 conditions, 271 events. 73/271 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 1030 event pairs, 54 based on Foata normal form. 0/247 useless extension candidates. Maximal degree in co-relation 475. Up to 131 conditions per place. [2024-11-28 03:35:57,303 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 59 selfloop transitions, 10 changer transitions 3/91 dead transitions. [2024-11-28 03:35:57,303 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 93 places, 91 transitions, 386 flow [2024-11-28 03:35:57,304 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:57,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:57,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 513 transitions. [2024-11-28 03:35:57,306 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.66796875 [2024-11-28 03:35:57,306 INFO L175 Difference]: Start difference. First operand has 89 places, 74 transitions, 200 flow. Second operand 6 states and 513 transitions. [2024-11-28 03:35:57,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 93 places, 91 transitions, 386 flow [2024-11-28 03:35:57,307 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 91 transitions, 374 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:35:57,308 INFO L231 Difference]: Finished difference. Result has 91 places, 73 transitions, 214 flow [2024-11-28 03:35:57,308 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=214, PETRI_PLACES=91, PETRI_TRANSITIONS=73} [2024-11-28 03:35:57,309 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -39 predicate places. [2024-11-28 03:35:57,309 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 73 transitions, 214 flow [2024-11-28 03:35:57,309 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:57,309 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:57,310 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:57,310 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-28 03:35:57,310 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:57,310 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:57,310 INFO L85 PathProgramCache]: Analyzing trace with hash 581115994, now seen corresponding path program 1 times [2024-11-28 03:35:57,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:57,310 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303956920] [2024-11-28 03:35:57,310 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:57,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:57,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:57,684 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 70 trivial. 0 not checked. [2024-11-28 03:35:57,684 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:57,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303956920] [2024-11-28 03:35:57,684 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303956920] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-28 03:35:57,684 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-28 03:35:57,685 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-28 03:35:57,685 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193823604] [2024-11-28 03:35:57,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-28 03:35:57,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-28 03:35:57,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:35:57,685 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-28 03:35:57,686 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-28 03:35:58,290 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 75 out of 128 [2024-11-28 03:35:58,291 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 73 transitions, 214 flow. Second operand has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:58,291 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:35:58,291 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 75 of 128 [2024-11-28 03:35:58,291 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:35:58,534 INFO L124 PetriNetUnfolderBase]: 79/298 cut-off events. [2024-11-28 03:35:58,535 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-28 03:35:58,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 585 conditions, 298 events. 79/298 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 21. Compared 1241 event pairs, 30 based on Foata normal form. 3/265 useless extension candidates. Maximal degree in co-relation 534. Up to 163 conditions per place. [2024-11-28 03:35:58,536 INFO L140 encePairwiseOnDemand]: 117/128 looper letters, 58 selfloop transitions, 11 changer transitions 0/87 dead transitions. [2024-11-28 03:35:58,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 87 transitions, 386 flow [2024-11-28 03:35:58,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-28 03:35:58,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-28 03:35:58,538 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 510 transitions. [2024-11-28 03:35:58,538 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.6640625 [2024-11-28 03:35:58,538 INFO L175 Difference]: Start difference. First operand has 91 places, 73 transitions, 214 flow. Second operand 6 states and 510 transitions. [2024-11-28 03:35:58,538 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 87 transitions, 386 flow [2024-11-28 03:35:58,539 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 87 transitions, 360 flow, removed 0 selfloop flow, removed 5 redundant places. [2024-11-28 03:35:58,540 INFO L231 Difference]: Finished difference. Result has 93 places, 78 transitions, 244 flow [2024-11-28 03:35:58,541 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=73, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=244, PETRI_PLACES=93, PETRI_TRANSITIONS=78} [2024-11-28 03:35:58,541 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -37 predicate places. [2024-11-28 03:35:58,541 INFO L471 AbstractCegarLoop]: Abstraction has has 93 places, 78 transitions, 244 flow [2024-11-28 03:35:58,542 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 80.16666666666667) internal successors, (481), 6 states have internal predecessors, (481), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:35:58,542 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:35:58,542 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:35:58,542 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-28 03:35:58,542 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:35:58,543 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:35:58,543 INFO L85 PathProgramCache]: Analyzing trace with hash 139024382, now seen corresponding path program 1 times [2024-11-28 03:35:58,543 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:35:58,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1421951818] [2024-11-28 03:35:58,543 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:58,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:35:58,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:59,336 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2024-11-28 03:35:59,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:35:59,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1421951818] [2024-11-28 03:35:59,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1421951818] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:35:59,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2134444044] [2024-11-28 03:35:59,337 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:35:59,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:35:59,337 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:35:59,339 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:35:59,341 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-28 03:35:59,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:35:59,708 INFO L256 TraceCheckSpWp]: Trace formula consists of 895 conjuncts, 57 conjuncts are in the unsatisfiable core [2024-11-28 03:35:59,713 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:35:59,829 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:35:59,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:35:59,875 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:35:59,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:35:59,931 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:35:59,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:35:59,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:36:00,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:00,008 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:36:00,019 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-28 03:36:00,096 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:36:00,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-28 03:36:00,113 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-28 03:36:00,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-28 03:36:00,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-28 03:36:00,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-28 03:36:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 11 proven. 3 refuted. 0 times theorem prover too weak. 56 trivial. 0 not checked. [2024-11-28 03:36:00,311 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:00,569 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:00,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-28 03:36:00,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:00,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-28 03:36:00,767 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:36:00,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 03:36:00,886 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:00,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 55 [2024-11-28 03:36:00,935 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-28 03:36:00,935 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-28 03:36:01,121 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 61 trivial. 0 not checked. [2024-11-28 03:36:01,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2134444044] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:36:01,122 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:36:01,122 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 4] total 18 [2024-11-28 03:36:01,122 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123110176] [2024-11-28 03:36:01,122 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:36:01,123 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-28 03:36:01,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:36:01,123 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-28 03:36:01,124 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=300, Unknown=0, NotChecked=0, Total=380 [2024-11-28 03:36:05,685 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 128 [2024-11-28 03:36:05,686 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 78 transitions, 244 flow. Second operand has 20 states, 20 states have (on average 71.9) internal successors, (1438), 20 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:05,686 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:36:05,686 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 128 [2024-11-28 03:36:05,686 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:36:06,155 INFO L124 PetriNetUnfolderBase]: 82/284 cut-off events. [2024-11-28 03:36:06,155 INFO L125 PetriNetUnfolderBase]: For 79/83 co-relation queries the response was YES. [2024-11-28 03:36:06,156 INFO L83 FinitePrefix]: Finished finitePrefix Result has 604 conditions, 284 events. 82/284 cut-off events. For 79/83 co-relation queries the response was YES. Maximal size of possible extension queue 22. Compared 1119 event pairs, 6 based on Foata normal form. 0/254 useless extension candidates. Maximal degree in co-relation 551. Up to 81 conditions per place. [2024-11-28 03:36:06,157 INFO L140 encePairwiseOnDemand]: 112/128 looper letters, 57 selfloop transitions, 22 changer transitions 3/103 dead transitions. [2024-11-28 03:36:06,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 103 transitions, 472 flow [2024-11-28 03:36:06,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-28 03:36:06,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2024-11-28 03:36:06,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 819 transitions. [2024-11-28 03:36:06,159 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.5816761363636364 [2024-11-28 03:36:06,159 INFO L175 Difference]: Start difference. First operand has 93 places, 78 transitions, 244 flow. Second operand 11 states and 819 transitions. [2024-11-28 03:36:06,159 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 103 transitions, 472 flow [2024-11-28 03:36:06,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 103 transitions, 464 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-28 03:36:06,162 INFO L231 Difference]: Finished difference. Result has 100 places, 82 transitions, 295 flow [2024-11-28 03:36:06,162 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=234, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=77, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=295, PETRI_PLACES=100, PETRI_TRANSITIONS=82} [2024-11-28 03:36:06,163 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -30 predicate places. [2024-11-28 03:36:06,163 INFO L471 AbstractCegarLoop]: Abstraction has has 100 places, 82 transitions, 295 flow [2024-11-28 03:36:06,164 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 71.9) internal successors, (1438), 20 states have internal predecessors, (1438), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:06,164 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:36:06,164 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:06,175 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-28 03:36:06,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-28 03:36:06,364 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:36:06,365 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:06,365 INFO L85 PathProgramCache]: Analyzing trace with hash 834727436, now seen corresponding path program 1 times [2024-11-28 03:36:06,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:36:06,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237453205] [2024-11-28 03:36:06,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:06,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:36:06,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:11,875 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 7 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:36:11,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:36:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237453205] [2024-11-28 03:36:11,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237453205] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:36:11,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [470511644] [2024-11-28 03:36:11,875 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:11,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:36:11,876 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:36:11,880 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:36:11,884 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-28 03:36:12,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:12,258 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 133 conjuncts are in the unsatisfiable core [2024-11-28 03:36:12,266 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:12,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:36:12,332 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2024-11-28 03:36:12,455 INFO L349 Elim1Store]: treesize reduction 44, result has 37.1 percent of original size [2024-11-28 03:36:12,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 32 [2024-11-28 03:36:12,571 INFO L349 Elim1Store]: treesize reduction 21, result has 34.4 percent of original size [2024-11-28 03:36:12,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-28 03:36:12,592 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-28 03:36:12,593 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2024-11-28 03:36:12,610 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-28 03:36:12,610 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-28 03:36:12,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-28 03:36:13,030 INFO L349 Elim1Store]: treesize reduction 29, result has 70.1 percent of original size [2024-11-28 03:36:13,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 75 treesize of output 118 [2024-11-28 03:36:13,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 03:36:13,541 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-28 03:36:13,661 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2024-11-28 03:36:13,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 45 [2024-11-28 03:36:13,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2024-11-28 03:36:13,986 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2024-11-28 03:36:13,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 127 treesize of output 90 [2024-11-28 03:36:14,015 INFO L349 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2024-11-28 03:36:14,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2024-11-28 03:36:14,149 INFO L349 Elim1Store]: treesize reduction 43, result has 23.2 percent of original size [2024-11-28 03:36:14,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 61 [2024-11-28 03:36:14,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 19 [2024-11-28 03:36:14,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 28 [2024-11-28 03:36:14,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2024-11-28 03:36:14,388 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-28 03:36:14,425 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:36:14,425 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:14,638 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse2)) (.cse1 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse2) 4))) (and (forall ((v_ArrVal_2744 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2744) .cse0) .cse1))) (forall ((v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int))) (<= (+ 4 (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2744) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2745) .cse0) .cse1))))))) is different from false [2024-11-28 03:36:14,652 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) (.cse3 (+ 4 |c_ULTIMATE.start_list_add_~list#1.offset|))) (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~list#1.base|) .cse3 |c_ULTIMATE.start_list_add_~node#1.offset|))) (.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse4)) (.cse2 (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse4) 4))) (and (forall ((v_ArrVal_2744 (Array Int Int))) (<= 0 (select (select (store .cse0 |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2744) .cse1) .cse2))) (forall ((v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int))) (<= (+ (select (select (store .cse0 |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2744) .cse1) .cse2) 4) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~list#1.base|) .cse3 |c_ULTIMATE.start_list_add_~node#1.base|)) |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2745) .cse1) .cse2))))))) is different from false [2024-11-28 03:36:14,867 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4))) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|)) (.cse9 (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|)) (.cse10 (+ |c_~#slot~0.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|)))) (let ((.cse1 (select .cse9 .cse10)) (.cse2 (+ (select .cse7 .cse10) 4)) (.cse3 (select .cse9 .cse8)) (.cse4 (+ (select .cse7 .cse8) 4))) (and (forall ((v_ArrVal_2745 (Array Int Int)) (v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2739 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (<= (+ (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2738))) (store .cse0 .cse1 (store (select .cse0 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2744) .cse3) .cse4) 4) (select |c_#length| (select (select (store (let ((.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2739))) (store .cse5 .cse1 (store (select .cse5 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2745) .cse3) .cse4)))) (forall ((v_ArrVal_2744 (Array Int Int)) (v_ArrVal_2738 (Array Int Int))) (<= 0 (select (select (store (let ((.cse6 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_2738))) (store .cse6 .cse1 (store (select .cse6 .cse1) .cse2 |c_ULTIMATE.start_main_~p~1#1.offset|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_2744) .cse3) .cse4)))))) is different from false [2024-11-28 03:36:14,881 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:14,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 88 treesize of output 79 [2024-11-28 03:36:14,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:14,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1324 treesize of output 1308 [2024-11-28 03:36:14,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 842 treesize of output 794 [2024-11-28 03:36:14,939 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 794 treesize of output 698 [2024-11-28 03:36:14,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:15,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:15,196 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:15,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 736 treesize of output 700 [2024-11-28 03:36:16,118 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:16,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 177 treesize of output 168 [2024-11-28 03:36:16,132 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:16,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 157 treesize of output 148 [2024-11-28 03:36:16,141 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:36:16,181 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-28 03:36:16,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1532 treesize of output 1500 [2024-11-28 03:36:16,197 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-28 03:36:16,239 INFO L349 Elim1Store]: treesize reduction 16, result has 71.9 percent of original size [2024-11-28 03:36:16,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 10400 treesize of output 9798 [2024-11-28 03:36:16,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 704 treesize of output 656 [2024-11-28 03:36:16,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 800 treesize of output 728 [2024-11-28 03:36:16,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:16,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:16,490 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:16,490 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 211 treesize of output 199 [2024-11-28 03:36:16,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:16,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 149 treesize of output 137 [2024-11-28 03:36:17,734 INFO L349 Elim1Store]: treesize reduction 65, result has 30.9 percent of original size [2024-11-28 03:36:17,735 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 397 treesize of output 385 [2024-11-28 03:36:17,963 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:36:17,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [470511644] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:36:17,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:36:17,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 21, 18] total 65 [2024-11-28 03:36:17,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1860035471] [2024-11-28 03:36:17,964 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:36:17,964 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 66 states [2024-11-28 03:36:17,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:36:17,965 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 66 interpolants. [2024-11-28 03:36:17,966 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=306, Invalid=3591, Unknown=21, NotChecked=372, Total=4290 [2024-11-28 03:36:18,707 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 2 out of 128 [2024-11-28 03:36:18,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 82 transitions, 295 flow. Second operand has 66 states, 66 states have (on average 3.6515151515151514) internal successors, (241), 66 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:18,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:36:18,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 2 of 128 [2024-11-28 03:36:18,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:36:23,959 INFO L124 PetriNetUnfolderBase]: 276/630 cut-off events. [2024-11-28 03:36:23,960 INFO L125 PetriNetUnfolderBase]: For 215/217 co-relation queries the response was YES. [2024-11-28 03:36:23,970 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1518 conditions, 630 events. 276/630 cut-off events. For 215/217 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2831 event pairs, 32 based on Foata normal form. 0/502 useless extension candidates. Maximal degree in co-relation 1463. Up to 155 conditions per place. [2024-11-28 03:36:23,976 INFO L140 encePairwiseOnDemand]: 100/128 looper letters, 119 selfloop transitions, 40 changer transitions 3/163 dead transitions. [2024-11-28 03:36:23,976 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 163 transitions, 811 flow [2024-11-28 03:36:23,978 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:36:23,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-28 03:36:23,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 202 transitions. [2024-11-28 03:36:23,988 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.05844907407407408 [2024-11-28 03:36:23,988 INFO L175 Difference]: Start difference. First operand has 100 places, 82 transitions, 295 flow. Second operand 27 states and 202 transitions. [2024-11-28 03:36:23,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 163 transitions, 811 flow [2024-11-28 03:36:23,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 163 transitions, 798 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-28 03:36:23,996 INFO L231 Difference]: Finished difference. Result has 126 places, 93 transitions, 434 flow [2024-11-28 03:36:23,996 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=434, PETRI_PLACES=126, PETRI_TRANSITIONS=93} [2024-11-28 03:36:23,997 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, -4 predicate places. [2024-11-28 03:36:23,997 INFO L471 AbstractCegarLoop]: Abstraction has has 126 places, 93 transitions, 434 flow [2024-11-28 03:36:23,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 66 states, 66 states have (on average 3.6515151515151514) internal successors, (241), 66 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:23,997 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:36:23,998 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:24,009 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-28 03:36:24,198 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-28 03:36:24,198 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:36:24,200 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:24,200 INFO L85 PathProgramCache]: Analyzing trace with hash 834727435, now seen corresponding path program 1 times [2024-11-28 03:36:24,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:36:24,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1793490207] [2024-11-28 03:36:24,200 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:24,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:36:24,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:30,587 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 6 refuted. 0 times theorem prover too weak. 55 trivial. 0 not checked. [2024-11-28 03:36:30,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-28 03:36:30,587 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1793490207] [2024-11-28 03:36:30,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1793490207] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-28 03:36:30,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1109533702] [2024-11-28 03:36:30,588 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:30,589 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-28 03:36:30,589 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 [2024-11-28 03:36:30,591 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-28 03:36:30,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-28 03:36:31,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-28 03:36:31,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 850 conjuncts, 89 conjuncts are in the unsatisfiable core [2024-11-28 03:36:31,031 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-28 03:36:31,035 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 1 [2024-11-28 03:36:31,116 INFO L349 Elim1Store]: treesize reduction 29, result has 46.3 percent of original size [2024-11-28 03:36:31,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 29 [2024-11-28 03:36:31,243 INFO L349 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2024-11-28 03:36:31,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 33 [2024-11-28 03:36:31,262 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-28 03:36:31,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 25 [2024-11-28 03:36:31,540 INFO L349 Elim1Store]: treesize reduction 65, result has 33.0 percent of original size [2024-11-28 03:36:31,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 56 [2024-11-28 03:36:31,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 25 [2024-11-28 03:36:31,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 29 [2024-11-28 03:36:32,049 INFO L349 Elim1Store]: treesize reduction 91, result has 21.6 percent of original size [2024-11-28 03:36:32,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 75 [2024-11-28 03:36:32,187 INFO L349 Elim1Store]: treesize reduction 128, result has 17.4 percent of original size [2024-11-28 03:36:32,188 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 187 treesize of output 145 [2024-11-28 03:36:32,373 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:32,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 146 treesize of output 90 [2024-11-28 03:36:32,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 50 [2024-11-28 03:36:32,491 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2024-11-28 03:36:32,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 56 treesize of output 20 [2024-11-28 03:36:32,496 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:36:32,496 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-28 03:36:32,638 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3058 (Array Int Int))) (= (select |c_#valid| (let ((.cse0 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_3058) (select (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|) .cse0)) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse0) 4)))) 1)) is different from false [2024-11-28 03:36:36,963 INFO L349 Elim1Store]: treesize reduction 5, result has 92.3 percent of original size [2024-11-28 03:36:36,964 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 69 treesize of output 68 [2024-11-28 03:36:36,973 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_3055 (Array Int Int)) (v_ArrVal_3058 (Array Int Int)) (|ULTIMATE.start_list_add_~list#1.offset| Int)) (= (let ((.cse3 (+ |c_~#slot~0.offset| (* |c_ULTIMATE.start_main_~j~0#1| 4)))) (select (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_~#slot~0.base|))) (select (store (let ((.cse0 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_list_add_~node#1.base| v_ArrVal_3055)) (.cse1 (select .cse2 (+ |c_~#slot~0.offset| (* 4 |c_ULTIMATE.start_main_~k~0#1|))))) (store .cse0 .cse1 (store (select .cse0 .cse1) (+ |ULTIMATE.start_list_add_~list#1.offset| 4) |c_ULTIMATE.start_main_~p~1#1.base|))) |c_ULTIMATE.start_main_~p~1#1.base| v_ArrVal_3058) (select .cse2 .cse3))) (+ (select (select |c_#memory_$Pointer$#1.offset| |c_~#slot~0.base|) .cse3) 4))) |c_ULTIMATE.start_list_add_~node#1.base|)) is different from false [2024-11-28 03:36:36,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:36,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 71 [2024-11-28 03:36:37,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:37,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 7256 treesize of output 6810 [2024-11-28 03:36:37,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 746 treesize of output 698 [2024-11-28 03:36:37,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 698 treesize of output 602 [2024-11-28 03:36:37,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:37,257 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-28 03:36:37,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-28 03:36:37,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 728 treesize of output 676 [2024-11-28 03:36:38,764 INFO L349 Elim1Store]: treesize reduction 5, result has 78.3 percent of original size [2024-11-28 03:36:38,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 182 treesize of output 164 [2024-11-28 03:36:38,828 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 58 trivial. 0 not checked. [2024-11-28 03:36:38,828 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1109533702] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-28 03:36:38,828 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-28 03:36:38,828 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 19, 19] total 60 [2024-11-28 03:36:38,829 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969178632] [2024-11-28 03:36:38,829 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-28 03:36:38,829 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2024-11-28 03:36:38,830 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-28 03:36:38,830 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2024-11-28 03:36:38,831 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=305, Invalid=3103, Unknown=22, NotChecked=230, Total=3660 [2024-11-28 03:36:39,779 INFO L469 CegarLoopForPetriNet]: Number of universal loopers: 7 out of 128 [2024-11-28 03:36:39,780 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 126 places, 93 transitions, 434 flow. Second operand has 61 states, 61 states have (on average 8.639344262295081) internal successors, (527), 61 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:39,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-28 03:36:39,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 7 of 128 [2024-11-28 03:36:39,780 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-28 03:36:44,194 INFO L124 PetriNetUnfolderBase]: 208/516 cut-off events. [2024-11-28 03:36:44,194 INFO L125 PetriNetUnfolderBase]: For 420/422 co-relation queries the response was YES. [2024-11-28 03:36:44,195 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 516 events. 208/516 cut-off events. For 420/422 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 2231 event pairs, 26 based on Foata normal form. 15/477 useless extension candidates. Maximal degree in co-relation 1340. Up to 183 conditions per place. [2024-11-28 03:36:44,197 INFO L140 encePairwiseOnDemand]: 101/128 looper letters, 97 selfloop transitions, 37 changer transitions 3/141 dead transitions. [2024-11-28 03:36:44,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 141 transitions, 796 flow [2024-11-28 03:36:44,198 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-28 03:36:44,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2024-11-28 03:36:44,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 312 transitions. [2024-11-28 03:36:44,201 INFO L514 CegarLoopForPetriNet]: DFA transition density 0.09027777777777778 [2024-11-28 03:36:44,201 INFO L175 Difference]: Start difference. First operand has 126 places, 93 transitions, 434 flow. Second operand 27 states and 312 transitions. [2024-11-28 03:36:44,201 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 141 transitions, 796 flow [2024-11-28 03:36:44,204 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 134 places, 141 transitions, 757 flow, removed 2 selfloop flow, removed 17 redundant places. [2024-11-28 03:36:44,206 INFO L231 Difference]: Finished difference. Result has 134 places, 89 transitions, 444 flow [2024-11-28 03:36:44,206 INFO L262 CegarLoopForPetriNet]: {PETRI_ALPHABET=128, PETRI_DIFFERENCE_MINUEND_FLOW=370, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=37, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=27, PETRI_FLOW=444, PETRI_PLACES=134, PETRI_TRANSITIONS=89} [2024-11-28 03:36:44,207 INFO L279 CegarLoopForPetriNet]: 130 programPoint places, 4 predicate places. [2024-11-28 03:36:44,207 INFO L471 AbstractCegarLoop]: Abstraction has has 134 places, 89 transitions, 444 flow [2024-11-28 03:36:44,208 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 8.639344262295081) internal successors, (527), 61 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-28 03:36:44,208 INFO L198 CegarLoopForPetriNet]: Found error trace [2024-11-28 03:36:44,208 INFO L206 CegarLoopForPetriNet]: trace histogram [10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:44,225 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-28 03:36:44,412 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-28 03:36:44,412 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 85 more)] === [2024-11-28 03:36:44,413 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-28 03:36:44,413 INFO L85 PathProgramCache]: Analyzing trace with hash 14789390, now seen corresponding path program 1 times [2024-11-28 03:36:44,413 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-28 03:36:44,413 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1403883993] [2024-11-28 03:36:44,413 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-28 03:36:44,413 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-28 03:36:44,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:36:44,937 INFO L357 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-28 03:36:45,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-28 03:36:45,252 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-28 03:36:45,255 INFO L340 BasicCegarLoop]: Counterexample is feasible [2024-11-28 03:36:45,257 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (87 of 88 remaining) [2024-11-28 03:36:45,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (86 of 88 remaining) [2024-11-28 03:36:45,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (85 of 88 remaining) [2024-11-28 03:36:45,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (84 of 88 remaining) [2024-11-28 03:36:45,260 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (83 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (82 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (81 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (80 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (79 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (78 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (77 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (76 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (75 of 88 remaining) [2024-11-28 03:36:45,261 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (74 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (73 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (72 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (71 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (70 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (69 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (68 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (67 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (66 of 88 remaining) [2024-11-28 03:36:45,262 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (65 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (64 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (63 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE (62 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE (61 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATIONMEMORY_DEREFERENCE (60 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE (59 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE (58 of 88 remaining) [2024-11-28 03:36:45,263 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE (57 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE (56 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE (55 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATIONMEMORY_DEREFERENCE (54 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE (53 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE (52 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE (51 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE (50 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE (49 of 88 remaining) [2024-11-28 03:36:45,264 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE (48 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE (47 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE (46 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATIONMEMORY_DEREFERENCE (45 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATIONMEMORY_DEREFERENCE (44 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATIONMEMORY_DEREFERENCE (43 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE (42 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATIONMEMORY_DEREFERENCE (41 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE (40 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE (39 of 88 remaining) [2024-11-28 03:36:45,265 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE (38 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE (37 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE (36 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATIONMEMORY_DEREFERENCE (35 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE (34 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE (33 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE (32 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE (31 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE (30 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE (29 of 88 remaining) [2024-11-28 03:36:45,266 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATIONMEMORY_DEREFERENCE (28 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATIONMEMORY_DEREFERENCE (27 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE (26 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE (25 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_LEAK (24 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (23 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 88 remaining) [2024-11-28 03:36:45,267 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 88 remaining) [2024-11-28 03:36:45,268 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location t_funErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (0 of 88 remaining) [2024-11-28 03:36:45,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-11-28 03:36:45,269 INFO L422 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-28 03:36:45,373 INFO L241 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2024-11-28 03:36:45,377 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-28 03:36:45,385 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:36:45 BasicIcfg [2024-11-28 03:36:45,385 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-28 03:36:45,386 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-28 03:36:45,386 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-28 03:36:45,386 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-28 03:36:45,387 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:34:10" (3/4) ... [2024-11-28 03:36:45,389 INFO L140 WitnessPrinter]: Generating witness for reachability counterexample [2024-11-28 03:36:45,560 INFO L129 tionWitnessGenerator]: Generated YAML witness of length 42. [2024-11-28 03:36:45,679 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/witness.graphml [2024-11-28 03:36:45,683 INFO L149 WitnessManager]: Wrote witness to /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/witness.yml [2024-11-28 03:36:45,683 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-28 03:36:45,684 INFO L158 Benchmark]: Toolchain (without parser) took 158023.44ms. Allocated memory was 142.6MB in the beginning and 318.8MB in the end (delta: 176.2MB). Free memory was 97.9MB in the beginning and 112.0MB in the end (delta: -14.2MB). Peak memory consumption was 163.5MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,688 INFO L158 Benchmark]: CDTParser took 0.30ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:36:45,688 INFO L158 Benchmark]: CACSL2BoogieTranslator took 1059.10ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 57.0MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,689 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.41ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 53.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-28 03:36:45,689 INFO L158 Benchmark]: Boogie Preprocessor took 103.75ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 49.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,689 INFO L158 Benchmark]: RCFGBuilder took 1653.60ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 49.3MB in the beginning and 318.5MB in the end (delta: -269.2MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,691 INFO L158 Benchmark]: TraceAbstraction took 154842.36ms. Allocated memory was 360.7MB in the beginning and 318.8MB in the end (delta: -41.9MB). Free memory was 318.5MB in the beginning and 123.9MB in the end (delta: 194.6MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,691 INFO L158 Benchmark]: Witness Printer took 297.56ms. Allocated memory is still 318.8MB. Free memory was 123.9MB in the beginning and 112.0MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-28 03:36:45,693 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.30ms. Allocated memory is still 167.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 1059.10ms. Allocated memory is still 142.6MB. Free memory was 97.5MB in the beginning and 57.0MB in the end (delta: 40.6MB). Peak memory consumption was 41.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.41ms. Allocated memory is still 142.6MB. Free memory was 57.0MB in the beginning and 53.5MB in the end (delta: 3.5MB). There was no memory consumed. Max. memory is 16.1GB. * Boogie Preprocessor took 103.75ms. Allocated memory is still 142.6MB. Free memory was 53.5MB in the beginning and 49.6MB in the end (delta: 3.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1653.60ms. Allocated memory was 142.6MB in the beginning and 360.7MB in the end (delta: 218.1MB). Free memory was 49.3MB in the beginning and 318.5MB in the end (delta: -269.2MB). Peak memory consumption was 32.6MB. Max. memory is 16.1GB. * TraceAbstraction took 154842.36ms. Allocated memory was 360.7MB in the beginning and 318.8MB in the end (delta: -41.9MB). Free memory was 318.5MB in the beginning and 123.9MB in the end (delta: 194.6MB). Peak memory consumption was 148.2MB. Max. memory is 16.1GB. * Witness Printer took 297.56ms. Allocated memory is still 318.8MB. Free memory was 123.9MB in the beginning and 112.0MB in the end (delta: 11.9MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: -1]: pointer dereference may fail pointer dereference may fail We found a FailurePath: [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1243] 0 pthread_mutex_t mutex[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1244] 0 struct s *slot[10]; [L1254] 0 int i = 0; VAL [i=0, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=1, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=2, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=3, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=4, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=5, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=6, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=7, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=8, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=9, mutex={1:0}, slot={2:0}] [L1254] COND TRUE 0 i < 10 [L1254] 0 i++ VAL [i=10, mutex={1:0}, slot={2:0}] [L1254] COND FALSE 0 !(i < 10) [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1256] 0 int j = __VERIFIER_nondet_int(), k = __VERIFIER_nondet_int(); [L1257] CALL 0 assume_abort_if_not(0 <= j && j < 10) [L11] COND FALSE 0 !(!cond) [L1257] RET 0 assume_abort_if_not(0 <= j && j < 10) [L1258] CALL 0 assume_abort_if_not(0 <= k && k < 10) [L11] COND FALSE 0 !(!cond) [L1258] RET 0 assume_abort_if_not(0 <= k && k < 10) [L1259] 0 struct s *p; [L1260] 0 pthread_t t1; [L1261] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1261] RET, EXPR 0 new(1) [L1261] 0 slot[j] = new(1) [L1262] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1262] RET, EXPR 0 new(2) [L1262] EXPR 0 slot[j] [L1262] 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 VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1262] RET 0 list_add(new(2), slot[j]) [L1263] CALL, EXPR 0 new(1) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1263] RET, EXPR 0 new(1) [L1263] 0 slot[k] = new(1) [L1264] CALL, EXPR 0 new(2) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1264] RET, EXPR 0 new(2) [L1264] EXPR 0 slot[k] [L1264] CALL 0 list_add(new(2), slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1264] RET 0 list_add(new(2), slot[k]) [L1265] CALL, EXPR 0 new(3) [L1233] 0 struct s *p = malloc(sizeof(struct s)); [L1234] 0 p->datum = x VAL [mutex={1:0}, slot={2:0}] [L1235] 0 p->next = ((void *)0) [L1236] 0 return p; [L1265] RET, EXPR 0 new(3) [L1265] 0 p = new(3) [L1266] EXPR 0 slot[j] [L1266] CALL 0 list_add(p, slot[j]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1266] RET 0 list_add(p, slot[j]) [L1267] EXPR 0 slot[k] [L1267] CALL 0 list_add(p, slot[k]) [L1239] EXPR 0 list->next [L1239] 0 struct s *temp = list->next; [L1240] 0 list->next = node VAL [mutex={1:0}, slot={2:0}] [L1241] 0 node->next = temp [L1267] RET 0 list_add(p, slot[k]) [L1268] FCALL, FORK 0 pthread_create(&t1, ((void *)0), t_fun, ((void *)0)) VAL [j=9, k=9, mutex={1:0}, p={-6:0}, slot={2:0}, t1=-1] [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(arg)={0:0}, arg={0:0}, i=0, mutex={1:0}, slot={2:0}] [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: -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: -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: 1268]: 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, 153 locations, 88 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: 154.6s, OverallIterations: 27, TraceHistogramMax: 10, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 108.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 51 mSolverCounterUnknown, 10829 SdHoareTripleChecker+Valid, 97.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 8389 mSDsluCounter, 4623 SdHoareTripleChecker+Invalid, 93.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 812 IncrementalHoareTripleChecker+Unchecked, 4111 mSDsCounter, 742 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 37571 IncrementalHoareTripleChecker+Invalid, 39176 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 742 mSolverCounterUnsat, 512 mSDtfsCounter, 37571 mSolverCounterSat, 0.3s SdHoareTripleChecker+Time, 51 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 629 GetRequests, 283 SyntacticMatches, 4 SemanticMatches, 342 ConstructedPredicates, 5 IntricatePredicates, 1 DeprecatedPredicates, 4683 ImplicationChecksByTransitivity, 22.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=444occurred in iteration=26, InterpolantAutomatonStates: 203, 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.4s SsaConstructionTime, 2.5s SatisfiabilityAnalysisTime, 39.9s InterpolantComputationTime, 966 NumberOfCodeBlocks, 952 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1066 ConstructedInterpolants, 91 QuantifiedInterpolants, 20133 SizeOfPredicates, 138 NumberOfNonLiveVariables, 3712 ConjunctsInSsa, 383 ConjunctsInUnsatCore, 38 InterpolantComputations, 20 PerfectInterpolantSequences, 1872/1953 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, ConComCheckerStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2024-11-28 03:36:45,850 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2f07592f-5976-4a79-a273-d41ad31a5b7a/bin/uautomizer-verify-aQ6SnzHsRB/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(valid-deref)