./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya --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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 01:35:29,747 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 01:35:29,813 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 01:35:29,817 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 01:35:29,818 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 01:35:29,842 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 01:35:29,843 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 01:35:29,844 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 01:35:29,844 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 01:35:29,845 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 01:35:29,845 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 01:35:29,846 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 01:35:29,847 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 01:35:29,847 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 01:35:29,848 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 01:35:29,848 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 01:35:29,849 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 01:35:29,849 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 01:35:29,850 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 01:35:29,850 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 01:35:29,851 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 01:35:29,855 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 01:35:29,856 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 01:35:29,856 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 01:35:29,856 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 01:35:29,857 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 01:35:29,857 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 01:35:29,857 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 01:35:29,858 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 01:35:29,858 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 01:35:29,859 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 01:35:29,859 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 01:35:29,859 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:29,859 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 01:35:29,860 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 01:35:29,860 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 01:35:29,860 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 01:35:29,860 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 01:35:29,860 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 01:35:29,861 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 01:35:29,861 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 01:35:29,861 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2023-11-29 01:35:30,103 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 01:35:30,123 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 01:35:30,126 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 01:35:30,127 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 01:35:30,127 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 01:35:30,128 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-29 01:35:32,865 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 01:35:33,116 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 01:35:33,117 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-29 01:35:33,134 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/data/ce3f405a3/1619c141ac594f45a58e6ba6e72f380d/FLAG99ed0e55b [2023-11-29 01:35:33,149 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/data/ce3f405a3/1619c141ac594f45a58e6ba6e72f380d [2023-11-29 01:35:33,151 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 01:35:33,153 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 01:35:33,154 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:33,154 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 01:35:33,160 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 01:35:33,160 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,161 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7dd3ef6a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33, skipping insertion in model container [2023-11-29 01:35:33,161 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,214 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 01:35:33,614 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:33,627 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 01:35:33,684 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 01:35:33,751 INFO L206 MainTranslator]: Completed translation [2023-11-29 01:35:33,751 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33 WrapperNode [2023-11-29 01:35:33,752 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 01:35:33,753 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:33,753 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 01:35:33,753 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 01:35:33,761 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,779 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,811 INFO L138 Inliner]: procedures = 275, calls = 61, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 214 [2023-11-29 01:35:33,812 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 01:35:33,812 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 01:35:33,813 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 01:35:33,813 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 01:35:33,825 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,825 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,831 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,850 INFO L175 MemorySlicer]: Split 38 memory accesses to 6 slices as follows [2, 5, 3, 24, 2, 2]. 63 percent of accesses are in the largest equivalence class. The 7 initializations are split as follows [2, 5, 0, 0, 0, 0]. The 15 writes are split as follows [0, 0, 2, 11, 1, 1]. [2023-11-29 01:35:33,850 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,851 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,864 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,868 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,871 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,874 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,879 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 01:35:33,880 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 01:35:33,880 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 01:35:33,880 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 01:35:33,881 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (1/1) ... [2023-11-29 01:35:33,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 01:35:33,898 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:33,912 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 01:35:33,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 01:35:33,950 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-29 01:35:33,950 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-29 01:35:33,951 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2023-11-29 01:35:33,951 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#4 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#5 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 01:35:33,952 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#5 [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 01:35:33,953 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#5 [2023-11-29 01:35:33,954 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 01:35:33,955 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 01:35:33,956 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 01:35:34,113 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 01:35:34,115 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 01:35:34,565 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 01:35:34,734 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 01:35:34,734 INFO L309 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-29 01:35:34,735 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:34 BoogieIcfgContainer [2023-11-29 01:35:34,735 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 01:35:34,737 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 01:35:34,737 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 01:35:34,740 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 01:35:34,740 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 01:35:33" (1/3) ... [2023-11-29 01:35:34,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219bd25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:34, skipping insertion in model container [2023-11-29 01:35:34,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 01:35:33" (2/3) ... [2023-11-29 01:35:34,741 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@219bd25a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 01:35:34, skipping insertion in model container [2023-11-29 01:35:34,741 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 01:35:34" (3/3) ... [2023-11-29 01:35:34,743 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-29 01:35:34,758 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 01:35:34,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 61 error locations. [2023-11-29 01:35:34,758 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 01:35:34,843 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 01:35:34,874 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 138 places, 142 transitions, 298 flow [2023-11-29 01:35:34,927 INFO L124 PetriNetUnfolderBase]: 11/140 cut-off events. [2023-11-29 01:35:34,928 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 01:35:34,932 INFO L83 FinitePrefix]: Finished finitePrefix Result has 149 conditions, 140 events. 11/140 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 470 event pairs, 0 based on Foata normal form. 0/68 useless extension candidates. Maximal degree in co-relation 105. Up to 3 conditions per place. [2023-11-29 01:35:34,933 INFO L82 GeneralOperation]: Start removeDead. Operand has 138 places, 142 transitions, 298 flow [2023-11-29 01:35:34,939 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 135 places, 139 transitions, 290 flow [2023-11-29 01:35:34,949 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 01:35:34,955 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@53a4d296, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 01:35:34,956 INFO L358 AbstractCegarLoop]: Starting to check reachability of 104 error locations. [2023-11-29 01:35:34,958 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 01:35:34,958 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 01:35:34,958 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 01:35:34,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:34,959 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:35:34,967 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:34,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:34,972 INFO L85 PathProgramCache]: Analyzing trace with hash 18931, now seen corresponding path program 1 times [2023-11-29 01:35:34,980 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:34,980 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008122807] [2023-11-29 01:35:34,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:34,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:35,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:35,281 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:35,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:35,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008122807] [2023-11-29 01:35:35,282 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008122807] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:35,282 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:35,282 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:35,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1817601596] [2023-11-29 01:35:35,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:35,290 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:35,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:35,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:35,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:35,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 01:35:35,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 135 places, 139 transitions, 290 flow. Second operand has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:35,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:35,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 01:35:35,423 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:35,924 INFO L124 PetriNetUnfolderBase]: 1079/2979 cut-off events. [2023-11-29 01:35:35,925 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 01:35:35,933 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4743 conditions, 2979 events. 1079/2979 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23515 event pairs, 831 based on Foata normal form. 66/2136 useless extension candidates. Maximal degree in co-relation 4543. Up to 1708 conditions per place. [2023-11-29 01:35:35,958 INFO L140 encePairwiseOnDemand]: 134/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/127 dead transitions. [2023-11-29 01:35:35,958 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 129 places, 127 transitions, 368 flow [2023-11-29 01:35:35,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:35,962 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:35,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2023-11-29 01:35:35,973 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6971830985915493 [2023-11-29 01:35:35,974 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 297 transitions. [2023-11-29 01:35:35,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 297 transitions. [2023-11-29 01:35:35,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:35,978 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 297 transitions. [2023-11-29 01:35:35,982 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.0) internal successors, (297), 3 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:35,987 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:35,987 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:35,989 INFO L175 Difference]: Start difference. First operand has 135 places, 139 transitions, 290 flow. Second operand 3 states and 297 transitions. [2023-11-29 01:35:35,990 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 129 places, 127 transitions, 368 flow [2023-11-29 01:35:35,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 127 transitions, 360 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:35:35,999 INFO L231 Difference]: Finished difference. Result has 125 places, 127 transitions, 262 flow [2023-11-29 01:35:36,001 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=258, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=127, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=125, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=262, PETRI_PLACES=125, PETRI_TRANSITIONS=127} [2023-11-29 01:35:36,005 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -10 predicate places. [2023-11-29 01:35:36,005 INFO L495 AbstractCegarLoop]: Abstraction has has 125 places, 127 transitions, 262 flow [2023-11-29 01:35:36,005 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 80.66666666666667) internal successors, (242), 3 states have internal predecessors, (242), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,006 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:36,006 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 01:35:36,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 01:35:36,006 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:36,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:36,007 INFO L85 PathProgramCache]: Analyzing trace with hash 18932, now seen corresponding path program 1 times [2023-11-29 01:35:36,007 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:36,007 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371877972] [2023-11-29 01:35:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:36,008 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:36,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:36,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:36,122 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:36,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371877972] [2023-11-29 01:35:36,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371877972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:36,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:36,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:36,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884183227] [2023-11-29 01:35:36,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:36,125 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:36,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:36,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:36,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:36,224 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 82 out of 142 [2023-11-29 01:35:36,225 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 127 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,225 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:36,225 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 82 of 142 [2023-11-29 01:35:36,225 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:36,662 INFO L124 PetriNetUnfolderBase]: 1079/2976 cut-off events. [2023-11-29 01:35:36,663 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2023-11-29 01:35:36,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4704 conditions, 2976 events. 1079/2976 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23481 event pairs, 831 based on Foata normal form. 3/2070 useless extension candidates. Maximal degree in co-relation 4693. Up to 1708 conditions per place. [2023-11-29 01:35:36,688 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/124 dead transitions. [2023-11-29 01:35:36,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 124 places, 124 transitions, 354 flow [2023-11-29 01:35:36,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 298 transitions. [2023-11-29 01:35:36,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6995305164319249 [2023-11-29 01:35:36,691 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 298 transitions. [2023-11-29 01:35:36,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 298 transitions. [2023-11-29 01:35:36,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:36,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 298 transitions. [2023-11-29 01:35:36,693 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 99.33333333333333) internal successors, (298), 3 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,696 INFO L175 Difference]: Start difference. First operand has 125 places, 127 transitions, 262 flow. Second operand 3 states and 298 transitions. [2023-11-29 01:35:36,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 124 places, 124 transitions, 354 flow [2023-11-29 01:35:36,697 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 124 transitions, 350 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:36,700 INFO L231 Difference]: Finished difference. Result has 122 places, 124 transitions, 256 flow [2023-11-29 01:35:36,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=252, PETRI_DIFFERENCE_MINUEND_PLACES=120, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=124, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=256, PETRI_PLACES=122, PETRI_TRANSITIONS=124} [2023-11-29 01:35:36,701 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -13 predicate places. [2023-11-29 01:35:36,701 INFO L495 AbstractCegarLoop]: Abstraction has has 122 places, 124 transitions, 256 flow [2023-11-29 01:35:36,702 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.66666666666667) internal successors, (248), 3 states have internal predecessors, (248), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:36,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:36,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:35:36,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 01:35:36,702 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:36,703 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:36,703 INFO L85 PathProgramCache]: Analyzing trace with hash 564545759, now seen corresponding path program 1 times [2023-11-29 01:35:36,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:36,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795409204] [2023-11-29 01:35:36,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:36,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:36,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:36,776 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:36,776 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:36,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795409204] [2023-11-29 01:35:36,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795409204] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:36,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:36,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:36,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921709725] [2023-11-29 01:35:36,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:36,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:35:36,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:36,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:35:36,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:36,960 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-29 01:35:36,961 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 124 transitions, 256 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) [2023-11-29 01:35:36,961 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:36,961 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-29 01:35:36,961 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:37,415 INFO L124 PetriNetUnfolderBase]: 1079/2974 cut-off events. [2023-11-29 01:35:37,416 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:35:37,421 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4705 conditions, 2974 events. 1079/2974 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23506 event pairs, 831 based on Foata normal form. 0/2068 useless extension candidates. Maximal degree in co-relation 4692. Up to 1707 conditions per place. [2023-11-29 01:35:37,441 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 49 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2023-11-29 01:35:37,441 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 123 places, 122 transitions, 356 flow [2023-11-29 01:35:37,441 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:37,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:35:37,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2023-11-29 01:35:37,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6373239436619719 [2023-11-29 01:35:37,444 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 362 transitions. [2023-11-29 01:35:37,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 362 transitions. [2023-11-29 01:35:37,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:37,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 362 transitions. [2023-11-29 01:35:37,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 90.5) internal successors, (362), 4 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:37,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:37,448 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:37,448 INFO L175 Difference]: Start difference. First operand has 122 places, 124 transitions, 256 flow. Second operand 4 states and 362 transitions. [2023-11-29 01:35:37,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 123 places, 122 transitions, 356 flow [2023-11-29 01:35:37,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 121 places, 122 transitions, 352 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:37,452 INFO L231 Difference]: Finished difference. Result has 121 places, 122 transitions, 254 flow [2023-11-29 01:35:37,453 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=119, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=254, PETRI_PLACES=121, PETRI_TRANSITIONS=122} [2023-11-29 01:35:37,453 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -14 predicate places. [2023-11-29 01:35:37,454 INFO L495 AbstractCegarLoop]: Abstraction has has 121 places, 122 transitions, 254 flow [2023-11-29 01:35:37,454 INFO L496 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) [2023-11-29 01:35:37,454 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:37,454 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 01:35:37,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 01:35:37,455 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:37,455 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:37,455 INFO L85 PathProgramCache]: Analyzing trace with hash 564545760, now seen corresponding path program 1 times [2023-11-29 01:35:37,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:37,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [220212808] [2023-11-29 01:35:37,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:37,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:37,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:37,580 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:37,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:37,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [220212808] [2023-11-29 01:35:37,581 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [220212808] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:37,581 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:37,581 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:37,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582383803] [2023-11-29 01:35:37,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:37,582 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:37,582 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:37,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:37,583 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:37,710 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-29 01:35:37,710 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 122 transitions, 254 flow. Second operand has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:37,711 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:37,711 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-29 01:35:37,711 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:38,007 INFO L124 PetriNetUnfolderBase]: 1079/2972 cut-off events. [2023-11-29 01:35:38,008 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 01:35:38,012 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4701 conditions, 2972 events. 1079/2972 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 23499 event pairs, 831 based on Foata normal form. 2/2068 useless extension candidates. Maximal degree in co-relation 4686. Up to 1707 conditions per place. [2023-11-29 01:35:38,029 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 46 selfloop transitions, 3 changer transitions 0/120 dead transitions. [2023-11-29 01:35:38,030 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 120 transitions, 348 flow [2023-11-29 01:35:38,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 01:35:38,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 01:35:38,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 383 transitions. [2023-11-29 01:35:38,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6742957746478874 [2023-11-29 01:35:38,032 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 383 transitions. [2023-11-29 01:35:38,032 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 383 transitions. [2023-11-29 01:35:38,032 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:38,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 383 transitions. [2023-11-29 01:35:38,033 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 95.75) internal successors, (383), 4 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,036 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 142.0) internal successors, (710), 5 states have internal predecessors, (710), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,036 INFO L175 Difference]: Start difference. First operand has 121 places, 122 transitions, 254 flow. Second operand 4 states and 383 transitions. [2023-11-29 01:35:38,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 120 transitions, 348 flow [2023-11-29 01:35:38,037 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 119 places, 120 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:35:38,038 INFO L231 Difference]: Finished difference. Result has 119 places, 120 transitions, 250 flow [2023-11-29 01:35:38,039 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=116, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=117, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=250, PETRI_PLACES=119, PETRI_TRANSITIONS=120} [2023-11-29 01:35:38,039 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -16 predicate places. [2023-11-29 01:35:38,040 INFO L495 AbstractCegarLoop]: Abstraction has has 119 places, 120 transitions, 250 flow [2023-11-29 01:35:38,040 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 83.75) internal successors, (335), 4 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,040 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:38,040 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:38,041 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 01:35:38,041 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:38,041 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:38,041 INFO L85 PathProgramCache]: Analyzing trace with hash -495210249, now seen corresponding path program 1 times [2023-11-29 01:35:38,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:38,042 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913551427] [2023-11-29 01:35:38,042 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:38,042 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:38,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:38,115 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:38,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:38,116 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913551427] [2023-11-29 01:35:38,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913551427] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:38,117 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:38,117 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:38,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1790541510] [2023-11-29 01:35:38,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:38,118 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:38,118 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:38,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:38,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:38,190 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-29 01:35:38,191 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 119 places, 120 transitions, 250 flow. Second operand has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,191 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:38,191 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-29 01:35:38,191 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:38,589 INFO L124 PetriNetUnfolderBase]: 1736/4461 cut-off events. [2023-11-29 01:35:38,589 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-29 01:35:38,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7136 conditions, 4461 events. 1736/4461 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 37053 event pairs, 1369 based on Foata normal form. 0/3158 useless extension candidates. Maximal degree in co-relation 7121. Up to 2653 conditions per place. [2023-11-29 01:35:38,619 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/118 dead transitions. [2023-11-29 01:35:38,619 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 118 transitions, 348 flow [2023-11-29 01:35:38,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:38,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:38,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-29 01:35:38,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-29 01:35:38,621 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-29 01:35:38,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-29 01:35:38,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:38,622 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-29 01:35:38,623 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,624 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,625 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,625 INFO L175 Difference]: Start difference. First operand has 119 places, 120 transitions, 250 flow. Second operand 3 states and 296 transitions. [2023-11-29 01:35:38,625 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 118 transitions, 348 flow [2023-11-29 01:35:38,626 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 116 places, 118 transitions, 342 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:35:38,628 INFO L231 Difference]: Finished difference. Result has 116 places, 118 transitions, 244 flow [2023-11-29 01:35:38,629 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=114, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=118, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=116, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=116, PETRI_TRANSITIONS=118} [2023-11-29 01:35:38,629 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -19 predicate places. [2023-11-29 01:35:38,629 INFO L495 AbstractCegarLoop]: Abstraction has has 116 places, 118 transitions, 244 flow [2023-11-29 01:35:38,630 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.0) internal successors, (249), 3 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,630 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:38,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:38,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 01:35:38,631 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:38,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:38,631 INFO L85 PathProgramCache]: Analyzing trace with hash -495210248, now seen corresponding path program 1 times [2023-11-29 01:35:38,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:38,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [170843469] [2023-11-29 01:35:38,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:38,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:38,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:38,734 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:38,735 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:38,735 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [170843469] [2023-11-29 01:35:38,735 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [170843469] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:38,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:38,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:38,736 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975140155] [2023-11-29 01:35:38,736 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:38,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:38,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:38,737 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:38,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:38,819 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-29 01:35:38,820 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 116 places, 118 transitions, 244 flow. Second operand has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:38,820 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:38,820 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-29 01:35:38,820 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:39,141 INFO L124 PetriNetUnfolderBase]: 1079/2960 cut-off events. [2023-11-29 01:35:39,142 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:35:39,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 2960 events. 1079/2960 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 23357 event pairs, 831 based on Foata normal form. 289/2355 useless extension candidates. Maximal degree in co-relation 4678. Up to 1707 conditions per place. [2023-11-29 01:35:39,159 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/116 dead transitions. [2023-11-29 01:35:39,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 116 transitions, 338 flow [2023-11-29 01:35:39,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:39,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:39,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-11-29 01:35:39,161 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704225352112676 [2023-11-29 01:35:39,161 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-11-29 01:35:39,161 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-11-29 01:35:39,162 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:39,162 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-11-29 01:35:39,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,164 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,165 INFO L175 Difference]: Start difference. First operand has 116 places, 118 transitions, 244 flow. Second operand 3 states and 300 transitions. [2023-11-29 01:35:39,165 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 116 transitions, 338 flow [2023-11-29 01:35:39,166 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 116 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:39,168 INFO L231 Difference]: Finished difference. Result has 114 places, 116 transitions, 240 flow [2023-11-29 01:35:39,168 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=116, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=114, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=240, PETRI_PLACES=114, PETRI_TRANSITIONS=116} [2023-11-29 01:35:39,169 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -21 predicate places. [2023-11-29 01:35:39,169 INFO L495 AbstractCegarLoop]: Abstraction has has 114 places, 116 transitions, 240 flow [2023-11-29 01:35:39,169 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.0) internal successors, (255), 3 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,169 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:39,170 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:39,170 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 01:35:39,170 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:39,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:39,170 INFO L85 PathProgramCache]: Analyzing trace with hash 404867781, now seen corresponding path program 1 times [2023-11-29 01:35:39,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:39,171 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208863374] [2023-11-29 01:35:39,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:39,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:39,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:39,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:39,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:39,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208863374] [2023-11-29 01:35:39,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208863374] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:39,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:39,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:39,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716331091] [2023-11-29 01:35:39,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:39,228 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:39,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:39,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:39,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:39,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 81 out of 142 [2023-11-29 01:35:39,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 116 transitions, 240 flow. Second operand has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,301 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:39,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 81 of 142 [2023-11-29 01:35:39,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:39,599 INFO L124 PetriNetUnfolderBase]: 1120/3057 cut-off events. [2023-11-29 01:35:39,599 INFO L125 PetriNetUnfolderBase]: For 14/14 co-relation queries the response was YES. [2023-11-29 01:35:39,604 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4862 conditions, 3057 events. 1120/3057 cut-off events. For 14/14 co-relation queries the response was YES. Maximal size of possible extension queue 149. Compared 24191 event pairs, 865 based on Foata normal form. 0/2152 useless extension candidates. Maximal degree in co-relation 4852. Up to 1783 conditions per place. [2023-11-29 01:35:39,617 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 49 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-29 01:35:39,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 338 flow [2023-11-29 01:35:39,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:39,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:39,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 296 transitions. [2023-11-29 01:35:39,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6948356807511737 [2023-11-29 01:35:39,619 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 296 transitions. [2023-11-29 01:35:39,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 296 transitions. [2023-11-29 01:35:39,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:39,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 296 transitions. [2023-11-29 01:35:39,621 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.66666666666667) internal successors, (296), 3 states have internal predecessors, (296), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,622 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,623 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,623 INFO L175 Difference]: Start difference. First operand has 114 places, 116 transitions, 240 flow. Second operand 3 states and 296 transitions. [2023-11-29 01:35:39,623 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 338 flow [2023-11-29 01:35:39,624 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 334 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:39,626 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2023-11-29 01:35:39,626 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=232, PETRI_DIFFERENCE_MINUEND_PLACES=110, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=112, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=236, PETRI_PLACES=112, PETRI_TRANSITIONS=114} [2023-11-29 01:35:39,627 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -23 predicate places. [2023-11-29 01:35:39,627 INFO L495 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2023-11-29 01:35:39,628 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 83.66666666666667) internal successors, (251), 3 states have internal predecessors, (251), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,628 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:39,628 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:39,628 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 01:35:39,628 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:39,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:39,629 INFO L85 PathProgramCache]: Analyzing trace with hash 404867782, now seen corresponding path program 1 times [2023-11-29 01:35:39,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:39,629 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [664882741] [2023-11-29 01:35:39,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:39,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:39,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:39,714 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:39,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:39,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [664882741] [2023-11-29 01:35:39,715 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [664882741] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:39,715 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:39,715 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 01:35:39,715 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359795524] [2023-11-29 01:35:39,715 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:39,716 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:39,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:39,716 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:39,716 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:39,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 83 out of 142 [2023-11-29 01:35:39,803 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:39,804 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:39,804 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 83 of 142 [2023-11-29 01:35:39,804 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:40,095 INFO L124 PetriNetUnfolderBase]: 1079/2938 cut-off events. [2023-11-29 01:35:40,095 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:35:40,100 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4666 conditions, 2938 events. 1079/2938 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 146. Compared 23063 event pairs, 831 based on Foata normal form. 31/2097 useless extension candidates. Maximal degree in co-relation 4656. Up to 1707 conditions per place. [2023-11-29 01:35:40,112 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 47 selfloop transitions, 2 changer transitions 0/112 dead transitions. [2023-11-29 01:35:40,113 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 112 transitions, 330 flow [2023-11-29 01:35:40,113 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:40,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:40,114 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 300 transitions. [2023-11-29 01:35:40,114 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704225352112676 [2023-11-29 01:35:40,114 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 300 transitions. [2023-11-29 01:35:40,115 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 300 transitions. [2023-11-29 01:35:40,115 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:40,115 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 300 transitions. [2023-11-29 01:35:40,116 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 100.0) internal successors, (300), 3 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:40,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:40,118 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:40,118 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 300 transitions. [2023-11-29 01:35:40,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 112 transitions, 330 flow [2023-11-29 01:35:40,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 110 places, 112 transitions, 326 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:40,121 INFO L231 Difference]: Finished difference. Result has 110 places, 112 transitions, 232 flow [2023-11-29 01:35:40,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=228, PETRI_DIFFERENCE_MINUEND_PLACES=108, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=232, PETRI_PLACES=110, PETRI_TRANSITIONS=112} [2023-11-29 01:35:40,122 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2023-11-29 01:35:40,122 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 112 transitions, 232 flow [2023-11-29 01:35:40,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 85.66666666666667) internal successors, (257), 3 states have internal predecessors, (257), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:40,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:40,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:40,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 01:35:40,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:40,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:40,123 INFO L85 PathProgramCache]: Analyzing trace with hash -495378663, now seen corresponding path program 1 times [2023-11-29 01:35:40,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:40,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774693051] [2023-11-29 01:35:40,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:40,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:40,338 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:40,338 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774693051] [2023-11-29 01:35:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774693051] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:40,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:40,339 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:40,339 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971053271] [2023-11-29 01:35:40,339 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:40,339 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:35:40,340 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:40,340 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:35:40,340 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:35:40,667 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 78 out of 142 [2023-11-29 01:35:40,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 112 transitions, 232 flow. Second operand has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:40,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:40,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 78 of 142 [2023-11-29 01:35:40,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:41,090 INFO L124 PetriNetUnfolderBase]: 1078/2725 cut-off events. [2023-11-29 01:35:41,091 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-29 01:35:41,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4450 conditions, 2725 events. 1078/2725 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 117. Compared 20412 event pairs, 434 based on Foata normal form. 126/2213 useless extension candidates. Maximal degree in co-relation 4440. Up to 889 conditions per place. [2023-11-29 01:35:41,106 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 68 selfloop transitions, 5 changer transitions 0/129 dead transitions. [2023-11-29 01:35:41,107 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 129 transitions, 413 flow [2023-11-29 01:35:41,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:35:41,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:35:41,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 548 transitions. [2023-11-29 01:35:41,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6431924882629108 [2023-11-29 01:35:41,110 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 548 transitions. [2023-11-29 01:35:41,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 548 transitions. [2023-11-29 01:35:41,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:41,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 548 transitions. [2023-11-29 01:35:41,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 91.33333333333333) internal successors, (548), 6 states have internal predecessors, (548), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,115 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,116 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,116 INFO L175 Difference]: Start difference. First operand has 110 places, 112 transitions, 232 flow. Second operand 6 states and 548 transitions. [2023-11-29 01:35:41,116 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 129 transitions, 413 flow [2023-11-29 01:35:41,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 129 transitions, 409 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:41,120 INFO L231 Difference]: Finished difference. Result has 106 places, 105 transitions, 224 flow [2023-11-29 01:35:41,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=214, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=105} [2023-11-29 01:35:41,121 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -29 predicate places. [2023-11-29 01:35:41,121 INFO L495 AbstractCegarLoop]: Abstraction has has 106 places, 105 transitions, 224 flow [2023-11-29 01:35:41,122 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.83333333333333) internal successors, (479), 6 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,122 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:41,122 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:41,122 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 01:35:41,122 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:41,123 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:41,123 INFO L85 PathProgramCache]: Analyzing trace with hash -495378664, now seen corresponding path program 1 times [2023-11-29 01:35:41,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:41,123 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031872810] [2023-11-29 01:35:41,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:41,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:41,145 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:41,225 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:41,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:41,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031872810] [2023-11-29 01:35:41,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031872810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:41,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:41,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:41,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1232429145] [2023-11-29 01:35:41,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:41,226 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:35:41,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:41,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:35:41,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:35:41,417 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 69 out of 142 [2023-11-29 01:35:41,418 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 105 transitions, 224 flow. Second operand has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,418 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:41,418 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 69 of 142 [2023-11-29 01:35:41,418 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:41,754 INFO L124 PetriNetUnfolderBase]: 1276/2627 cut-off events. [2023-11-29 01:35:41,754 INFO L125 PetriNetUnfolderBase]: For 55/55 co-relation queries the response was YES. [2023-11-29 01:35:41,756 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4758 conditions, 2627 events. 1276/2627 cut-off events. For 55/55 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 16867 event pairs, 446 based on Foata normal form. 0/2153 useless extension candidates. Maximal degree in co-relation 1978. Up to 1138 conditions per place. [2023-11-29 01:35:41,762 INFO L140 encePairwiseOnDemand]: 129/142 looper letters, 73 selfloop transitions, 5 changer transitions 0/121 dead transitions. [2023-11-29 01:35:41,762 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 121 transitions, 413 flow [2023-11-29 01:35:41,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:35:41,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:35:41,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2023-11-29 01:35:41,764 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6070422535211267 [2023-11-29 01:35:41,765 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 431 transitions. [2023-11-29 01:35:41,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 431 transitions. [2023-11-29 01:35:41,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:41,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 431 transitions. [2023-11-29 01:35:41,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 86.2) internal successors, (431), 5 states have internal predecessors, (431), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,768 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,769 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,769 INFO L175 Difference]: Start difference. First operand has 106 places, 105 transitions, 224 flow. Second operand 5 states and 431 transitions. [2023-11-29 01:35:41,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 121 transitions, 413 flow [2023-11-29 01:35:41,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 121 transitions, 403 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:35:41,772 INFO L231 Difference]: Finished difference. Result has 97 places, 97 transitions, 208 flow [2023-11-29 01:35:41,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=92, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=208, PETRI_PLACES=97, PETRI_TRANSITIONS=97} [2023-11-29 01:35:41,773 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -38 predicate places. [2023-11-29 01:35:41,773 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 97 transitions, 208 flow [2023-11-29 01:35:41,774 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 71.16666666666667) internal successors, (427), 6 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:41,774 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:41,774 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:41,774 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 01:35:41,774 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:41,775 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:41,775 INFO L85 PathProgramCache]: Analyzing trace with hash 1823131262, now seen corresponding path program 1 times [2023-11-29 01:35:41,775 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:41,775 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727233300] [2023-11-29 01:35:41,775 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:41,775 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:41,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:42,159 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:42,159 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:42,159 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727233300] [2023-11-29 01:35:42,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727233300] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:42,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:42,160 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 01:35:42,160 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300587284] [2023-11-29 01:35:42,160 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:42,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 01:35:42,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:42,161 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 01:35:42,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 01:35:42,693 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 142 [2023-11-29 01:35:42,693 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 97 transitions, 208 flow. Second operand has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:42,693 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:42,693 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 142 [2023-11-29 01:35:42,693 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:43,414 INFO L124 PetriNetUnfolderBase]: 2060/4303 cut-off events. [2023-11-29 01:35:43,414 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-29 01:35:43,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7724 conditions, 4303 events. 2060/4303 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 171. Compared 30361 event pairs, 286 based on Foata normal form. 0/3498 useless extension candidates. Maximal degree in co-relation 2867. Up to 2158 conditions per place. [2023-11-29 01:35:43,430 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 133 selfloop transitions, 12 changer transitions 0/188 dead transitions. [2023-11-29 01:35:43,430 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 188 transitions, 689 flow [2023-11-29 01:35:43,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:35:43,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:35:43,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 715 transitions. [2023-11-29 01:35:43,433 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6294014084507042 [2023-11-29 01:35:43,433 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 715 transitions. [2023-11-29 01:35:43,433 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 715 transitions. [2023-11-29 01:35:43,434 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:43,434 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 715 transitions. [2023-11-29 01:35:43,437 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 89.375) internal successors, (715), 8 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:43,439 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:43,439 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:43,440 INFO L175 Difference]: Start difference. First operand has 97 places, 97 transitions, 208 flow. Second operand 8 states and 715 transitions. [2023-11-29 01:35:43,440 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 188 transitions, 689 flow [2023-11-29 01:35:43,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 188 transitions, 675 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 01:35:43,444 INFO L231 Difference]: Finished difference. Result has 104 places, 107 transitions, 274 flow [2023-11-29 01:35:43,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=198, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=88, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=274, PETRI_PLACES=104, PETRI_TRANSITIONS=107} [2023-11-29 01:35:43,444 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-29 01:35:43,444 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 107 transitions, 274 flow [2023-11-29 01:35:43,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 72.625) internal successors, (581), 8 states have internal predecessors, (581), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:43,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:43,445 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:43,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 01:35:43,445 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:43,445 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:43,445 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301932, now seen corresponding path program 1 times [2023-11-29 01:35:43,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:43,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013033649] [2023-11-29 01:35:43,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:43,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:43,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:43,533 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:43,533 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:43,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013033649] [2023-11-29 01:35:43,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013033649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:43,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:43,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 01:35:43,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [569120942] [2023-11-29 01:35:43,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:43,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 01:35:43,534 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:43,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 01:35:43,535 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 01:35:43,734 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-29 01:35:43,734 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 107 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:43,734 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:43,735 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-29 01:35:43,735 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:44,118 INFO L124 PetriNetUnfolderBase]: 1881/4238 cut-off events. [2023-11-29 01:35:44,118 INFO L125 PetriNetUnfolderBase]: For 314/314 co-relation queries the response was YES. [2023-11-29 01:35:44,123 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7860 conditions, 4238 events. 1881/4238 cut-off events. For 314/314 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 31909 event pairs, 1238 based on Foata normal form. 0/3457 useless extension candidates. Maximal degree in co-relation 7461. Up to 2632 conditions per place. [2023-11-29 01:35:44,135 INFO L140 encePairwiseOnDemand]: 135/142 looper letters, 77 selfloop transitions, 5 changer transitions 0/127 dead transitions. [2023-11-29 01:35:44,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 127 transitions, 499 flow [2023-11-29 01:35:44,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:35:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:35:44,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 457 transitions. [2023-11-29 01:35:44,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.643661971830986 [2023-11-29 01:35:44,137 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 457 transitions. [2023-11-29 01:35:44,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 457 transitions. [2023-11-29 01:35:44,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:44,137 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 457 transitions. [2023-11-29 01:35:44,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 91.4) internal successors, (457), 5 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,140 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,140 INFO L175 Difference]: Start difference. First operand has 104 places, 107 transitions, 274 flow. Second operand 5 states and 457 transitions. [2023-11-29 01:35:44,140 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 127 transitions, 499 flow [2023-11-29 01:35:44,144 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 104 places, 127 transitions, 495 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:44,145 INFO L231 Difference]: Finished difference. Result has 104 places, 105 transitions, 276 flow [2023-11-29 01:35:44,145 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=276, PETRI_PLACES=104, PETRI_TRANSITIONS=105} [2023-11-29 01:35:44,146 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -31 predicate places. [2023-11-29 01:35:44,146 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 105 transitions, 276 flow [2023-11-29 01:35:44,147 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 79.5) internal successors, (477), 6 states have internal predecessors, (477), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,147 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:44,147 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:44,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 01:35:44,147 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:44,148 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:44,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1765301933, now seen corresponding path program 1 times [2023-11-29 01:35:44,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:44,148 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [461295815] [2023-11-29 01:35:44,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:44,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:44,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:44,208 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:44,208 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [461295815] [2023-11-29 01:35:44,208 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [461295815] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:44,208 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:44,208 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:44,208 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315598411] [2023-11-29 01:35:44,208 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:44,209 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:44,209 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:44,209 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:44,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:44,211 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 01:35:44,212 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 105 transitions, 276 flow. Second operand has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,212 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:44,212 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 01:35:44,212 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:44,428 INFO L124 PetriNetUnfolderBase]: 693/1675 cut-off events. [2023-11-29 01:35:44,428 INFO L125 PetriNetUnfolderBase]: For 112/112 co-relation queries the response was YES. [2023-11-29 01:35:44,430 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3173 conditions, 1675 events. 693/1675 cut-off events. For 112/112 co-relation queries the response was YES. Maximal size of possible extension queue 76. Compared 10577 event pairs, 447 based on Foata normal form. 43/1501 useless extension candidates. Maximal degree in co-relation 3129. Up to 698 conditions per place. [2023-11-29 01:35:44,435 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 62 selfloop transitions, 3 changer transitions 0/113 dead transitions. [2023-11-29 01:35:44,435 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 113 transitions, 415 flow [2023-11-29 01:35:44,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:44,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 317 transitions. [2023-11-29 01:35:44,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.744131455399061 [2023-11-29 01:35:44,437 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 317 transitions. [2023-11-29 01:35:44,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 317 transitions. [2023-11-29 01:35:44,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:44,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 317 transitions. [2023-11-29 01:35:44,439 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 105.66666666666667) internal successors, (317), 3 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,441 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,441 INFO L175 Difference]: Start difference. First operand has 104 places, 105 transitions, 276 flow. Second operand 3 states and 317 transitions. [2023-11-29 01:35:44,441 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 113 transitions, 415 flow [2023-11-29 01:35:44,444 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 113 transitions, 401 flow, removed 1 selfloop flow, removed 5 redundant places. [2023-11-29 01:35:44,446 INFO L231 Difference]: Finished difference. Result has 101 places, 101 transitions, 255 flow [2023-11-29 01:35:44,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=244, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=101, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=255, PETRI_PLACES=101, PETRI_TRANSITIONS=101} [2023-11-29 01:35:44,447 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -34 predicate places. [2023-11-29 01:35:44,447 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 101 transitions, 255 flow [2023-11-29 01:35:44,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 89.0) internal successors, (267), 3 states have internal predecessors, (267), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,448 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:44,448 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:44,448 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 01:35:44,448 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:44,448 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:44,449 INFO L85 PathProgramCache]: Analyzing trace with hash 893561673, now seen corresponding path program 1 times [2023-11-29 01:35:44,449 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:44,449 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369225036] [2023-11-29 01:35:44,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:44,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:44,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:44,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:44,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:44,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369225036] [2023-11-29 01:35:44,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [369225036] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:44,506 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:44,506 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:44,506 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [447481719] [2023-11-29 01:35:44,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:44,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:35:44,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:44,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:35:44,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:35:44,509 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 01:35:44,510 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 101 transitions, 255 flow. Second operand has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,510 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:44,510 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 01:35:44,510 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:44,711 INFO L124 PetriNetUnfolderBase]: 572/1398 cut-off events. [2023-11-29 01:35:44,711 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2023-11-29 01:35:44,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2689 conditions, 1398 events. 572/1398 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7860 event pairs, 380 based on Foata normal form. 12/1232 useless extension candidates. Maximal degree in co-relation 1719. Up to 763 conditions per place. [2023-11-29 01:35:44,715 INFO L140 encePairwiseOnDemand]: 139/142 looper letters, 64 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2023-11-29 01:35:44,715 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 114 transitions, 411 flow [2023-11-29 01:35:44,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:44,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:44,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 322 transitions. [2023-11-29 01:35:44,717 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.755868544600939 [2023-11-29 01:35:44,717 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 322 transitions. [2023-11-29 01:35:44,717 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 322 transitions. [2023-11-29 01:35:44,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:44,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 322 transitions. [2023-11-29 01:35:44,719 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 107.33333333333333) internal successors, (322), 3 states have internal predecessors, (322), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,720 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,720 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,721 INFO L175 Difference]: Start difference. First operand has 101 places, 101 transitions, 255 flow. Second operand 3 states and 322 transitions. [2023-11-29 01:35:44,721 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 114 transitions, 411 flow [2023-11-29 01:35:44,723 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 101 places, 114 transitions, 403 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 01:35:44,725 INFO L231 Difference]: Finished difference. Result has 102 places, 101 transitions, 254 flow [2023-11-29 01:35:44,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=99, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=254, PETRI_PLACES=102, PETRI_TRANSITIONS=101} [2023-11-29 01:35:44,725 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -33 predicate places. [2023-11-29 01:35:44,726 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 101 transitions, 254 flow [2023-11-29 01:35:44,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 90.33333333333333) internal successors, (271), 3 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:44,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:44,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:44,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 01:35:44,726 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:44,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:44,727 INFO L85 PathProgramCache]: Analyzing trace with hash 1790474274, now seen corresponding path program 1 times [2023-11-29 01:35:44,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:44,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1806080050] [2023-11-29 01:35:44,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:44,727 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:44,750 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:45,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:45,279 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:45,279 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1806080050] [2023-11-29 01:35:45,279 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1806080050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:45,279 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:45,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 01:35:45,280 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983802506] [2023-11-29 01:35:45,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:45,280 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 01:35:45,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:45,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 01:35:45,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2023-11-29 01:35:45,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 01:35:45,595 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 101 transitions, 254 flow. Second operand has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,595 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:45,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 01:35:45,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:45,928 INFO L124 PetriNetUnfolderBase]: 643/1459 cut-off events. [2023-11-29 01:35:45,928 INFO L125 PetriNetUnfolderBase]: For 93/93 co-relation queries the response was YES. [2023-11-29 01:35:45,930 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2904 conditions, 1459 events. 643/1459 cut-off events. For 93/93 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7879 event pairs, 168 based on Foata normal form. 0/1306 useless extension candidates. Maximal degree in co-relation 954. Up to 773 conditions per place. [2023-11-29 01:35:45,935 INFO L140 encePairwiseOnDemand]: 132/142 looper letters, 95 selfloop transitions, 9 changer transitions 0/145 dead transitions. [2023-11-29 01:35:45,936 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 145 transitions, 554 flow [2023-11-29 01:35:45,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 01:35:45,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 01:35:45,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 824 transitions. [2023-11-29 01:35:45,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6447574334898278 [2023-11-29 01:35:45,939 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 824 transitions. [2023-11-29 01:35:45,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 824 transitions. [2023-11-29 01:35:45,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:45,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 824 transitions. [2023-11-29 01:35:45,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 91.55555555555556) internal successors, (824), 9 states have internal predecessors, (824), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,946 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 142.0) internal successors, (1420), 10 states have internal predecessors, (1420), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,946 INFO L175 Difference]: Start difference. First operand has 102 places, 101 transitions, 254 flow. Second operand 9 states and 824 transitions. [2023-11-29 01:35:45,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 145 transitions, 554 flow [2023-11-29 01:35:45,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 145 transitions, 550 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 01:35:45,951 INFO L231 Difference]: Finished difference. Result has 111 places, 102 transitions, 279 flow [2023-11-29 01:35:45,951 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=245, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=91, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=279, PETRI_PLACES=111, PETRI_TRANSITIONS=102} [2023-11-29 01:35:45,952 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -24 predicate places. [2023-11-29 01:35:45,952 INFO L495 AbstractCegarLoop]: Abstraction has has 111 places, 102 transitions, 279 flow [2023-11-29 01:35:45,953 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 82.11111111111111) internal successors, (739), 9 states have internal predecessors, (739), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:45,953 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:45,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:45,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 01:35:45,953 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:45,953 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:45,953 INFO L85 PathProgramCache]: Analyzing trace with hash -328796433, now seen corresponding path program 1 times [2023-11-29 01:35:45,953 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:45,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95877955] [2023-11-29 01:35:45,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:45,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:45,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:46,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:46,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:46,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95877955] [2023-11-29 01:35:46,216 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95877955] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:46,216 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:46,216 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:35:46,216 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971030449] [2023-11-29 01:35:46,216 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:46,217 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 01:35:46,217 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:46,218 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 01:35:46,218 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 01:35:46,460 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 01:35:46,461 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 111 places, 102 transitions, 279 flow. Second operand has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:46,461 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:46,461 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 01:35:46,461 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:46,691 INFO L124 PetriNetUnfolderBase]: 575/1377 cut-off events. [2023-11-29 01:35:46,692 INFO L125 PetriNetUnfolderBase]: For 154/154 co-relation queries the response was YES. [2023-11-29 01:35:46,693 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2819 conditions, 1377 events. 575/1377 cut-off events. For 154/154 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 7578 event pairs, 395 based on Foata normal form. 12/1247 useless extension candidates. Maximal degree in co-relation 1572. Up to 786 conditions per place. [2023-11-29 01:35:46,696 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 62 selfloop transitions, 4 changer transitions 0/113 dead transitions. [2023-11-29 01:35:46,696 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 115 places, 113 transitions, 434 flow [2023-11-29 01:35:46,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 01:35:46,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 01:35:46,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 487 transitions. [2023-11-29 01:35:46,699 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6859154929577465 [2023-11-29 01:35:46,699 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 487 transitions. [2023-11-29 01:35:46,699 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 487 transitions. [2023-11-29 01:35:46,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:46,699 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 487 transitions. [2023-11-29 01:35:46,701 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 97.4) internal successors, (487), 5 states have internal predecessors, (487), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:46,702 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:46,703 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 142.0) internal successors, (852), 6 states have internal predecessors, (852), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:46,703 INFO L175 Difference]: Start difference. First operand has 111 places, 102 transitions, 279 flow. Second operand 5 states and 487 transitions. [2023-11-29 01:35:46,703 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 115 places, 113 transitions, 434 flow [2023-11-29 01:35:46,706 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 113 transitions, 420 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 01:35:46,708 INFO L231 Difference]: Finished difference. Result has 110 places, 102 transitions, 277 flow [2023-11-29 01:35:46,708 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=265, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=102, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=277, PETRI_PLACES=110, PETRI_TRANSITIONS=102} [2023-11-29 01:35:46,709 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -25 predicate places. [2023-11-29 01:35:46,709 INFO L495 AbstractCegarLoop]: Abstraction has has 110 places, 102 transitions, 277 flow [2023-11-29 01:35:46,709 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 87.8) internal successors, (439), 5 states have internal predecessors, (439), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:46,710 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:46,710 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:35:46,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 01:35:46,710 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:46,710 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:46,710 INFO L85 PathProgramCache]: Analyzing trace with hash -328796434, now seen corresponding path program 1 times [2023-11-29 01:35:46,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:46,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1580574687] [2023-11-29 01:35:46,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:46,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:46,890 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:46,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:46,890 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1580574687] [2023-11-29 01:35:46,890 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1580574687] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:35:46,890 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:35:46,891 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:35:46,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266982814] [2023-11-29 01:35:46,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:35:46,891 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 01:35:46,891 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:35:46,892 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 01:35:46,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 01:35:47,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 80 out of 142 [2023-11-29 01:35:47,006 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 110 places, 102 transitions, 277 flow. Second operand has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,007 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:35:47,007 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 80 of 142 [2023-11-29 01:35:47,007 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:35:47,229 INFO L124 PetriNetUnfolderBase]: 901/1966 cut-off events. [2023-11-29 01:35:47,229 INFO L125 PetriNetUnfolderBase]: For 292/292 co-relation queries the response was YES. [2023-11-29 01:35:47,232 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4037 conditions, 1966 events. 901/1966 cut-off events. For 292/292 co-relation queries the response was YES. Maximal size of possible extension queue 64. Compared 11083 event pairs, 837 based on Foata normal form. 34/1816 useless extension candidates. Maximal degree in co-relation 1674. Up to 1532 conditions per place. [2023-11-29 01:35:47,236 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 55 selfloop transitions, 2 changer transitions 0/100 dead transitions. [2023-11-29 01:35:47,236 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 100 transitions, 387 flow [2023-11-29 01:35:47,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:35:47,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:35:47,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 294 transitions. [2023-11-29 01:35:47,238 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6901408450704225 [2023-11-29 01:35:47,238 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 294 transitions. [2023-11-29 01:35:47,238 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 294 transitions. [2023-11-29 01:35:47,238 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:35:47,238 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 294 transitions. [2023-11-29 01:35:47,239 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 98.0) internal successors, (294), 3 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,240 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,240 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,240 INFO L175 Difference]: Start difference. First operand has 110 places, 102 transitions, 277 flow. Second operand 3 states and 294 transitions. [2023-11-29 01:35:47,241 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 100 transitions, 387 flow [2023-11-29 01:35:47,243 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 107 places, 100 transitions, 380 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 01:35:47,245 INFO L231 Difference]: Finished difference. Result has 107 places, 100 transitions, 270 flow [2023-11-29 01:35:47,245 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=270, PETRI_PLACES=107, PETRI_TRANSITIONS=100} [2023-11-29 01:35:47,245 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -28 predicate places. [2023-11-29 01:35:47,245 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 100 transitions, 270 flow [2023-11-29 01:35:47,246 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 84.75) internal successors, (339), 4 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:35:47,246 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:35:47,246 INFO L208 CegarLoopForPetriNet]: trace 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, 1] [2023-11-29 01:35:47,246 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 01:35:47,246 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:35:47,247 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:35:47,247 INFO L85 PathProgramCache]: Analyzing trace with hash 1646577762, now seen corresponding path program 1 times [2023-11-29 01:35:47,247 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:35:47,247 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648665714] [2023-11-29 01:35:47,247 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:47,247 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:35:47,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:48,217 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:48,217 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:35:48,217 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648665714] [2023-11-29 01:35:48,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648665714] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:35:48,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1627737256] [2023-11-29 01:35:48,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:35:48,218 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:35:48,218 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:35:48,219 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:35:48,224 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 01:35:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:35:48,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 282 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-29 01:35:48,389 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:35:48,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:35:48,512 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 19 treesize of output 18 [2023-11-29 01:35:48,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:48,813 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:35:48,814 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 01:35:48,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:35:48,997 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:35:49,113 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:35:49,113 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:18,714 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (forall ((v_ArrVal_339 Int)) (<= 0 (+ |c_~#queue~0.offset| (* 4 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_339) .cse1)) 4))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17| Int)) (or (forall ((v_ArrVal_339 Int)) (<= (+ |c_~#queue~0.offset| (* 4 (select (store .cse0 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)) v_ArrVal_339) .cse1)) 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_17|)))))) is different from false [2023-11-29 01:36:18,966 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:36:18,966 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 113 treesize of output 117 [2023-11-29 01:36:19,136 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:19,167 INFO L349 Elim1Store]: treesize reduction 47, result has 39.7 percent of original size [2023-11-29 01:36:19,167 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 3 case distinctions, treesize of input 89 treesize of output 98 [2023-11-29 01:36:19,177 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-11-29 01:36:19,213 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2023-11-29 01:36:19,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 69 [2023-11-29 01:36:19,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:19,266 INFO L349 Elim1Store]: treesize reduction 57, result has 26.9 percent of original size [2023-11-29 01:36:19,267 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 3 case distinctions, treesize of input 88 treesize of output 87 [2023-11-29 01:36:19,276 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 36 [2023-11-29 01:36:19,281 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:36:19,296 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2023-11-29 01:36:19,296 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 21 [2023-11-29 01:36:19,372 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 01:36:19,373 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1627737256] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:19,373 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:36:19,373 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 11] total 31 [2023-11-29 01:36:19,373 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322484648] [2023-11-29 01:36:19,373 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:19,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2023-11-29 01:36:19,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:19,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2023-11-29 01:36:19,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=842, Unknown=3, NotChecked=60, Total=1056 [2023-11-29 01:36:19,791 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-29 01:36:19,793 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 100 transitions, 270 flow. Second operand has 33 states, 33 states have (on average 30.454545454545453) internal successors, (1005), 33 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:19,793 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:19,793 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-29 01:36:19,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:22,248 INFO L124 PetriNetUnfolderBase]: 2548/4664 cut-off events. [2023-11-29 01:36:22,248 INFO L125 PetriNetUnfolderBase]: For 219/219 co-relation queries the response was YES. [2023-11-29 01:36:22,254 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10015 conditions, 4664 events. 2548/4664 cut-off events. For 219/219 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 26323 event pairs, 429 based on Foata normal form. 36/4349 useless extension candidates. Maximal degree in co-relation 9965. Up to 1645 conditions per place. [2023-11-29 01:36:22,268 INFO L140 encePairwiseOnDemand]: 130/142 looper letters, 250 selfloop transitions, 21 changer transitions 0/287 dead transitions. [2023-11-29 01:36:22,268 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 287 transitions, 1253 flow [2023-11-29 01:36:22,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 01:36:22,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-29 01:36:22,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 720 transitions. [2023-11-29 01:36:22,272 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31690140845070425 [2023-11-29 01:36:22,272 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 720 transitions. [2023-11-29 01:36:22,272 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 720 transitions. [2023-11-29 01:36:22,272 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:22,272 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 720 transitions. [2023-11-29 01:36:22,274 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 45.0) internal successors, (720), 16 states have internal predecessors, (720), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,277 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,277 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 142.0) internal successors, (2414), 17 states have internal predecessors, (2414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,277 INFO L175 Difference]: Start difference. First operand has 107 places, 100 transitions, 270 flow. Second operand 16 states and 720 transitions. [2023-11-29 01:36:22,277 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 287 transitions, 1253 flow [2023-11-29 01:36:22,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 287 transitions, 1243 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:22,284 INFO L231 Difference]: Finished difference. Result has 124 places, 114 transitions, 380 flow [2023-11-29 01:36:22,284 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=266, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=100, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=380, PETRI_PLACES=124, PETRI_TRANSITIONS=114} [2023-11-29 01:36:22,284 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -11 predicate places. [2023-11-29 01:36:22,284 INFO L495 AbstractCegarLoop]: Abstraction has has 124 places, 114 transitions, 380 flow [2023-11-29 01:36:22,285 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 33 states have (on average 30.454545454545453) internal successors, (1005), 33 states have internal predecessors, (1005), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,285 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:22,285 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:22,291 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 01:36:22,485 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-29 01:36:22,486 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:22,486 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:22,486 INFO L85 PathProgramCache]: Analyzing trace with hash -1620089800, now seen corresponding path program 1 times [2023-11-29 01:36:22,486 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:22,487 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1952405021] [2023-11-29 01:36:22,487 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:22,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:22,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:22,598 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:22,598 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:22,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1952405021] [2023-11-29 01:36:22,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1952405021] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:22,599 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:22,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 01:36:22,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749772237] [2023-11-29 01:36:22,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:22,600 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:22,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:22,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:22,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:22,602 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 01:36:22,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 124 places, 114 transitions, 380 flow. Second operand has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,603 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:22,603 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 01:36:22,603 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:22,974 INFO L124 PetriNetUnfolderBase]: 1019/2394 cut-off events. [2023-11-29 01:36:22,974 INFO L125 PetriNetUnfolderBase]: For 490/490 co-relation queries the response was YES. [2023-11-29 01:36:22,980 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5233 conditions, 2394 events. 1019/2394 cut-off events. For 490/490 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 14704 event pairs, 661 based on Foata normal form. 12/2165 useless extension candidates. Maximal degree in co-relation 4070. Up to 1089 conditions per place. [2023-11-29 01:36:22,988 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 75 selfloop transitions, 3 changer transitions 0/125 dead transitions. [2023-11-29 01:36:22,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 125 transitions, 562 flow [2023-11-29 01:36:22,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:22,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:22,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-29 01:36:22,990 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-29 01:36:22,990 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-29 01:36:22,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-29 01:36:22,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:22,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-29 01:36:22,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,993 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:22,993 INFO L175 Difference]: Start difference. First operand has 124 places, 114 transitions, 380 flow. Second operand 3 states and 314 transitions. [2023-11-29 01:36:22,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 125 transitions, 562 flow [2023-11-29 01:36:22,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 125 transitions, 532 flow, removed 9 selfloop flow, removed 6 redundant places. [2023-11-29 01:36:22,999 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 354 flow [2023-11-29 01:36:22,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=110, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=354, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2023-11-29 01:36:23,000 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -15 predicate places. [2023-11-29 01:36:23,000 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 354 flow [2023-11-29 01:36:23,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 91.0) internal successors, (273), 3 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,000 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:23,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 01:36:23,001 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:23,001 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,001 INFO L85 PathProgramCache]: Analyzing trace with hash -1988889243, now seen corresponding path program 1 times [2023-11-29 01:36:23,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [651532763] [2023-11-29 01:36:23,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,002 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:23,080 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:23,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:23,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [651532763] [2023-11-29 01:36:23,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [651532763] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 01:36:23,080 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 01:36:23,080 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 01:36:23,080 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680352409] [2023-11-29 01:36:23,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 01:36:23,081 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 01:36:23,081 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:23,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 01:36:23,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 01:36:23,082 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 01:36:23,082 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 354 flow. Second operand has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,083 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:23,083 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 01:36:23,083 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:23,319 INFO L124 PetriNetUnfolderBase]: 710/1849 cut-off events. [2023-11-29 01:36:23,319 INFO L125 PetriNetUnfolderBase]: For 229/229 co-relation queries the response was YES. [2023-11-29 01:36:23,322 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4019 conditions, 1849 events. 710/1849 cut-off events. For 229/229 co-relation queries the response was YES. Maximal size of possible extension queue 54. Compared 10909 event pairs, 126 based on Foata normal form. 72/1751 useless extension candidates. Maximal degree in co-relation 3100. Up to 1103 conditions per place. [2023-11-29 01:36:23,326 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 70 selfloop transitions, 4 changer transitions 0/121 dead transitions. [2023-11-29 01:36:23,326 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 122 places, 121 transitions, 520 flow [2023-11-29 01:36:23,326 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 01:36:23,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 01:36:23,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 314 transitions. [2023-11-29 01:36:23,327 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7370892018779343 [2023-11-29 01:36:23,328 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 314 transitions. [2023-11-29 01:36:23,328 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 314 transitions. [2023-11-29 01:36:23,328 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:23,328 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 314 transitions. [2023-11-29 01:36:23,329 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 104.66666666666667) internal successors, (314), 3 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,329 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,330 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 142.0) internal successors, (568), 4 states have internal predecessors, (568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,330 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 354 flow. Second operand 3 states and 314 transitions. [2023-11-29 01:36:23,330 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 122 places, 121 transitions, 520 flow [2023-11-29 01:36:23,333 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 120 places, 121 transitions, 514 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 01:36:23,334 INFO L231 Difference]: Finished difference. Result has 120 places, 113 transitions, 356 flow [2023-11-29 01:36:23,334 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=348, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=356, PETRI_PLACES=120, PETRI_TRANSITIONS=113} [2023-11-29 01:36:23,335 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -15 predicate places. [2023-11-29 01:36:23,335 INFO L495 AbstractCegarLoop]: Abstraction has has 120 places, 113 transitions, 356 flow [2023-11-29 01:36:23,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 93.33333333333333) internal successors, (280), 3 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:23,335 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:23,335 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:23,335 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 01:36:23,335 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:23,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:23,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1648931394, now seen corresponding path program 1 times [2023-11-29 01:36:23,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:23,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355146537] [2023-11-29 01:36:23,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:23,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:23,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,189 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:24,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355146537] [2023-11-29 01:36:24,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1355146537] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:36:24,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220921850] [2023-11-29 01:36:24,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:24,190 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:36:24,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:36:24,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:36:24,194 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 01:36:24,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:24,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 326 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 01:36:24,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:24,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:36:24,435 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 19 treesize of output 18 [2023-11-29 01:36:24,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:24,648 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:24,649 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 01:36:24,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:36:24,802 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:36:24,893 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 23 treesize of output 11 [2023-11-29 01:36:24,911 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 23 treesize of output 11 [2023-11-29 01:36:24,941 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:24,941 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:28,206 INFO L349 Elim1Store]: treesize reduction 68, result has 31.3 percent of original size [2023-11-29 01:36:28,207 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 3 case distinctions, treesize of input 186 treesize of output 165 [2023-11-29 01:36:28,220 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:36:28,221 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 130 treesize of output 126 [2023-11-29 01:36:28,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:36:28,263 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:36:28,263 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 134 treesize of output 128 [2023-11-29 01:36:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:28,371 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220921850] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:28,371 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:36:28,371 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 14] total 37 [2023-11-29 01:36:28,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327946410] [2023-11-29 01:36:28,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:28,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 38 states [2023-11-29 01:36:28,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:28,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 38 interpolants. [2023-11-29 01:36:28,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=1163, Unknown=0, NotChecked=0, Total=1406 [2023-11-29 01:36:32,002 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.45s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:36:33,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:36:39,842 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:36:46,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:36:49,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 77 out of 142 [2023-11-29 01:36:49,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 120 places, 113 transitions, 356 flow. Second operand has 38 states, 38 states have (on average 79.34210526315789) internal successors, (3015), 38 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:49,112 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:49,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 77 of 142 [2023-11-29 01:36:49,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:51,326 INFO L124 PetriNetUnfolderBase]: 835/1990 cut-off events. [2023-11-29 01:36:51,326 INFO L125 PetriNetUnfolderBase]: For 240/240 co-relation queries the response was YES. [2023-11-29 01:36:51,329 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4512 conditions, 1990 events. 835/1990 cut-off events. For 240/240 co-relation queries the response was YES. Maximal size of possible extension queue 53. Compared 11062 event pairs, 108 based on Foata normal form. 0/1832 useless extension candidates. Maximal degree in co-relation 3103. Up to 541 conditions per place. [2023-11-29 01:36:51,333 INFO L140 encePairwiseOnDemand]: 127/142 looper letters, 180 selfloop transitions, 30 changer transitions 0/247 dead transitions. [2023-11-29 01:36:51,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 247 transitions, 1117 flow [2023-11-29 01:36:51,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 01:36:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-29 01:36:51,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 1829 transitions. [2023-11-29 01:36:51,339 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.613346747149564 [2023-11-29 01:36:51,339 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 1829 transitions. [2023-11-29 01:36:51,339 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 1829 transitions. [2023-11-29 01:36:51,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:51,340 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 1829 transitions. [2023-11-29 01:36:51,344 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 87.0952380952381) internal successors, (1829), 21 states have internal predecessors, (1829), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:51,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 142.0) internal successors, (3124), 22 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:51,348 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 142.0) internal successors, (3124), 22 states have internal predecessors, (3124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:51,348 INFO L175 Difference]: Start difference. First operand has 120 places, 113 transitions, 356 flow. Second operand 21 states and 1829 transitions. [2023-11-29 01:36:51,348 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 247 transitions, 1117 flow [2023-11-29 01:36:51,351 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 139 places, 247 transitions, 1105 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 01:36:51,353 INFO L231 Difference]: Finished difference. Result has 142 places, 119 transitions, 460 flow [2023-11-29 01:36:51,353 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=352, PETRI_DIFFERENCE_MINUEND_PLACES=119, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=113, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=26, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=460, PETRI_PLACES=142, PETRI_TRANSITIONS=119} [2023-11-29 01:36:51,354 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 7 predicate places. [2023-11-29 01:36:51,354 INFO L495 AbstractCegarLoop]: Abstraction has has 142 places, 119 transitions, 460 flow [2023-11-29 01:36:51,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 38 states, 38 states have (on average 79.34210526315789) internal successors, (3015), 38 states have internal predecessors, (3015), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:51,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:51,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:51,360 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 01:36:51,555 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2023-11-29 01:36:51,555 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:51,556 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:51,556 INFO L85 PathProgramCache]: Analyzing trace with hash -623315496, now seen corresponding path program 1 times [2023-11-29 01:36:51,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:51,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [379023726] [2023-11-29 01:36:51,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:51,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:51,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:51,640 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:51,640 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:51,640 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [379023726] [2023-11-29 01:36:51,640 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [379023726] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:36:51,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [222028386] [2023-11-29 01:36:51,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:51,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:36:51,641 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:36:51,642 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:36:51,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 01:36:51,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:51,806 INFO L262 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 01:36:51,808 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:51,835 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:51,835 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:51,867 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:51,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [222028386] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:51,867 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:36:51,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2023-11-29 01:36:51,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502354893] [2023-11-29 01:36:51,868 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:51,868 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 01:36:51,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:51,869 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 01:36:51,869 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2023-11-29 01:36:51,876 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 85 out of 142 [2023-11-29 01:36:51,877 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 142 places, 119 transitions, 460 flow. Second operand has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:51,877 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:51,877 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 85 of 142 [2023-11-29 01:36:51,877 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:52,231 INFO L124 PetriNetUnfolderBase]: 566/1409 cut-off events. [2023-11-29 01:36:52,232 INFO L125 PetriNetUnfolderBase]: For 476/476 co-relation queries the response was YES. [2023-11-29 01:36:52,235 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3681 conditions, 1409 events. 566/1409 cut-off events. For 476/476 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 6096 event pairs, 161 based on Foata normal form. 30/1356 useless extension candidates. Maximal degree in co-relation 1783. Up to 349 conditions per place. [2023-11-29 01:36:52,240 INFO L140 encePairwiseOnDemand]: 138/142 looper letters, 92 selfloop transitions, 6 changer transitions 0/147 dead transitions. [2023-11-29 01:36:52,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 147 places, 147 transitions, 724 flow [2023-11-29 01:36:52,240 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 01:36:52,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 01:36:52,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 610 transitions. [2023-11-29 01:36:52,242 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.715962441314554 [2023-11-29 01:36:52,242 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 610 transitions. [2023-11-29 01:36:52,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 610 transitions. [2023-11-29 01:36:52,242 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:52,242 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 610 transitions. [2023-11-29 01:36:52,244 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 101.66666666666667) internal successors, (610), 6 states have internal predecessors, (610), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,245 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,245 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 142.0) internal successors, (994), 7 states have internal predecessors, (994), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,245 INFO L175 Difference]: Start difference. First operand has 142 places, 119 transitions, 460 flow. Second operand 6 states and 610 transitions. [2023-11-29 01:36:52,246 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 147 places, 147 transitions, 724 flow [2023-11-29 01:36:52,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 130 places, 147 transitions, 662 flow, removed 8 selfloop flow, removed 17 redundant places. [2023-11-29 01:36:52,254 INFO L231 Difference]: Finished difference. Result has 134 places, 120 transitions, 428 flow [2023-11-29 01:36:52,254 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=386, PETRI_DIFFERENCE_MINUEND_PLACES=125, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=117, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=428, PETRI_PLACES=134, PETRI_TRANSITIONS=120} [2023-11-29 01:36:52,254 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, -1 predicate places. [2023-11-29 01:36:52,254 INFO L495 AbstractCegarLoop]: Abstraction has has 134 places, 120 transitions, 428 flow [2023-11-29 01:36:52,255 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 92.0) internal successors, (644), 7 states have internal predecessors, (644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:52,255 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:52,255 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:52,261 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 01:36:52,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 01:36:52,456 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:52,456 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:52,456 INFO L85 PathProgramCache]: Analyzing trace with hash 423810259, now seen corresponding path program 1 times [2023-11-29 01:36:52,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:52,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091176172] [2023-11-29 01:36:52,456 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:52,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:52,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:52,693 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:52,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091176172] [2023-11-29 01:36:52,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091176172] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:36:52,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [897848965] [2023-11-29 01:36:52,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:52,694 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:36:52,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:36:52,695 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:36:52,699 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 01:36:52,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:52,861 INFO L262 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 01:36:52,864 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:52,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:52,889 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 [2023-11-29 01:36:52,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:52,902 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:52,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 9 [2023-11-29 01:36:53,183 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:53,183 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:36:53,346 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:53,346 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [897848965] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:36:53,346 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:36:53,346 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2023-11-29 01:36:53,346 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2017310117] [2023-11-29 01:36:53,347 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:36:53,347 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 01:36:53,347 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:36:53,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 01:36:53,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2023-11-29 01:36:54,186 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 84 out of 142 [2023-11-29 01:36:54,187 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 134 places, 120 transitions, 428 flow. Second operand has 12 states, 12 states have (on average 90.83333333333333) internal successors, (1090), 12 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,187 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:36:54,187 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 84 of 142 [2023-11-29 01:36:54,187 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:36:54,685 INFO L124 PetriNetUnfolderBase]: 676/1629 cut-off events. [2023-11-29 01:36:54,685 INFO L125 PetriNetUnfolderBase]: For 699/699 co-relation queries the response was YES. [2023-11-29 01:36:54,688 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4236 conditions, 1629 events. 676/1629 cut-off events. For 699/699 co-relation queries the response was YES. Maximal size of possible extension queue 36. Compared 7425 event pairs, 261 based on Foata normal form. 30/1576 useless extension candidates. Maximal degree in co-relation 1854. Up to 566 conditions per place. [2023-11-29 01:36:54,691 INFO L140 encePairwiseOnDemand]: 137/142 looper letters, 102 selfloop transitions, 7 changer transitions 0/157 dead transitions. [2023-11-29 01:36:54,691 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 141 places, 157 transitions, 771 flow [2023-11-29 01:36:54,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 01:36:54,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 01:36:54,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 782 transitions. [2023-11-29 01:36:54,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6883802816901409 [2023-11-29 01:36:54,693 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 782 transitions. [2023-11-29 01:36:54,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 782 transitions. [2023-11-29 01:36:54,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:36:54,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 782 transitions. [2023-11-29 01:36:54,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 97.75) internal successors, (782), 8 states have internal predecessors, (782), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,696 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,696 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 142.0) internal successors, (1278), 9 states have internal predecessors, (1278), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,697 INFO L175 Difference]: Start difference. First operand has 134 places, 120 transitions, 428 flow. Second operand 8 states and 782 transitions. [2023-11-29 01:36:54,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 141 places, 157 transitions, 771 flow [2023-11-29 01:36:54,702 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 140 places, 157 transitions, 761 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-29 01:36:54,705 INFO L231 Difference]: Finished difference. Result has 143 places, 121 transitions, 454 flow [2023-11-29 01:36:54,705 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=420, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=454, PETRI_PLACES=143, PETRI_TRANSITIONS=121} [2023-11-29 01:36:54,705 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 8 predicate places. [2023-11-29 01:36:54,706 INFO L495 AbstractCegarLoop]: Abstraction has has 143 places, 121 transitions, 454 flow [2023-11-29 01:36:54,706 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 90.83333333333333) internal successors, (1090), 12 states have internal predecessors, (1090), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:36:54,706 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:36:54,706 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:36:54,713 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 01:36:54,912 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 01:36:54,912 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:36:54,912 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:36:54,913 INFO L85 PathProgramCache]: Analyzing trace with hash 738668258, now seen corresponding path program 2 times [2023-11-29 01:36:54,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:36:54,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1450482601] [2023-11-29 01:36:54,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:36:54,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:36:54,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:36:56,926 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:56,927 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:36:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1450482601] [2023-11-29 01:36:56,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1450482601] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:36:56,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [66101351] [2023-11-29 01:36:56,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 01:36:56,927 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:36:56,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:36:56,928 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:36:56,929 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 01:36:57,120 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 01:36:57,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 01:36:57,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 102 conjunts are in the unsatisfiable core [2023-11-29 01:36:57,129 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:36:57,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:36:57,221 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 19 treesize of output 18 [2023-11-29 01:36:57,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:57,478 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:36:57,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 01:36:57,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:36:57,696 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:36:57,864 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 23 treesize of output 11 [2023-11-29 01:36:57,888 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 23 treesize of output 11 [2023-11-29 01:36:58,033 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:36:58,198 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 23 treesize of output 11 [2023-11-29 01:36:58,225 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 23 treesize of output 11 [2023-11-29 01:36:58,319 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:36:58,446 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:36:58,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:38:54,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:38:54,399 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 276 treesize of output 280 [2023-11-29 01:38:55,735 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select (store |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base| (store (select |c_#memory_int#3| |c_ULTIMATE.start_init_~q#1.base|) (+ 3208 |c_ULTIMATE.start_init_~q#1.offset|) 0)) |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse6 .cse5)) (.cse4 (+ 3208 |c_~#queue~0.offset|))) (and (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int) (v_ArrVal_695 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_691 Int)) (let ((.cse3 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_691))) (let ((.cse1 (select .cse3 .cse5))) (let ((.cse2 (select (store (store (store .cse3 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse1 1)) (+ (* .cse1 4) |c_~#queue~0.offset| 4) v_ArrVal_695) .cse5))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (= .cse1 800) (< (+ |c_~#queue~0.offset| (* .cse2 4) 4) 0) (= .cse2 800)))))) (= |c_~#queue~0.base| |c_ULTIMATE.start_init_~q#1.base|)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_691 Int)) (let ((.cse9 (store .cse6 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_691))) (let ((.cse11 (select .cse9 .cse5))) (or (forall ((v_ArrVal_695 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse10 (+ (* .cse11 4) |c_~#queue~0.offset| 4))) (let ((.cse8 (select (store (store (store .cse9 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse11 1)) .cse10 v_ArrVal_695) .cse5))) (let ((.cse7 (+ |c_~#queue~0.offset| (* .cse8 4) 4))) (or (< .cse7 0) (= .cse8 800) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| Int) (v_ArrVal_699 Int)) (< (+ (* 4 (select (store (store (store (store .cse9 .cse10 v_ArrVal_695) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_47| 1)) .cse5 (+ .cse8 1)) .cse7 v_ArrVal_699) .cse5)) |c_~#queue~0.offset|) (+ |c_ULTIMATE.start_init_~q#1.offset| 3205)))))))) (= .cse11 800)))))))))) is different from false [2023-11-29 01:38:55,758 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 01:38:55,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:38:55,767 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 3 case distinctions, treesize of input 264 treesize of output 183 [2023-11-29 01:38:55,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 179 treesize of output 159 [2023-11-29 01:38:55,776 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 174 treesize of output 142 [2023-11-29 01:38:55,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 01:38:55,803 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 01:38:55,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:38:55,838 INFO L349 Elim1Store]: treesize reduction 47, result has 39.7 percent of original size [2023-11-29 01:38:55,839 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 3 case distinctions, treesize of input 613 treesize of output 412 [2023-11-29 01:38:55,848 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 388 treesize of output 352 [2023-11-29 01:38:55,879 INFO L349 Elim1Store]: treesize reduction 10, result has 47.4 percent of original size [2023-11-29 01:38:55,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 352 treesize of output 300 [2023-11-29 01:38:56,626 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:38:56,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [66101351] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 01:38:56,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 01:38:56,627 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 20, 27] total 66 [2023-11-29 01:38:56,627 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798625537] [2023-11-29 01:38:56,627 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 01:38:56,627 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2023-11-29 01:38:56,628 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 01:38:56,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2023-11-29 01:38:56,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=672, Invalid=3734, Unknown=20, NotChecked=130, Total=4556 [2023-11-29 01:38:56,774 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 142 [2023-11-29 01:38:56,776 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 143 places, 121 transitions, 454 flow. Second operand has 68 states, 68 states have (on average 30.16176470588235) internal successors, (2051), 68 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:38:56,776 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 01:38:56,776 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 142 [2023-11-29 01:38:56,777 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 01:39:21,321 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse20 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse15 (select .cse4 .cse3))) (let ((.cse31 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) (.cse22 (* 4 .cse15)) (.cse12 (* (select .cse20 .cse5) 4))) (let ((.cse21 (+ .cse12 |c_~#queue~0.offset|)) (.cse16 (+ .cse15 1)) (.cse23 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse0 (+ .cse22 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse25 (+ .cse31 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (or (< .cse0 0) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_699))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#queue~0.base|) .cse5) 4)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 .cse0 v_ArrVal_699))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#queue~0.base|) .cse5) 4)) .cse7)))) (forall ((v_ArrVal_695 Int)) (let ((.cse10 (store .cse4 .cse0 v_ArrVal_695))) (let ((.cse11 (select .cse10 .cse3))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse8 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse10 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse11 1))) |c_~#queue~0.base|))) (let ((.cse9 (+ (* 4 (select .cse8 .cse5)) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse8 .cse9 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7)) (< .cse9 0))))) (= 800 .cse11))))) (<= (+ .cse12 |c_~#queue~0.offset| 4) .cse7) (let ((.cse14 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse3 .cse16)) |c_~#queue~0.base|))) (let ((.cse13 (+ (* (select .cse14 .cse5) 4) |c_~#queue~0.offset|))) (or (< .cse13 0) (and (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse14 .cse13 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse14 .cse13 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7))) (= 800 .cse15)))) (forall ((v_ArrVal_695 Int)) (let ((.cse18 (store .cse20 .cse21 v_ArrVal_695))) (let ((.cse17 (select .cse18 .cse5))) (let ((.cse19 (+ |c_~#queue~0.offset| 4 (* .cse17 4)))) (or (= .cse17 800) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= (+ (* (select (store (store (store .cse18 (+ 3208 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ .cse17 1)) .cse19 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7)) (< .cse19 0)))))) (<= (+ .cse22 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse23) (or (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= (+ (* 4 (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse24 (store .cse4 .cse25 v_ArrVal_699))) (store (store .cse24 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse24 .cse3) 1)))) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse7)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= 0 (+ (* 4 (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse26 (store .cse4 .cse25 v_ArrVal_699))) (store (store .cse26 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse26 .cse3) 1)))) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|)))) (< .cse25 0)) (forall ((v_ArrVal_695 Int)) (let ((.cse29 (store .cse4 .cse0 v_ArrVal_695))) (let ((.cse30 (select .cse29 .cse3))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse28 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse29 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse30 1))) |c_~#queue~0.base|))) (let ((.cse27 (+ (* 4 (select .cse28 .cse5)) |c_~#queue~0.offset|))) (or (< .cse27 0) (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse28 .cse27 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 4))))))) (= 800 .cse30))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse16)) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse7)) (or (< .cse21 0) (and (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse20 .cse21 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse20 .cse21 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7)))) (<= 0 .cse21) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse16)) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= (+ .cse31 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse23) (forall ((v_ArrVal_695 Int)) (let ((.cse34 (store .cse4 .cse25 v_ArrVal_695))) (let ((.cse35 (select .cse34 .cse3))) (or (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse32 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse34 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse35 1))) |c_~#queue~0.base|))) (let ((.cse33 (+ (* (select .cse32 .cse5) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse32 .cse33 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7)) (< .cse33 0))))) (= .cse35 800))))) (<= 0 .cse25) (<= 0 .cse0) (forall ((v_ArrVal_695 Int)) (let ((.cse39 (store .cse4 .cse25 v_ArrVal_695))) (let ((.cse36 (select .cse39 .cse3))) (or (= .cse36 800) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse37 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse39 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse36 1))) |c_~#queue~0.base|))) (let ((.cse38 (+ (* (select .cse37 .cse5) 4) |c_~#queue~0.offset|))) (or (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse37 .cse38 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 4))) (< .cse38 0)))))))))))))) is different from false [2023-11-29 01:39:35,585 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse13 (select .cse5 .cse6))) (let ((.cse3 (select |c_#length| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ .cse13 1)) (.cse4 (= 800 .cse13))) (and (let ((.cse1 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 .cse7)) |c_~#queue~0.base|))) (let ((.cse0 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|))) (or (< .cse0 0) (and (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse1 .cse0 v_ArrVal_699) .cse2) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse1 .cse0 v_ArrVal_699) .cse2) 4) |c_~#queue~0.offset| 8) .cse3))) .cse4))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 .cse7)) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset| 4) .cse3)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 .cse7)) |c_~#queue~0.base|) .cse2) 4) |c_~#queue~0.offset|))) (or (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse10 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 .cse7)) |c_~#queue~0.base|))) (let ((.cse9 (+ (* (select .cse10 .cse2) 4) |c_~#queue~0.offset|))) (or (< .cse9 0) (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse10 .cse9 v_ArrVal_699) .cse2) 4) |c_~#queue~0.offset| 4))))))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (let ((.cse12 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse6 .cse7)) |c_~#queue~0.base|))) (let ((.cse11 (+ (* (select .cse12 .cse2) 4) |c_~#queue~0.offset|))) (or (< .cse11 0) (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse12 .cse11 v_ArrVal_699) .cse2) 4) |c_~#queue~0.offset| 8) .cse3))))))) .cse4))))) is different from false [2023-11-29 01:39:37,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:39:41,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:39:50,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:39:54,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:39:58,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:02,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:12,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:25,673 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:28,868 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:36,708 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:40,817 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:44,889 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse16 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse5 (+ |c_~#queue~0.offset| 3204)) (.cse18 (select .cse4 .cse3))) (let ((.cse9 (* 4 .cse18)) (.cse17 (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) (.cse8 (* (select .cse16 .cse5) 4))) (let ((.cse7 (select |c_#length| |c_~#queue~0.base|)) (.cse15 (+ .cse8 |c_~#queue~0.offset|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse14 (+ .cse18 1)) (.cse10 (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse12 (+ .cse17 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (+ .cse9 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (or (< .cse0 0) (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse1 (store .cse4 .cse0 v_ArrVal_699))) (store (store .cse1 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse1 .cse3) 1)))) |c_~#queue~0.base|) .cse5) 4)))) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse4 .cse0 v_ArrVal_699))) (store (store .cse6 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse6 .cse3) 1)))) |c_~#queue~0.base|) .cse5) 4)) .cse7)))) (<= (+ .cse8 |c_~#queue~0.offset| 4) .cse7) (<= (+ .cse9 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse10) (or (and (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= (+ (* 4 (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse11 (store .cse4 .cse12 v_ArrVal_699))) (store (store .cse11 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse11 .cse3) 1)))) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset| 4) .cse7)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_699 Int)) (<= 0 (+ (* 4 (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse4 .cse12 v_ArrVal_699))) (store (store .cse13 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ (select .cse13 .cse3) 1)))) |c_~#queue~0.base|) .cse5)) |c_~#queue~0.offset|)))) (< .cse12 0)) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse14)) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset| 4) .cse7)) (or (< .cse15 0) (and (forall ((v_ArrVal_699 Int)) (<= 0 (+ (* (select (store .cse16 .cse15 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_699 Int)) (<= (+ (* (select (store .cse16 .cse15 v_ArrVal_699) .cse5) 4) |c_~#queue~0.offset| 8) .cse7)))) (<= 0 .cse15) (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int)) (<= 0 (+ (* (select (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 .cse2 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 .cse14)) |c_~#queue~0.base|) .cse5) 4) |c_~#queue~0.offset|))) (<= (+ .cse17 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) .cse10) (<= 0 .cse12) (<= 0 .cse0)))))) is different from false [2023-11-29 01:40:48,930 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:52,946 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:57,298 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:40:59,371 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:04,512 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:08,534 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:12,688 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:17,376 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:22,388 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:26,161 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.84s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:30,199 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:40,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:45,046 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:51,250 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 01:41:53,900 INFO L124 PetriNetUnfolderBase]: 4366/8475 cut-off events. [2023-11-29 01:41:53,900 INFO L125 PetriNetUnfolderBase]: For 3352/3352 co-relation queries the response was YES. [2023-11-29 01:41:53,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21667 conditions, 8475 events. 4366/8475 cut-off events. For 3352/3352 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 50997 event pairs, 727 based on Foata normal form. 120/8139 useless extension candidates. Maximal degree in co-relation 3204. Up to 1386 conditions per place. [2023-11-29 01:41:53,930 INFO L140 encePairwiseOnDemand]: 118/142 looper letters, 508 selfloop transitions, 108 changer transitions 0/631 dead transitions. [2023-11-29 01:41:53,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 184 places, 631 transitions, 3187 flow [2023-11-29 01:41:53,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2023-11-29 01:41:53,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42 states. [2023-11-29 01:41:53,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 1777 transitions. [2023-11-29 01:41:53,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2979543930248156 [2023-11-29 01:41:53,933 INFO L72 ComplementDD]: Start complementDD. Operand 42 states and 1777 transitions. [2023-11-29 01:41:53,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 42 states and 1777 transitions. [2023-11-29 01:41:53,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 01:41:53,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 42 states and 1777 transitions. [2023-11-29 01:41:53,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 43 states, 42 states have (on average 42.30952380952381) internal successors, (1777), 42 states have internal predecessors, (1777), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:53,941 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 43 states, 43 states have (on average 142.0) internal successors, (6106), 43 states have internal predecessors, (6106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:53,942 INFO L81 ComplementDD]: Finished complementDD. Result has 43 states, 43 states have (on average 142.0) internal successors, (6106), 43 states have internal predecessors, (6106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:53,942 INFO L175 Difference]: Start difference. First operand has 143 places, 121 transitions, 454 flow. Second operand 42 states and 1777 transitions. [2023-11-29 01:41:53,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 184 places, 631 transitions, 3187 flow [2023-11-29 01:41:53,956 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 631 transitions, 3169 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 01:41:53,961 INFO L231 Difference]: Finished difference. Result has 195 places, 204 transitions, 1239 flow [2023-11-29 01:41:53,961 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=142, PETRI_DIFFERENCE_MINUEND_FLOW=443, PETRI_DIFFERENCE_MINUEND_PLACES=138, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=121, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=32, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=42, PETRI_FLOW=1239, PETRI_PLACES=195, PETRI_TRANSITIONS=204} [2023-11-29 01:41:53,962 INFO L281 CegarLoopForPetriNet]: 135 programPoint places, 60 predicate places. [2023-11-29 01:41:53,962 INFO L495 AbstractCegarLoop]: Abstraction has has 195 places, 204 transitions, 1239 flow [2023-11-29 01:41:53,963 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 30.16176470588235) internal successors, (2051), 68 states have internal predecessors, (2051), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 01:41:53,963 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 01:41:53,963 INFO L208 CegarLoopForPetriNet]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 01:41:53,967 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 01:41:54,163 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:41:54,163 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 101 more)] === [2023-11-29 01:41:54,164 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 01:41:54,164 INFO L85 PathProgramCache]: Analyzing trace with hash -576508771, now seen corresponding path program 1 times [2023-11-29 01:41:54,164 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 01:41:54,164 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1958290920] [2023-11-29 01:41:54,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:54,164 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 01:41:54,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:56,437 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:41:56,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 01:41:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1958290920] [2023-11-29 01:41:56,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1958290920] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 01:41:56,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [257361659] [2023-11-29 01:41:56,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 01:41:56,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 01:41:56,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 01:41:56,438 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 01:41:56,439 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_fbd5b500-befe-4f6e-9ada-55825fb97fb8/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 01:41:56,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 01:41:56,605 INFO L262 TraceCheckSpWp]: Trace formula consists of 532 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-29 01:41:56,611 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 01:41:56,659 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 01:41:56,714 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 19 treesize of output 18 [2023-11-29 01:41:57,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:41:57,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:41:57,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 21 [2023-11-29 01:41:57,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 0 case distinctions, treesize of input 30 treesize of output 14 [2023-11-29 01:41:57,227 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:41:57,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:41:57,393 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 27 treesize of output 11 [2023-11-29 01:41:57,417 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 23 treesize of output 11 [2023-11-29 01:41:57,508 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:41:57,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:41:57,712 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 27 treesize of output 11 [2023-11-29 01:41:57,742 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 23 treesize of output 11 [2023-11-29 01:41:57,853 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:41:58,056 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 01:41:58,057 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 27 treesize of output 11 [2023-11-29 01:41:58,080 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 23 treesize of output 11 [2023-11-29 01:41:58,181 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 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 01:41:58,359 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 78 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 01:41:58,359 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 01:42:26,394 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int#3| |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (forall ((v_ArrVal_817 Int)) (<= (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse1) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (forall ((v_ArrVal_817 Int)) (<= 0 (+ (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)))))) is different from false [2023-11-29 01:42:30,445 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#queue~0.base|)) (.cse1 (+ |c_~#queue~0.offset| 3204))) (let ((.cse2 (select .cse0 .cse1))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (forall ((v_ArrVal_817 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (< .cse2 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (forall ((v_ArrVal_817 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse1) 4))))))))) is different from false [2023-11-29 01:42:34,466 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse0 (select .cse1 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (forall ((v_ArrVal_817 Int)) (<= 0 (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 4))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (forall ((v_ArrVal_817 Int)) (<= (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2023-11-29 01:42:44,855 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse6 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_814 Int)) (let ((.cse1 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_814))) (store (store .cse3 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse3 .cse5) 1)))) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_817 Int)) (<= (+ (* (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_814 Int)) (let ((.cse7 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_814))) (store (store .cse8 .cse4 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse5 (+ (select .cse8 .cse5) 1)))) |c_~#queue~0.base|))) (or (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (forall ((v_ArrVal_817 Int)) (<= 0 (+ (* (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 4))))))))))) is different from false [2023-11-29 01:44:49,431 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (let ((.cse5 (select .cse4 .cse2)) (.cse1 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_814 Int)) (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_814))) (let ((.cse3 (+ (select .cse0 .cse2) 1))) (or (forall ((v_ArrVal_817 Int)) (<= 0 (+ (* (select (store (store (store .cse0 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse3) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 4))) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|))))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int)) (or (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_814 Int)) (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_814))) (let ((.cse7 (+ (select .cse6 .cse2) 1))) (or (forall ((v_ArrVal_817 Int)) (<= (+ (* (select (store (store (store .cse6 .cse1 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse2 .cse7) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse7 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)))))))))) is different from false [2023-11-29 01:49:37,023 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse9 .cse8)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_810 Int)) (let ((.cse1 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_810))) (store (store .cse6 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse6 .cse8) 1)))) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_814 Int) (v_subst_2 Int)) (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_814))) (let ((.cse5 (+ (select .cse3 .cse2) 1))) (or (forall ((v_ArrVal_817 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (store (store (store .cse3 .cse4 (+ v_subst_2 1)) .cse2 .cse5) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|)))))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_810 Int)) (let ((.cse10 (select (store |c_#memory_int#3| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_67|)) v_ArrVal_810))) (store (store .cse13 .cse7 (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#queue~0.base|))) (or (< (select .cse10 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61| Int) (v_ArrVal_814 Int) (v_subst_1 Int)) (let ((.cse12 (store .cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_64|)) v_ArrVal_814))) (let ((.cse11 (+ (select .cse12 .cse2) 1))) (or (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) (forall ((v_ArrVal_817 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (store (store (store .cse12 .cse4 (+ v_subst_1 1)) .cse2 .cse11) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_61|) |c_~#queue~0.offset|) v_ArrVal_817) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))))))))))))))) is different from false