./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longer.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 826ab2ba Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longer.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd --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 f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a --- Real Ultimate output --- This is Ultimate 0.3.0-dev-826ab2b [2024-11-13 13:12:37,037 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-13 13:12:37,118 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-13 13:12:37,123 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-13 13:12:37,123 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-13 13:12:37,159 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-13 13:12:37,159 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-13 13:12:37,160 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-13 13:12:37,160 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-13 13:12:37,161 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-13 13:12:37,162 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-13 13:12:37,162 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-13 13:12:37,163 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-13 13:12:37,163 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-13 13:12:37,163 INFO L153 SettingsManager]: * Use SBE=true [2024-11-13 13:12:37,163 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-13 13:12:37,163 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-13 13:12:37,164 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-13 13:12:37,165 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-13 13:12:37,165 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-13 13:12:37,166 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-13 13:12:37,166 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:37,166 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-13 13:12:37,167 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-13 13:12:37,168 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-13 13:12:37,168 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd 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 -> f58af1aa15d4bec1241042c84c595fb9585ff7c461dd0b44f9fde0638838779a [2024-11-13 13:12:37,493 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-13 13:12:37,501 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-13 13:12:37,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-13 13:12:37,505 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-13 13:12:37,505 INFO L274 PluginConnector]: CDTParser initialized [2024-11-13 13:12:37,507 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/../../sv-benchmarks/c/pthread/queue_ok_longer.i Unable to find full path for "g++" [2024-11-13 13:12:39,578 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-13 13:12:40,193 INFO L384 CDTParser]: Found 1 translation units. [2024-11-13 13:12:40,194 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/sv-benchmarks/c/pthread/queue_ok_longer.i [2024-11-13 13:12:40,220 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/data/d284ebabf/80033aece00e494daeafdb2a2cee816f/FLAGb90cbd332 [2024-11-13 13:12:40,712 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/data/d284ebabf/80033aece00e494daeafdb2a2cee816f [2024-11-13 13:12:40,715 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-13 13:12:40,717 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-13 13:12:40,719 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:40,719 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-13 13:12:40,724 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-13 13:12:40,725 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:40" (1/1) ... [2024-11-13 13:12:40,726 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@587c2b8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:40, skipping insertion in model container [2024-11-13 13:12:40,726 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.11 01:12:40" (1/1) ... [2024-11-13 13:12:40,778 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-13 13:12:41,269 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:41,315 INFO L200 MainTranslator]: Completed pre-run [2024-11-13 13:12:41,378 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-13 13:12:41,496 INFO L204 MainTranslator]: Completed translation [2024-11-13 13:12:41,497 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41 WrapperNode [2024-11-13 13:12:41,497 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-13 13:12:41,498 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:41,498 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-13 13:12:41,498 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-13 13:12:41,504 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,543 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,647 INFO L138 Inliner]: procedures = 277, calls = 857, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 1002 [2024-11-13 13:12:41,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-13 13:12:41,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-13 13:12:41,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-13 13:12:41,649 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-13 13:12:41,659 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,678 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,729 INFO L175 MemorySlicer]: Split 838 memory accesses to 4 slices as follows [2, 8, 426, 402]. 51 percent of accesses are in the largest equivalence class. The 813 initializations are split as follows [2, 8, 403, 400]. The 11 writes are split as follows [0, 0, 10, 1]. [2024-11-13 13:12:41,729 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,729 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,794 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,800 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,834 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,842 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,852 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-13 13:12:41,856 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-13 13:12:41,860 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-13 13:12:41,860 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-13 13:12:41,861 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (1/1) ... [2024-11-13 13:12:41,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-13 13:12:41,887 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:12:41,904 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-13 13:12:41,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-13 13:12:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2024-11-13 13:12:41,938 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2024-11-13 13:12:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2024-11-13 13:12:41,938 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2024-11-13 13:12:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-13 13:12:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-13 13:12:41,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-13 13:12:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#3 [2024-11-13 13:12:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexUnlock [2024-11-13 13:12:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-13 13:12:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-13 13:12:41,939 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#3 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-13 13:12:41,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-13 13:12:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-13 13:12:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-13 13:12:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2024-11-13 13:12:41,941 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-13 13:12:41,942 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-13 13:12:41,943 WARN L207 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement. [2024-11-13 13:12:42,179 INFO L238 CfgBuilder]: Building ICFG [2024-11-13 13:12:42,182 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-13 13:12:44,157 INFO L283 CfgBuilder]: Omitted future-live optimization because the input is a concurrent program. [2024-11-13 13:12:44,157 INFO L287 CfgBuilder]: Performing block encoding [2024-11-13 13:12:53,654 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-13 13:12:53,654 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-13 13:12:53,655 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:53 BoogieIcfgContainer [2024-11-13 13:12:53,655 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-13 13:12:53,657 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-13 13:12:53,658 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-13 13:12:53,663 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-13 13:12:53,663 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.11 01:12:40" (1/3) ... [2024-11-13 13:12:53,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f5b984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:53, skipping insertion in model container [2024-11-13 13:12:53,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.11 01:12:41" (2/3) ... [2024-11-13 13:12:53,664 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41f5b984 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.11 01:12:53, skipping insertion in model container [2024-11-13 13:12:53,664 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.11 01:12:53" (3/3) ... [2024-11-13 13:12:53,666 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longer.i [2024-11-13 13:12:53,684 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-13 13:12:53,686 INFO L154 ceAbstractionStarter]: Applying trace abstraction to ICFG queue_ok_longer.i that has 3 procedures, 119 locations, 1 initial locations, 2 loop locations, and 53 error locations. [2024-11-13 13:12:53,686 INFO L492 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2024-11-13 13:12:53,839 INFO L143 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2024-11-13 13:12:53,886 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 125 places, 129 transitions, 272 flow [2024-11-13 13:12:54,018 INFO L124 PetriNetUnfolderBase]: 11/127 cut-off events. [2024-11-13 13:12:54,023 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2024-11-13 13:12:54,031 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136 conditions, 127 events. 11/127 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 408 event pairs, 0 based on Foata normal form. 0/63 useless extension candidates. Maximal degree in co-relation 99. Up to 3 conditions per place. [2024-11-13 13:12:54,031 INFO L82 GeneralOperation]: Start removeDead. Operand has 125 places, 129 transitions, 272 flow [2024-11-13 13:12:54,039 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 122 places, 126 transitions, 264 flow [2024-11-13 13:12:54,057 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-13 13:12:54,075 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@7d11e13b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-13 13:12:54,079 INFO L334 AbstractCegarLoop]: Starting to check reachability of 96 error locations. [2024-11-13 13:12:54,123 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2024-11-13 13:12:54,123 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2024-11-13 13:12:54,124 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2024-11-13 13:12:54,124 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:12:54,125 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-13 13:12:54,125 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:12:54,132 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:54,132 INFO L85 PathProgramCache]: Analyzing trace with hash 69609, now seen corresponding path program 1 times [2024-11-13 13:12:54,142 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:54,142 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615554069] [2024-11-13 13:12:54,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:54,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:54,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:55,243 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:55,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:55,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615554069] [2024-11-13 13:12:55,244 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615554069] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:55,244 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:55,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:12:55,248 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101743553] [2024-11-13 13:12:55,249 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:55,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:55,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:55,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:55,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:55,424 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-13 13:12:55,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 122 places, 126 transitions, 264 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:55,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:12:55,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-13 13:12:55,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:12:56,342 INFO L124 PetriNetUnfolderBase]: 1089/2984 cut-off events. [2024-11-13 13:12:56,343 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2024-11-13 13:12:56,355 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4727 conditions, 2984 events. 1089/2984 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23573 event pairs, 839 based on Foata normal form. 68/2109 useless extension candidates. Maximal degree in co-relation 4570. Up to 1689 conditions per place. [2024-11-13 13:12:56,383 INFO L140 encePairwiseOnDemand]: 121/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/114 dead transitions. [2024-11-13 13:12:56,383 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 116 places, 114 transitions, 334 flow [2024-11-13 13:12:56,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:56,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:12:56,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 266 transitions. [2024-11-13 13:12:56,404 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6873385012919897 [2024-11-13 13:12:56,406 INFO L175 Difference]: Start difference. First operand has 122 places, 126 transitions, 264 flow. Second operand 3 states and 266 transitions. [2024-11-13 13:12:56,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 116 places, 114 transitions, 334 flow [2024-11-13 13:12:56,417 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 112 places, 114 transitions, 326 flow, removed 0 selfloop flow, removed 4 redundant places. [2024-11-13 13:12:56,423 INFO L231 Difference]: Finished difference. Result has 112 places, 114 transitions, 236 flow [2024-11-13 13:12:56,426 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, 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} [2024-11-13 13:12:56,431 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -10 predicate places. [2024-11-13 13:12:56,431 INFO L471 AbstractCegarLoop]: Abstraction has has 112 places, 114 transitions, 236 flow [2024-11-13 13:12:56,432 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:56,432 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:12:56,432 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1] [2024-11-13 13:12:56,432 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-13 13:12:56,432 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:12:56,433 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:56,433 INFO L85 PathProgramCache]: Analyzing trace with hash 69610, now seen corresponding path program 1 times [2024-11-13 13:12:56,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:56,433 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547684537] [2024-11-13 13:12:56,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:56,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:56,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:57,196 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:57,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:57,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547684537] [2024-11-13 13:12:57,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547684537] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:57,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:57,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:12:57,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406796762] [2024-11-13 13:12:57,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:57,199 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:12:57,200 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:57,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:12:57,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:12:57,341 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 71 out of 129 [2024-11-13 13:12:57,342 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 112 places, 114 transitions, 236 flow. Second operand has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:57,342 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:12:57,342 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 71 of 129 [2024-11-13 13:12:57,342 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:12:58,072 INFO L124 PetriNetUnfolderBase]: 1089/2981 cut-off events. [2024-11-13 13:12:58,072 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-13 13:12:58,080 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4690 conditions, 2981 events. 1089/2981 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23583 event pairs, 839 based on Foata normal form. 3/2043 useless extension candidates. Maximal degree in co-relation 4679. Up to 1689 conditions per place. [2024-11-13 13:12:58,099 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 45 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-13 13:12:58,099 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 111 transitions, 324 flow [2024-11-13 13:12:58,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:12:58,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:12:58,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 263 transitions. [2024-11-13 13:12:58,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6795865633074936 [2024-11-13 13:12:58,102 INFO L175 Difference]: Start difference. First operand has 112 places, 114 transitions, 236 flow. Second operand 3 states and 263 transitions. [2024-11-13 13:12:58,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 111 transitions, 324 flow [2024-11-13 13:12:58,104 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 111 transitions, 320 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:12:58,106 INFO L231 Difference]: Finished difference. Result has 109 places, 111 transitions, 230 flow [2024-11-13 13:12:58,106 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=107, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=109, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=230, PETRI_PLACES=109, PETRI_TRANSITIONS=111} [2024-11-13 13:12:58,107 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -13 predicate places. [2024-11-13 13:12:58,107 INFO L471 AbstractCegarLoop]: Abstraction has has 109 places, 111 transitions, 230 flow [2024-11-13 13:12:58,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 71.66666666666667) internal successors, (215), 3 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:12:58,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:12:58,108 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-13 13:12:58,109 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:12:58,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:58,109 INFO L85 PathProgramCache]: Analyzing trace with hash 2075867991, now seen corresponding path program 1 times [2024-11-13 13:12:58,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:58,109 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [996177364] [2024-11-13 13:12:58,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:58,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:58,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:12:58,601 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:12:58,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:12:58,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [996177364] [2024-11-13 13:12:58,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [996177364] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:12:58,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:12:58,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:12:58,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1473399792] [2024-11-13 13:12:58,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:12:58,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:12:58,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:12:58,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:12:58,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:12:58,727 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-13 13:12:58,728 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 109 places, 111 transitions, 230 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:58,728 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:12:58,728 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-13 13:12:58,729 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:12:59,379 INFO L124 PetriNetUnfolderBase]: 1089/2979 cut-off events. [2024-11-13 13:12:59,379 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2024-11-13 13:12:59,386 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4688 conditions, 2979 events. 1089/2979 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23567 event pairs, 839 based on Foata normal form. 1/2041 useless extension candidates. Maximal degree in co-relation 4677. Up to 1688 conditions per place. [2024-11-13 13:12:59,404 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-13 13:12:59,404 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 109 transitions, 320 flow [2024-11-13 13:12:59,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:12:59,404 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:12:59,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-13 13:12:59,406 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-13 13:12:59,407 INFO L175 Difference]: Start difference. First operand has 109 places, 111 transitions, 230 flow. Second operand 4 states and 337 transitions. [2024-11-13 13:12:59,407 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 109 transitions, 320 flow [2024-11-13 13:12:59,410 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 108 places, 109 transitions, 316 flow, removed 0 selfloop flow, removed 2 redundant places. [2024-11-13 13:12:59,412 INFO L231 Difference]: Finished difference. Result has 108 places, 109 transitions, 228 flow [2024-11-13 13:12:59,412 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=222, PETRI_DIFFERENCE_MINUEND_PLACES=105, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=228, PETRI_PLACES=108, PETRI_TRANSITIONS=109} [2024-11-13 13:12:59,415 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-13 13:12:59,415 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 109 transitions, 228 flow [2024-11-13 13:12:59,416 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:12:59,416 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:12:59,416 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2024-11-13 13:12:59,416 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-13 13:12:59,416 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:12:59,417 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:12:59,417 INFO L85 PathProgramCache]: Analyzing trace with hash 2075867992, now seen corresponding path program 1 times [2024-11-13 13:12:59,417 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:12:59,417 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913330929] [2024-11-13 13:12:59,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:12:59,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:12:59,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:00,356 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:00,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:00,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913330929] [2024-11-13 13:13:00,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913330929] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:00,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:00,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:00,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575384064] [2024-11-13 13:13:00,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:00,358 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:00,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:00,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:00,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:00,600 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-13 13:13:00,602 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 109 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:00,602 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:00,602 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-13 13:13:00,602 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:01,295 INFO L124 PetriNetUnfolderBase]: 1089/2977 cut-off events. [2024-11-13 13:13:01,296 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-13 13:13:01,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4687 conditions, 2977 events. 1089/2977 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 141. Compared 23574 event pairs, 839 based on Foata normal form. 2/2041 useless extension candidates. Maximal degree in co-relation 4672. Up to 1688 conditions per place. [2024-11-13 13:13:01,321 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 44 selfloop transitions, 3 changer transitions 0/107 dead transitions. [2024-11-13 13:13:01,321 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 107 transitions, 318 flow [2024-11-13 13:13:01,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:01,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:13:01,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 337 transitions. [2024-11-13 13:13:01,323 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6531007751937985 [2024-11-13 13:13:01,323 INFO L175 Difference]: Start difference. First operand has 108 places, 109 transitions, 228 flow. Second operand 4 states and 337 transitions. [2024-11-13 13:13:01,323 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 107 transitions, 318 flow [2024-11-13 13:13:01,325 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 107 transitions, 312 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:13:01,329 INFO L231 Difference]: Finished difference. Result has 106 places, 107 transitions, 224 flow [2024-11-13 13:13:01,329 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=218, PETRI_DIFFERENCE_MINUEND_PLACES=103, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=107, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=104, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=224, PETRI_PLACES=106, PETRI_TRANSITIONS=107} [2024-11-13 13:13:01,330 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -16 predicate places. [2024-11-13 13:13:01,330 INFO L471 AbstractCegarLoop]: Abstraction has has 106 places, 107 transitions, 224 flow [2024-11-13 13:13:01,330 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 72.75) internal successors, (291), 4 states have internal predecessors, (291), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:01,330 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:01,331 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:01,331 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-13 13:13:01,331 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:01,332 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:01,332 INFO L85 PathProgramCache]: Analyzing trace with hash -1588067905, now seen corresponding path program 1 times [2024-11-13 13:13:01,334 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:01,334 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1174717260] [2024-11-13 13:13:01,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:01,335 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:01,977 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:01,977 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:01,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1174717260] [2024-11-13 13:13:01,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1174717260] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:01,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:01,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:01,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74297270] [2024-11-13 13:13:01,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:01,978 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:01,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:01,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:01,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:02,244 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 129 [2024-11-13 13:13:02,245 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 106 places, 107 transitions, 224 flow. Second operand has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:02,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 129 [2024-11-13 13:13:02,246 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:02,850 INFO L124 PetriNetUnfolderBase]: 1046/2622 cut-off events. [2024-11-13 13:13:02,850 INFO L125 PetriNetUnfolderBase]: For 16/16 co-relation queries the response was YES. [2024-11-13 13:13:02,855 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4287 conditions, 2622 events. 1046/2622 cut-off events. For 16/16 co-relation queries the response was YES. Maximal size of possible extension queue 118. Compared 19421 event pairs, 426 based on Foata normal form. 120/2116 useless extension candidates. Maximal degree in co-relation 4272. Up to 882 conditions per place. [2024-11-13 13:13:02,874 INFO L140 encePairwiseOnDemand]: 118/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/122 dead transitions. [2024-11-13 13:13:02,874 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 122 transitions, 395 flow [2024-11-13 13:13:02,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:02,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:13:02,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 342 transitions. [2024-11-13 13:13:02,877 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6627906976744186 [2024-11-13 13:13:02,877 INFO L175 Difference]: Start difference. First operand has 106 places, 107 transitions, 224 flow. Second operand 4 states and 342 transitions. [2024-11-13 13:13:02,877 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 122 transitions, 395 flow [2024-11-13 13:13:02,879 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 122 transitions, 389 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:13:02,881 INFO L231 Difference]: Finished difference. Result has 98 places, 99 transitions, 208 flow [2024-11-13 13:13:02,882 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=96, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=98, PETRI_TRANSITIONS=99} [2024-11-13 13:13:02,882 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-13 13:13:02,882 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 99 transitions, 208 flow [2024-11-13 13:13:02,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 68.75) internal successors, (275), 4 states have internal predecessors, (275), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:02,883 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:02,885 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:02,885 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-13 13:13:02,886 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:02,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:02,889 INFO L85 PathProgramCache]: Analyzing trace with hash -1588067904, now seen corresponding path program 1 times [2024-11-13 13:13:02,889 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:02,889 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2125673366] [2024-11-13 13:13:02,889 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:02,889 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:02,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:03,705 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:03,705 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2125673366] [2024-11-13 13:13:03,706 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2125673366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:03,706 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:03,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:03,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [628411121] [2024-11-13 13:13:03,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:03,707 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:03,707 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:03,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:03,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:03,975 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 67 out of 129 [2024-11-13 13:13:03,976 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 99 transitions, 208 flow. Second operand has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:03,980 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:03,980 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 67 of 129 [2024-11-13 13:13:03,980 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:04,587 INFO L124 PetriNetUnfolderBase]: 1046/2354 cut-off events. [2024-11-13 13:13:04,588 INFO L125 PetriNetUnfolderBase]: For 90/90 co-relation queries the response was YES. [2024-11-13 13:13:04,592 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4097 conditions, 2354 events. 1046/2354 cut-off events. For 90/90 co-relation queries the response was YES. Maximal size of possible extension queue 102. Compared 15816 event pairs, 426 based on Foata normal form. 120/2000 useless extension candidates. Maximal degree in co-relation 1953. Up to 882 conditions per place. [2024-11-13 13:13:04,604 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 67 selfloop transitions, 3 changer transitions 0/115 dead transitions. [2024-11-13 13:13:04,604 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 115 transitions, 381 flow [2024-11-13 13:13:04,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:04,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:13:04,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 345 transitions. [2024-11-13 13:13:04,606 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6686046511627907 [2024-11-13 13:13:04,606 INFO L175 Difference]: Start difference. First operand has 98 places, 99 transitions, 208 flow. Second operand 4 states and 345 transitions. [2024-11-13 13:13:04,606 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 115 transitions, 381 flow [2024-11-13 13:13:04,608 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 115 transitions, 375 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:13:04,610 INFO L231 Difference]: Finished difference. Result has 91 places, 92 transitions, 194 flow [2024-11-13 13:13:04,610 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=89, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=194, PETRI_PLACES=91, PETRI_TRANSITIONS=92} [2024-11-13 13:13:04,611 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -31 predicate places. [2024-11-13 13:13:04,611 INFO L471 AbstractCegarLoop]: Abstraction has has 91 places, 92 transitions, 194 flow [2024-11-13 13:13:04,612 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 69.75) internal successors, (279), 4 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:04,612 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:04,612 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:04,612 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-13 13:13:04,612 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:04,613 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:04,613 INFO L85 PathProgramCache]: Analyzing trace with hash -1985462566, now seen corresponding path program 1 times [2024-11-13 13:13:04,613 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:04,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324042337] [2024-11-13 13:13:04,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:04,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:04,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:06,387 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:06,388 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:06,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1324042337] [2024-11-13 13:13:06,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1324042337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:06,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:06,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-13 13:13:06,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1170066805] [2024-11-13 13:13:06,388 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:06,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:13:06,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:06,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:13:06,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:13:06,882 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 58 out of 129 [2024-11-13 13:13:06,883 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 92 transitions, 194 flow. Second operand has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:06,884 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:06,884 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 58 of 129 [2024-11-13 13:13:06,884 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:08,036 INFO L124 PetriNetUnfolderBase]: 2065/4255 cut-off events. [2024-11-13 13:13:08,036 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2024-11-13 13:13:08,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7679 conditions, 4255 events. 2065/4255 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 29519 event pairs, 289 based on Foata normal form. 0/3449 useless extension candidates. Maximal degree in co-relation 2494. Up to 2157 conditions per place. [2024-11-13 13:13:08,059 INFO L140 encePairwiseOnDemand]: 120/129 looper letters, 132 selfloop transitions, 11 changer transitions 0/182 dead transitions. [2024-11-13 13:13:08,059 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 182 transitions, 667 flow [2024-11-13 13:13:08,060 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-13 13:13:08,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2024-11-13 13:13:08,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 551 transitions. [2024-11-13 13:13:08,062 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6101882613510521 [2024-11-13 13:13:08,063 INFO L175 Difference]: Start difference. First operand has 91 places, 92 transitions, 194 flow. Second operand 7 states and 551 transitions. [2024-11-13 13:13:08,063 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 182 transitions, 667 flow [2024-11-13 13:13:08,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 182 transitions, 659 flow, removed 0 selfloop flow, removed 3 redundant places. [2024-11-13 13:13:08,069 INFO L231 Difference]: Finished difference. Result has 98 places, 102 transitions, 262 flow [2024-11-13 13:13:08,070 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=188, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=92, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=98, PETRI_TRANSITIONS=102} [2024-11-13 13:13:08,070 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-13 13:13:08,071 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 102 transitions, 262 flow [2024-11-13 13:13:08,071 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 59.857142857142854) internal successors, (419), 7 states have internal predecessors, (419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,071 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:08,071 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:08,071 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-13 13:13:08,072 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:08,072 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:08,072 INFO L85 PathProgramCache]: Analyzing trace with hash -334785235, now seen corresponding path program 1 times [2024-11-13 13:13:08,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:08,072 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275273695] [2024-11-13 13:13:08,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:08,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:08,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:08,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:08,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:08,393 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275273695] [2024-11-13 13:13:08,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275273695] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:08,393 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:08,393 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:08,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932982436] [2024-11-13 13:13:08,394 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:08,394 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:08,394 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:08,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:08,395 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:08,397 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-13 13:13:08,399 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 102 transitions, 262 flow. Second operand has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,399 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:08,399 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-13 13:13:08,399 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:08,718 INFO L124 PetriNetUnfolderBase]: 692/1652 cut-off events. [2024-11-13 13:13:08,718 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2024-11-13 13:13:08,722 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3114 conditions, 1652 events. 692/1652 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 10253 event pairs, 446 based on Foata normal form. 43/1432 useless extension candidates. Maximal degree in co-relation 3071. Up to 693 conditions per place. [2024-11-13 13:13:08,728 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 59 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-13 13:13:08,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 109 transitions, 391 flow [2024-11-13 13:13:08,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:08,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:13:08,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 281 transitions. [2024-11-13 13:13:08,730 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7260981912144703 [2024-11-13 13:13:08,730 INFO L175 Difference]: Start difference. First operand has 98 places, 102 transitions, 262 flow. Second operand 3 states and 281 transitions. [2024-11-13 13:13:08,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 109 transitions, 391 flow [2024-11-13 13:13:08,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 97 places, 109 transitions, 387 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 13:13:08,737 INFO L231 Difference]: Finished difference. Result has 98 places, 98 transitions, 249 flow [2024-11-13 13:13:08,737 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=98, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=249, PETRI_PLACES=98, PETRI_TRANSITIONS=98} [2024-11-13 13:13:08,738 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-13 13:13:08,740 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 98 transitions, 249 flow [2024-11-13 13:13:08,740 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 78.0) internal successors, (234), 3 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,740 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:08,741 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:08,741 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-13 13:13:08,741 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting t2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:08,741 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:08,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1582890958, now seen corresponding path program 1 times [2024-11-13 13:13:08,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:08,742 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1248673490] [2024-11-13 13:13:08,742 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:08,742 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:08,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:08,909 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:08,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:08,910 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1248673490] [2024-11-13 13:13:08,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1248673490] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:08,910 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:08,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:13:08,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321518019] [2024-11-13 13:13:08,910 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:08,911 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:08,911 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:08,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:08,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:08,914 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-13 13:13:08,915 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 98 transitions, 249 flow. Second operand has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:08,915 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:08,915 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-13 13:13:08,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:09,232 INFO L124 PetriNetUnfolderBase]: 572/1382 cut-off events. [2024-11-13 13:13:09,232 INFO L125 PetriNetUnfolderBase]: For 67/67 co-relation queries the response was YES. [2024-11-13 13:13:09,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2663 conditions, 1382 events. 572/1382 cut-off events. For 67/67 co-relation queries the response was YES. Maximal size of possible extension queue 51. Compared 7596 event pairs, 380 based on Foata normal form. 12/1194 useless extension candidates. Maximal degree in co-relation 1698. Up to 753 conditions per place. [2024-11-13 13:13:09,238 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 62 selfloop transitions, 2 changer transitions 0/111 dead transitions. [2024-11-13 13:13:09,238 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 100 places, 111 transitions, 401 flow [2024-11-13 13:13:09,239 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:09,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:13:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 287 transitions. [2024-11-13 13:13:09,240 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7416020671834626 [2024-11-13 13:13:09,240 INFO L175 Difference]: Start difference. First operand has 98 places, 98 transitions, 249 flow. Second operand 3 states and 287 transitions. [2024-11-13 13:13:09,240 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 100 places, 111 transitions, 401 flow [2024-11-13 13:13:09,242 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 111 transitions, 393 flow, removed 1 selfloop flow, removed 2 redundant places. [2024-11-13 13:13:09,246 INFO L231 Difference]: Finished difference. Result has 99 places, 98 transitions, 248 flow [2024-11-13 13:13:09,246 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=248, PETRI_PLACES=99, PETRI_TRANSITIONS=98} [2024-11-13 13:13:09,247 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -23 predicate places. [2024-11-13 13:13:09,247 INFO L471 AbstractCegarLoop]: Abstraction has has 99 places, 98 transitions, 248 flow [2024-11-13 13:13:09,247 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.33333333333333) internal successors, (238), 3 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:09,247 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:09,247 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:09,247 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-13 13:13:09,247 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:09,248 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:09,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2081899848, now seen corresponding path program 1 times [2024-11-13 13:13:09,248 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:09,248 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2019462702] [2024-11-13 13:13:09,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:09,248 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:09,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:09,556 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:09,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:09,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2019462702] [2024-11-13 13:13:09,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2019462702] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:09,556 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:09,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:13:09,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794756482] [2024-11-13 13:13:09,557 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:09,557 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:13:09,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:09,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:13:09,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:13:09,720 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 129 [2024-11-13 13:13:09,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 98 transitions, 248 flow. Second operand has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:09,721 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:09,721 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 129 [2024-11-13 13:13:09,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:10,051 INFO L124 PetriNetUnfolderBase]: 572/1349 cut-off events. [2024-11-13 13:13:10,051 INFO L125 PetriNetUnfolderBase]: For 109/109 co-relation queries the response was YES. [2024-11-13 13:13:10,054 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2660 conditions, 1349 events. 572/1349 cut-off events. For 109/109 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7248 event pairs, 515 based on Foata normal form. 31/1215 useless extension candidates. Maximal degree in co-relation 809. Up to 1007 conditions per place. [2024-11-13 13:13:10,058 INFO L140 encePairwiseOnDemand]: 126/129 looper letters, 50 selfloop transitions, 1 changer transitions 0/96 dead transitions. [2024-11-13 13:13:10,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 96 transitions, 346 flow [2024-11-13 13:13:10,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:13:10,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:13:10,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 265 transitions. [2024-11-13 13:13:10,060 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6847545219638242 [2024-11-13 13:13:10,060 INFO L175 Difference]: Start difference. First operand has 99 places, 98 transitions, 248 flow. Second operand 3 states and 265 transitions. [2024-11-13 13:13:10,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 96 transitions, 346 flow [2024-11-13 13:13:10,062 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 344 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:13:10,065 INFO L231 Difference]: Finished difference. Result has 98 places, 96 transitions, 244 flow [2024-11-13 13:13:10,065 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=242, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=95, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=244, PETRI_PLACES=98, PETRI_TRANSITIONS=96} [2024-11-13 13:13:10,067 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -24 predicate places. [2024-11-13 13:13:10,067 INFO L471 AbstractCegarLoop]: Abstraction has has 98 places, 96 transitions, 244 flow [2024-11-13 13:13:10,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 77.33333333333333) internal successors, (232), 3 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:10,067 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:10,068 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:13:10,068 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-13 13:13:10,068 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:10,068 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:10,068 INFO L85 PathProgramCache]: Analyzing trace with hash 2081899849, now seen corresponding path program 1 times [2024-11-13 13:13:10,068 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:10,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165913226] [2024-11-13 13:13:10,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:10,507 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:10,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:10,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165913226] [2024-11-13 13:13:10,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1165913226] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:10,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:10,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-13 13:13:10,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1017340773] [2024-11-13 13:13:10,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:10,508 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-13 13:13:10,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:10,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-13 13:13:10,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-13 13:13:10,666 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-13 13:13:10,666 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 96 transitions, 244 flow. Second operand has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:10,667 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:10,667 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-13 13:13:10,667 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:10,979 INFO L124 PetriNetUnfolderBase]: 587/1354 cut-off events. [2024-11-13 13:13:10,980 INFO L125 PetriNetUnfolderBase]: For 79/79 co-relation queries the response was YES. [2024-11-13 13:13:10,982 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2686 conditions, 1354 events. 587/1354 cut-off events. For 79/79 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 7168 event pairs, 395 based on Foata normal form. 12/1197 useless extension candidates. Maximal degree in co-relation 2674. Up to 779 conditions per place. [2024-11-13 13:13:10,987 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 62 selfloop transitions, 3 changer transitions 0/109 dead transitions. [2024-11-13 13:13:10,989 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 109 transitions, 401 flow [2024-11-13 13:13:10,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-13 13:13:10,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2024-11-13 13:13:10,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 358 transitions. [2024-11-13 13:13:10,991 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6937984496124031 [2024-11-13 13:13:10,991 INFO L175 Difference]: Start difference. First operand has 98 places, 96 transitions, 244 flow. Second operand 4 states and 358 transitions. [2024-11-13 13:13:10,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 109 transitions, 401 flow [2024-11-13 13:13:10,993 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 109 transitions, 400 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:13:10,995 INFO L231 Difference]: Finished difference. Result has 101 places, 96 transitions, 253 flow [2024-11-13 13:13:10,996 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=243, PETRI_DIFFERENCE_MINUEND_PLACES=97, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=96, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=253, PETRI_PLACES=101, PETRI_TRANSITIONS=96} [2024-11-13 13:13:10,996 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -21 predicate places. [2024-11-13 13:13:10,996 INFO L471 AbstractCegarLoop]: Abstraction has has 101 places, 96 transitions, 253 flow [2024-11-13 13:13:10,997 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 77.0) internal successors, (308), 4 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:10,997 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:10,997 INFO L204 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] [2024-11-13 13:13:10,997 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-13 13:13:10,997 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:10,998 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:10,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1742048885, now seen corresponding path program 1 times [2024-11-13 13:13:10,998 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:10,998 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719269672] [2024-11-13 13:13:10,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:10,998 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:11,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:12,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:12,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:12,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719269672] [2024-11-13 13:13:12,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719269672] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:13:12,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:13:12,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-13 13:13:12,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532228012] [2024-11-13 13:13:12,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:13:12,629 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-13 13:13:12,629 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:12,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-13 13:13:12,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-13 13:13:13,241 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 68 out of 129 [2024-11-13 13:13:13,243 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 96 transitions, 253 flow. Second operand has 10 states, 10 states have (on average 70.2) internal successors, (702), 10 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:13,243 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:13:13,243 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 68 of 129 [2024-11-13 13:13:13,244 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:13:13,845 INFO L124 PetriNetUnfolderBase]: 643/1398 cut-off events. [2024-11-13 13:13:13,845 INFO L125 PetriNetUnfolderBase]: For 140/140 co-relation queries the response was YES. [2024-11-13 13:13:13,848 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2879 conditions, 1398 events. 643/1398 cut-off events. For 140/140 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 7121 event pairs, 168 based on Foata normal form. 0/1261 useless extension candidates. Maximal degree in co-relation 2865. Up to 771 conditions per place. [2024-11-13 13:13:13,852 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 93 selfloop transitions, 9 changer transitions 0/139 dead transitions. [2024-11-13 13:13:13,852 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 109 places, 139 transitions, 547 flow [2024-11-13 13:13:13,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-13 13:13:13,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2024-11-13 13:13:13,854 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 714 transitions. [2024-11-13 13:13:13,855 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6149870801033591 [2024-11-13 13:13:13,855 INFO L175 Difference]: Start difference. First operand has 101 places, 96 transitions, 253 flow. Second operand 9 states and 714 transitions. [2024-11-13 13:13:13,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 109 places, 139 transitions, 547 flow [2024-11-13 13:13:13,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 139 transitions, 539 flow, removed 1 selfloop flow, removed 3 redundant places. [2024-11-13 13:13:13,859 INFO L231 Difference]: Finished difference. Result has 108 places, 97 transitions, 274 flow [2024-11-13 13:13:13,859 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=240, PETRI_DIFFERENCE_MINUEND_PLACES=98, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=95, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=86, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=274, PETRI_PLACES=108, PETRI_TRANSITIONS=97} [2024-11-13 13:13:13,860 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -14 predicate places. [2024-11-13 13:13:13,862 INFO L471 AbstractCegarLoop]: Abstraction has has 108 places, 97 transitions, 274 flow [2024-11-13 13:13:13,863 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 70.2) internal successors, (702), 10 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:13:13,863 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:13:13,863 INFO L204 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] [2024-11-13 13:13:13,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-13 13:13:13,863 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:13:13,863 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:13:13,863 INFO L85 PathProgramCache]: Analyzing trace with hash -497247543, now seen corresponding path program 1 times [2024-11-13 13:13:13,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:13:13,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432552013] [2024-11-13 13:13:13,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:13,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:13:14,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:15,960 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:15,961 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:13:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432552013] [2024-11-13 13:13:15,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [432552013] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:13:15,961 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1583703497] [2024-11-13 13:13:15,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:13:15,961 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:13:15,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:13:15,964 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:13:15,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-13 13:13:16,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:13:16,460 INFO L255 TraceCheckSpWp]: Trace formula consists of 1920 conjuncts, 49 conjuncts are in the unsatisfiable core [2024-11-13 13:13:16,471 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:13:16,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:13:16,641 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 [2024-11-13 13:13:16,887 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:16,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 27 treesize of output 11 [2024-11-13 13:13:16,932 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 [2024-11-13 13:13:17,047 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 [2024-11-13 13:13:17,178 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:17,178 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:13:39,386 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-13 13:13:39,387 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 210 treesize of output 234 [2024-11-13 13:13:39,426 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,426 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 141 treesize of output 139 [2024-11-13 13:13:39,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:13:39,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 91 treesize of output 93 [2024-11-13 13:13:39,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:39,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:39,765 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:13:39,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 42 treesize of output 47 [2024-11-13 13:13:39,776 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 34 treesize of output 30 [2024-11-13 13:13:39,782 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:13:39,787 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:13:39,788 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-13 13:13:39,917 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:13:39,917 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1583703497] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:13:39,918 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:13:39,918 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2024-11-13 13:13:39,918 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1012509830] [2024-11-13 13:13:39,918 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:13:39,919 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-13 13:13:39,919 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:13:39,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-13 13:13:39,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=776, Unknown=3, NotChecked=0, Total=930 [2024-11-13 13:13:44,166 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] [2024-11-13 13:13:48,435 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] [2024-11-13 13:13:53,063 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] [2024-11-13 13:13:57,599 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] [2024-11-13 13:14:01,790 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] [2024-11-13 13:14:07,473 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] [2024-11-13 13:14:11,707 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] [2024-11-13 13:14:16,294 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] [2024-11-13 13:14:18,327 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:14:22,370 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] [2024-11-13 13:14:23,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:14:25,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:14:30,808 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] [2024-11-13 13:14:35,007 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] [2024-11-13 13:14:39,260 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] [2024-11-13 13:14:40,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:14:45,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] [2024-11-13 13:14:50,041 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] [2024-11-13 13:14:54,289 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] [2024-11-13 13:14:59,439 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] [2024-11-13 13:15:03,785 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] [2024-11-13 13:15:05,676 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:15:10,155 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] [2024-11-13 13:15:12,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.49s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:15:16,988 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] [2024-11-13 13:15:20,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:15:22,470 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.52s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:15:27,027 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] [2024-11-13 13:15:32,178 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] [2024-11-13 13:15:36,358 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] [2024-11-13 13:15:36,358 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 129 [2024-11-13 13:15:36,360 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 108 places, 97 transitions, 274 flow. Second operand has 31 states, 31 states have (on average 37.41935483870968) internal successors, (1160), 31 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:36,360 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:15:36,360 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 129 [2024-11-13 13:15:36,360 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:15:40,479 INFO L124 PetriNetUnfolderBase]: 1427/2840 cut-off events. [2024-11-13 13:15:40,479 INFO L125 PetriNetUnfolderBase]: For 233/233 co-relation queries the response was YES. [2024-11-13 13:15:40,488 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6104 conditions, 2840 events. 1427/2840 cut-off events. For 233/233 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 15480 event pairs, 253 based on Foata normal form. 24/2638 useless extension candidates. Maximal degree in co-relation 6088. Up to 953 conditions per place. [2024-11-13 13:15:40,498 INFO L140 encePairwiseOnDemand]: 119/129 looper letters, 203 selfloop transitions, 19 changer transitions 0/244 dead transitions. [2024-11-13 13:15:40,498 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 121 places, 244 transitions, 1067 flow [2024-11-13 13:15:40,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-13 13:15:40,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2024-11-13 13:15:40,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 713 transitions. [2024-11-13 13:15:40,502 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.3947951273532669 [2024-11-13 13:15:40,502 INFO L175 Difference]: Start difference. First operand has 108 places, 97 transitions, 274 flow. Second operand 14 states and 713 transitions. [2024-11-13 13:15:40,502 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 121 places, 244 transitions, 1067 flow [2024-11-13 13:15:40,505 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 115 places, 244 transitions, 1053 flow, removed 0 selfloop flow, removed 6 redundant places. [2024-11-13 13:15:40,508 INFO L231 Difference]: Finished difference. Result has 118 places, 110 transitions, 362 flow [2024-11-13 13:15:40,508 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=362, PETRI_PLACES=118, PETRI_TRANSITIONS=110} [2024-11-13 13:15:40,508 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -4 predicate places. [2024-11-13 13:15:40,509 INFO L471 AbstractCegarLoop]: Abstraction has has 118 places, 110 transitions, 362 flow [2024-11-13 13:15:40,509 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 37.41935483870968) internal successors, (1160), 31 states have internal predecessors, (1160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:40,509 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:15:40,510 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:40,534 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-13 13:15:40,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:40,715 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:15:40,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:40,716 INFO L85 PathProgramCache]: Analyzing trace with hash -1056499825, now seen corresponding path program 1 times [2024-11-13 13:15:40,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:40,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707781043] [2024-11-13 13:15:40,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:40,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:40,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:40,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:40,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:40,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707781043] [2024-11-13 13:15:40,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707781043] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:40,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:40,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-11-13 13:15:40,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1450331554] [2024-11-13 13:15:40,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:40,933 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:40,934 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:40,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:40,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:41,058 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-13 13:15:41,059 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 118 places, 110 transitions, 362 flow. Second operand has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:41,059 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:15:41,059 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-13 13:15:41,059 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:15:41,475 INFO L124 PetriNetUnfolderBase]: 1053/2457 cut-off events. [2024-11-13 13:15:41,475 INFO L125 PetriNetUnfolderBase]: For 403/403 co-relation queries the response was YES. [2024-11-13 13:15:41,483 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5304 conditions, 2457 events. 1053/2457 cut-off events. For 403/403 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 14969 event pairs, 968 based on Foata normal form. 7/2173 useless extension candidates. Maximal degree in co-relation 5285. Up to 1870 conditions per place. [2024-11-13 13:15:41,490 INFO L140 encePairwiseOnDemand]: 127/129 looper letters, 60 selfloop transitions, 1 changer transitions 3/109 dead transitions. [2024-11-13 13:15:41,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 119 places, 109 transitions, 486 flow [2024-11-13 13:15:41,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:41,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:15:41,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 267 transitions. [2024-11-13 13:15:41,492 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.689922480620155 [2024-11-13 13:15:41,492 INFO L175 Difference]: Start difference. First operand has 118 places, 110 transitions, 362 flow. Second operand 3 states and 267 transitions. [2024-11-13 13:15:41,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 119 places, 109 transitions, 486 flow [2024-11-13 13:15:41,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 114 places, 109 transitions, 458 flow, removed 9 selfloop flow, removed 5 redundant places. [2024-11-13 13:15:41,499 INFO L231 Difference]: Finished difference. Result has 114 places, 106 transitions, 326 flow [2024-11-13 13:15:41,499 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=332, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=109, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=108, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=326, PETRI_PLACES=114, PETRI_TRANSITIONS=106} [2024-11-13 13:15:41,499 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -8 predicate places. [2024-11-13 13:15:41,499 INFO L471 AbstractCegarLoop]: Abstraction has has 114 places, 106 transitions, 326 flow [2024-11-13 13:15:41,500 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 79.66666666666667) internal successors, (239), 3 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:41,500 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:15:41,500 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:41,500 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-13 13:15:41,500 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:15:41,501 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:41,501 INFO L85 PathProgramCache]: Analyzing trace with hash -661873306, now seen corresponding path program 1 times [2024-11-13 13:15:41,501 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:41,501 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1172247680] [2024-11-13 13:15:41,501 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:41,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:41,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:41,787 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-13 13:15:41,788 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:41,788 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1172247680] [2024-11-13 13:15:41,788 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1172247680] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-13 13:15:41,788 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-13 13:15:41,788 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-13 13:15:41,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117308952] [2024-11-13 13:15:41,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-13 13:15:41,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-13 13:15:41,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:41,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-13 13:15:41,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-13 13:15:41,791 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-13 13:15:41,792 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 114 places, 106 transitions, 326 flow. Second operand has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:41,792 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:15:41,792 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-13 13:15:41,792 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:15:42,088 INFO L124 PetriNetUnfolderBase]: 697/1808 cut-off events. [2024-11-13 13:15:42,088 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2024-11-13 13:15:42,094 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3833 conditions, 1808 events. 697/1808 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 10210 event pairs, 123 based on Foata normal form. 72/1675 useless extension candidates. Maximal degree in co-relation 3815. Up to 1078 conditions per place. [2024-11-13 13:15:42,100 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 65 selfloop transitions, 4 changer transitions 0/114 dead transitions. [2024-11-13 13:15:42,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 114 places, 114 transitions, 482 flow [2024-11-13 13:15:42,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-13 13:15:42,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2024-11-13 13:15:42,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 277 transitions. [2024-11-13 13:15:42,102 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7157622739018088 [2024-11-13 13:15:42,102 INFO L175 Difference]: Start difference. First operand has 114 places, 106 transitions, 326 flow. Second operand 3 states and 277 transitions. [2024-11-13 13:15:42,102 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 114 places, 114 transitions, 482 flow [2024-11-13 13:15:42,105 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 113 places, 114 transitions, 481 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:15:42,107 INFO L231 Difference]: Finished difference. Result has 113 places, 106 transitions, 333 flow [2024-11-13 13:15:42,107 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=325, PETRI_DIFFERENCE_MINUEND_PLACES=111, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=102, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=333, PETRI_PLACES=113, PETRI_TRANSITIONS=106} [2024-11-13 13:15:42,108 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -9 predicate places. [2024-11-13 13:15:42,108 INFO L471 AbstractCegarLoop]: Abstraction has has 113 places, 106 transitions, 333 flow [2024-11-13 13:15:42,108 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 82.33333333333333) internal successors, (247), 3 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:42,108 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:15:42,108 INFO L204 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:42,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-13 13:15:42,109 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting t2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:15:42,109 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:42,109 INFO L85 PathProgramCache]: Analyzing trace with hash 769866000, now seen corresponding path program 1 times [2024-11-13 13:15:42,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:42,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [130936018] [2024-11-13 13:15:42,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:42,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:42,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:42,311 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:42,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:42,311 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [130936018] [2024-11-13 13:15:42,311 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [130936018] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:42,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1825535442] [2024-11-13 13:15:42,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:42,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:42,312 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:42,314 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:42,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-13 13:15:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:42,778 INFO L255 TraceCheckSpWp]: Trace formula consists of 1951 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-13 13:15:42,780 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:42,820 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:42,820 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:42,879 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:42,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1825535442] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:42,881 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:42,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-13 13:15:42,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611881691] [2024-11-13 13:15:42,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:42,882 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-13 13:15:42,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:42,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-13 13:15:42,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-13 13:15:42,900 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 74 out of 129 [2024-11-13 13:15:42,901 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 113 places, 106 transitions, 333 flow. Second operand has 7 states, 7 states have (on average 80.71428571428571) internal successors, (565), 7 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:42,901 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:15:42,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 74 of 129 [2024-11-13 13:15:42,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:15:43,582 INFO L124 PetriNetUnfolderBase]: 1067/2622 cut-off events. [2024-11-13 13:15:43,583 INFO L125 PetriNetUnfolderBase]: For 372/372 co-relation queries the response was YES. [2024-11-13 13:15:43,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5969 conditions, 2622 events. 1067/2622 cut-off events. For 372/372 co-relation queries the response was YES. Maximal size of possible extension queue 49. Compared 14327 event pairs, 352 based on Foata normal form. 60/2433 useless extension candidates. Maximal degree in co-relation 5951. Up to 733 conditions per place. [2024-11-13 13:15:43,596 INFO L140 encePairwiseOnDemand]: 125/129 looper letters, 106 selfloop transitions, 8 changer transitions 0/159 dead transitions. [2024-11-13 13:15:43,596 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 118 places, 159 transitions, 734 flow [2024-11-13 13:15:43,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-13 13:15:43,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2024-11-13 13:15:43,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 542 transitions. [2024-11-13 13:15:43,599 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.7002583979328165 [2024-11-13 13:15:43,599 INFO L175 Difference]: Start difference. First operand has 113 places, 106 transitions, 333 flow. Second operand 6 states and 542 transitions. [2024-11-13 13:15:43,599 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 118 places, 159 transitions, 734 flow [2024-11-13 13:15:43,605 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 117 places, 159 transitions, 730 flow, removed 0 selfloop flow, removed 1 redundant places. [2024-11-13 13:15:43,607 INFO L231 Difference]: Finished difference. Result has 121 places, 111 transitions, 391 flow [2024-11-13 13:15:43,608 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=329, PETRI_DIFFERENCE_MINUEND_PLACES=112, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=100, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=391, PETRI_PLACES=121, PETRI_TRANSITIONS=111} [2024-11-13 13:15:43,608 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, -1 predicate places. [2024-11-13 13:15:43,609 INFO L471 AbstractCegarLoop]: Abstraction has has 121 places, 111 transitions, 391 flow [2024-11-13 13:15:43,609 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 80.71428571428571) internal successors, (565), 7 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:43,609 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:15:43,609 INFO L204 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] [2024-11-13 13:15:43,636 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-13 13:15:43,810 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-13 13:15:43,810 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:15:43,811 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:43,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1223725446, now seen corresponding path program 1 times [2024-11-13 13:15:43,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:43,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588224125] [2024-11-13 13:15:43,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:43,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:43,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:44,412 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:44,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588224125] [2024-11-13 13:15:44,414 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588224125] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:44,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [220620920] [2024-11-13 13:15:44,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:44,414 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:44,414 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:44,418 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:44,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-13 13:15:44,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:44,944 INFO L255 TraceCheckSpWp]: Trace formula consists of 1988 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-13 13:15:44,947 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:45,504 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:45,504 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:45,905 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:45,905 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [220620920] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:45,905 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:45,905 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 10 [2024-11-13 13:15:45,905 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1992783617] [2024-11-13 13:15:45,909 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:45,909 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-13 13:15:45,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:45,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-13 13:15:45,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2024-11-13 13:15:47,660 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 129 [2024-11-13 13:15:47,661 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 121 places, 111 transitions, 391 flow. Second operand has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:47,661 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:15:47,661 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 129 [2024-11-13 13:15:47,661 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:15:48,678 INFO L124 PetriNetUnfolderBase]: 1067/2554 cut-off events. [2024-11-13 13:15:48,679 INFO L125 PetriNetUnfolderBase]: For 695/695 co-relation queries the response was YES. [2024-11-13 13:15:48,687 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6191 conditions, 2554 events. 1067/2554 cut-off events. For 695/695 co-relation queries the response was YES. Maximal size of possible extension queue 48. Compared 13429 event pairs, 151 based on Foata normal form. 80/2388 useless extension candidates. Maximal degree in co-relation 6169. Up to 603 conditions per place. [2024-11-13 13:15:48,702 INFO L140 encePairwiseOnDemand]: 124/129 looper letters, 111 selfloop transitions, 9 changer transitions 4/168 dead transitions. [2024-11-13 13:15:48,702 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 127 places, 168 transitions, 819 flow [2024-11-13 13:15:48,705 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-13 13:15:48,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2024-11-13 13:15:48,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 692 transitions. [2024-11-13 13:15:48,708 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.6705426356589147 [2024-11-13 13:15:48,708 INFO L175 Difference]: Start difference. First operand has 121 places, 111 transitions, 391 flow. Second operand 8 states and 692 transitions. [2024-11-13 13:15:48,708 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 127 places, 168 transitions, 819 flow [2024-11-13 13:15:48,719 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 125 places, 168 transitions, 809 flow, removed 3 selfloop flow, removed 2 redundant places. [2024-11-13 13:15:48,727 INFO L231 Difference]: Finished difference. Result has 125 places, 110 transitions, 395 flow [2024-11-13 13:15:48,727 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=377, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=101, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=395, PETRI_PLACES=125, PETRI_TRANSITIONS=110} [2024-11-13 13:15:48,728 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 3 predicate places. [2024-11-13 13:15:48,728 INFO L471 AbstractCegarLoop]: Abstraction has has 125 places, 110 transitions, 395 flow [2024-11-13 13:15:48,732 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 79.25) internal successors, (951), 12 states have internal predecessors, (951), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:15:48,732 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:15:48,732 INFO L204 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-13 13:15:48,765 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-13 13:15:48,933 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-13 13:15:48,933 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:15:48,934 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:15:48,937 INFO L85 PathProgramCache]: Analyzing trace with hash -320360917, now seen corresponding path program 1 times [2024-11-13 13:15:48,937 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:15:48,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180932258] [2024-11-13 13:15:48,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:48,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:15:49,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:54,020 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 13 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:15:54,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:15:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180932258] [2024-11-13 13:15:54,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180932258] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:15:54,021 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [200321078] [2024-11-13 13:15:54,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:15:54,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:15:54,022 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:15:54,024 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:15:54,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-13 13:15:54,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:15:54,581 INFO L255 TraceCheckSpWp]: Trace formula consists of 2141 conjuncts, 28 conjuncts are in the unsatisfiable core [2024-11-13 13:15:54,586 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:15:55,123 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:15:55,291 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 19 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 13:15:55,291 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:15:55,481 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 35 [2024-11-13 13:15:55,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:55,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:15:55,927 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 12 proven. 13 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2024-11-13 13:15:55,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [200321078] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:15:55,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:15:55,928 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 5, 5] total 26 [2024-11-13 13:15:55,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133841734] [2024-11-13 13:15:55,928 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:15:55,928 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-13 13:15:55,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:15:55,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-13 13:15:55,930 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=612, Unknown=0, NotChecked=0, Total=702 [2024-11-13 13:16:01,966 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 59 out of 129 [2024-11-13 13:16:01,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 125 places, 110 transitions, 395 flow. Second operand has 27 states, 27 states have (on average 63.2962962962963) internal successors, (1709), 27 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:01,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:16:01,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 59 of 129 [2024-11-13 13:16:01,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:16:04,728 INFO L124 PetriNetUnfolderBase]: 1072/2409 cut-off events. [2024-11-13 13:16:04,728 INFO L125 PetriNetUnfolderBase]: For 598/598 co-relation queries the response was YES. [2024-11-13 13:16:04,737 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5888 conditions, 2409 events. 1072/2409 cut-off events. For 598/598 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 11682 event pairs, 143 based on Foata normal form. 20/2233 useless extension candidates. Maximal degree in co-relation 5865. Up to 398 conditions per place. [2024-11-13 13:16:04,745 INFO L140 encePairwiseOnDemand]: 115/129 looper letters, 162 selfloop transitions, 40 changer transitions 6/240 dead transitions. [2024-11-13 13:16:04,745 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 143 places, 240 transitions, 1168 flow [2024-11-13 13:16:04,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-13 13:16:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2024-11-13 13:16:04,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 1319 transitions. [2024-11-13 13:16:04,750 INFO L512 CegarLoopForPetriNet]: DFA transition density 0.5381476948184415 [2024-11-13 13:16:04,750 INFO L175 Difference]: Start difference. First operand has 125 places, 110 transitions, 395 flow. Second operand 19 states and 1319 transitions. [2024-11-13 13:16:04,750 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 143 places, 240 transitions, 1168 flow [2024-11-13 13:16:04,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 240 transitions, 1135 flow, removed 5 selfloop flow, removed 7 redundant places. [2024-11-13 13:16:04,759 INFO L231 Difference]: Finished difference. Result has 141 places, 123 transitions, 554 flow [2024-11-13 13:16:04,760 INFO L260 CegarLoopForPetriNet]: {PETRI_ALPHABET=129, PETRI_DIFFERENCE_MINUEND_FLOW=346, PETRI_DIFFERENCE_MINUEND_PLACES=118, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=106, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=29, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=554, PETRI_PLACES=141, PETRI_TRANSITIONS=123} [2024-11-13 13:16:04,760 INFO L277 CegarLoopForPetriNet]: 122 programPoint places, 19 predicate places. [2024-11-13 13:16:04,761 INFO L471 AbstractCegarLoop]: Abstraction has has 141 places, 123 transitions, 554 flow [2024-11-13 13:16:04,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 63.2962962962963) internal successors, (1709), 27 states have internal predecessors, (1709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:16:04,762 INFO L196 CegarLoopForPetriNet]: Found error trace [2024-11-13 13:16:04,762 INFO L204 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] [2024-11-13 13:16:04,791 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-13 13:16:04,963 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-13 13:16:04,963 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 93 more)] === [2024-11-13 13:16:04,963 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-13 13:16:04,963 INFO L85 PathProgramCache]: Analyzing trace with hash 625406505, now seen corresponding path program 2 times [2024-11-13 13:16:04,963 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-13 13:16:04,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [370905180] [2024-11-13 13:16:04,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-13 13:16:04,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-13 13:16:05,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-13 13:16:10,321 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:10,321 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-13 13:16:10,321 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [370905180] [2024-11-13 13:16:10,322 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [370905180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-13 13:16:10,322 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1337687016] [2024-11-13 13:16:10,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-13 13:16:10,322 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-13 13:16:10,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 [2024-11-13 13:16:10,324 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-13 13:16:10,325 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3305861d-fad3-4f93-8df7-8ecccc18d57a/bin/uautomizer-verify-qhAvR1uOyd/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-13 13:16:11,112 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-13 13:16:11,112 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-13 13:16:11,131 INFO L255 TraceCheckSpWp]: Trace formula consists of 2148 conjuncts, 100 conjuncts are in the unsatisfiable core [2024-11-13 13:16:11,140 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-13 13:16:11,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-13 13:16:11,316 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 [2024-11-13 13:16:11,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:16:11,624 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 [2024-11-13 13:16:11,688 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 [2024-11-13 13:16:11,813 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 [2024-11-13 13:16:12,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:16:12,063 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 [2024-11-13 13:16:12,106 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 [2024-11-13 13:16:12,242 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 [2024-11-13 13:16:12,485 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 [2024-11-13 13:16:12,541 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 [2024-11-13 13:16:12,676 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 [2024-11-13 13:16:12,890 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 42 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-13 13:16:12,890 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-13 13:16:43,836 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604) (+ 1 |c_t1Thread1of1ForFork0_enqueue_#t~post41#1|))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ (* (select .cse0 .cse2) 4) |c_~#queue~0.offset|))) (and (forall ((v_ArrVal_1074 Int)) (<= 0 (+ (* (select (store .cse0 .cse1 v_ArrVal_1074) .cse2) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_1074 Int)) (<= (+ (* (select (store .cse0 .cse1 v_ArrVal_1074) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|)))))) is different from false [2024-11-13 13:17:20,215 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse6 (select .cse5 .cse4)) (.cse3 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* (select (let ((.cse0 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1068))) (store (store .cse2 .cse3 v_ArrVal_1070) .cse4 (+ (select .cse2 .cse4) 1)))) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1074)) .cse1) 4) |c_~#queue~0.offset| 4))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ (* (select (let ((.cse7 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (store .cse5 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1068))) (store (store .cse8 .cse3 v_ArrVal_1070) .cse4 (+ (select .cse8 .cse4) 1)))) |c_~#queue~0.base|))) (store .cse7 (+ (* (select .cse7 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_1074)) .cse1) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|)))))))) is different from false [2024-11-13 13:18:35,091 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse8 (select |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (store .cse8 .cse9 (+ (select .cse8 .cse9) 1)))) |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 1604))) (let ((.cse1 (+ 1608 |c_~#queue~0.offset|)) (.cse5 (select .cse4 .cse2))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (let ((.cse0 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse3 (select .cse0 .cse2))) (store (store (store .cse0 .cse1 v_ArrVal_1070) .cse2 (+ .cse3 1)) (+ (* 4 .cse3) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse2) 4)))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (let ((.cse6 (store .cse4 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse7 (select .cse6 .cse2))) (store (store (store .cse6 .cse1 v_ArrVal_1070) .cse2 (+ .cse7 1)) (+ (* 4 .cse7) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse2) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse5 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))))) is different from false [2024-11-13 13:18:54,938 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (select |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse8 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604))) (let ((.cse0 (select .cse9 .cse8)) (.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 1604)) (.cse7 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse1 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse6 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1062))) (store (store .cse6 .cse7 v_ArrVal_1063) .cse8 (+ (select .cse6 .cse8) 1)))) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* (select (let ((.cse3 (store .cse1 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse5 (select .cse3 .cse2))) (store (store (store .cse3 .cse4 v_ArrVal_1070) .cse2 (+ .cse5 1)) (+ |c_~#queue~0.offset| 4 (* .cse5 4)) v_ArrVal_1074))) .cse2) 4) |c_~#queue~0.offset| 4)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse12 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse13 (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_1062))) (store (store .cse13 .cse7 v_ArrVal_1063) .cse8 (+ (select .cse13 .cse8) 1)))) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ (* (select (let ((.cse10 (store .cse12 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse11 (select .cse10 .cse2))) (store (store (store .cse10 .cse4 v_ArrVal_1070) .cse2 (+ .cse11 1)) (+ |c_~#queue~0.offset| 4 (* .cse11 4)) v_ArrVal_1074))) .cse2) 4) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< (select .cse12 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))))) is different from false [2024-11-13 13:18:58,993 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int#2| |c_~#queue~0.base|)) (.cse4 (+ |c_~#queue~0.offset| 1604))) (let ((.cse3 (+ 1608 |c_~#queue~0.offset|)) (.cse0 (select .cse7 .cse4))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse1 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1062))) (let ((.cse6 (+ (select .cse1 .cse4) 1))) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ (* 4 (select (let ((.cse2 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) (let ((.cse5 (select (store (store (store .cse1 .cse3 v_ArrVal_1063) .cse4 .cse6) .cse2 v_ArrVal_1068) .cse4))) (store (store (store (store .cse1 .cse2 v_ArrVal_1068) .cse3 v_ArrVal_1070) .cse4 (+ .cse5 1)) (+ |c_~#queue~0.offset| 4 (* .cse5 4)) v_ArrVal_1074))) .cse4)) |c_~#queue~0.offset| 8) (select |c_#length| |c_~#queue~0.base|))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int)) (or (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse8 (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1062))) (let ((.cse11 (+ (select .cse8 .cse4) 1))) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* 4 (select (let ((.cse9 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) (let ((.cse10 (select (store (store (store .cse8 .cse3 v_ArrVal_1063) .cse4 .cse11) .cse9 v_ArrVal_1068) .cse4))) (store (store (store (store .cse8 .cse9 v_ArrVal_1068) .cse3 v_ArrVal_1070) .cse4 (+ .cse10 1)) (+ |c_~#queue~0.offset| 4 (* .cse10 4)) v_ArrVal_1074))) .cse4)) |c_~#queue~0.offset| 4))) (< .cse11 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))))) is different from false [2024-11-13 13:19:03,426 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 1608 |c_~#queue~0.offset|)) (.cse1 (+ |c_~#queue~0.offset| 1604)) (.cse7 (select |c_#memory_int#2| |c_ULTIMATE.start_init_~q#1.base|)) (.cse8 (+ 1608 |c_ULTIMATE.start_init_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1060 Int)) (let ((.cse0 (select (store |c_#memory_int#2| |c_ULTIMATE.start_init_~q#1.base| (store .cse7 .cse8 v_ArrVal_1060)) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse2 (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1062))) (let ((.cse6 (+ (select .cse2 .cse1) 1))) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ |c_~#queue~0.offset| 4 (* (select (let ((.cse3 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) (let ((.cse5 (select (store (store (store .cse2 .cse4 v_ArrVal_1063) .cse1 .cse6) .cse3 v_ArrVal_1068) .cse1))) (store (store (store (store .cse2 .cse3 v_ArrVal_1068) .cse4 v_ArrVal_1070) .cse1 (+ .cse5 1)) (+ (* .cse5 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse1) 4)))) (< .cse6 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54| Int) (v_ArrVal_1060 Int)) (let ((.cse13 (select (store |c_#memory_int#2| |c_ULTIMATE.start_init_~q#1.base| (store .cse7 .cse8 v_ArrVal_1060)) |c_~#queue~0.base|))) (or (forall ((v_ArrVal_1062 Int) (v_ArrVal_1063 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (let ((.cse9 (store .cse13 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|) |c_~#queue~0.offset|) v_ArrVal_1062))) (let ((.cse12 (+ (select .cse9 .cse1) 1))) (or (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ |c_~#queue~0.offset| 8 (* (select (let ((.cse10 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)))) (let ((.cse11 (select (store (store (store .cse9 .cse4 v_ArrVal_1063) .cse1 .cse12) .cse10 v_ArrVal_1068) .cse1))) (store (store (store (store .cse9 .cse10 v_ArrVal_1068) .cse4 v_ArrVal_1070) .cse1 (+ .cse11 1)) (+ (* .cse11 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse1) 4)) (select |c_#length| |c_~#queue~0.base|))) (< .cse12 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|))))) (< (select .cse13 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_54|)))))) is different from false [2024-11-13 13:19:03,512 INFO L349 Elim1Store]: treesize reduction 47, result has 52.5 percent of original size [2024-11-13 13:19:03,512 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 420 treesize of output 369 [2024-11-13 13:19:03,541 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:03,541 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 218 treesize of output 208 [2024-11-13 13:19:03,567 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2024-11-13 13:19:03,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:03,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 206 treesize of output 196 [2024-11-13 13:19:03,805 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:19:03,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:19:03,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-13 13:19:03,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 252 treesize of output 182 [2024-11-13 13:19:03,833 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 169 treesize of output 155 [2024-11-13 13:19:03,843 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-13 13:19:03,848 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-13 13:19:03,849 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 105 treesize of output 85 [2024-11-13 13:19:03,970 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 0 proven. 25 refuted. 1 times theorem prover too weak. 0 trivial. 16 not checked. [2024-11-13 13:19:03,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1337687016] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-13 13:19:03,971 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-13 13:19:03,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17, 23] total 58 [2024-11-13 13:19:03,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [624008319] [2024-11-13 13:19:03,971 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-13 13:19:03,971 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2024-11-13 13:19:03,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-13 13:19:03,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2024-11-13 13:19:03,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=422, Invalid=2448, Unknown=16, NotChecked=654, Total=3540 [2024-11-13 13:19:04,198 INFO L467 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 129 [2024-11-13 13:19:04,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 141 places, 123 transitions, 554 flow. Second operand has 60 states, 60 states have (on average 28.4) internal successors, (1704), 60 states have internal predecessors, (1704), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-13 13:19:04,200 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2024-11-13 13:19:04,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 129 [2024-11-13 13:19:04,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2024-11-13 13:19:14,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse11 (+ |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 1604)) (.cse5 (select |c_#memory_int#2| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse3)) (.cse21 (select .cse12 .cse11))) (let ((.cse14 (* .cse21 4)) (.cse7 (* .cse0 4))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse6 (+ .cse7 |c_~#queue~0.offset|)) (.cse10 (+ 1608 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse19 (+ .cse21 1)) (.cse8 (select |c_#length| |c_~#queue~0.base|)) (.cse13 (+ .cse14 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* (select (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse4 (select .cse1 .cse3))) (store (store (store .cse1 .cse2 v_ArrVal_1070) .cse3 (+ .cse4 1)) (+ (* .cse4 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse3) 4) |c_~#queue~0.offset| 4))))) (<= 0 .cse6) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse8) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1074 Int)) (<= (+ |c_~#queue~0.offset| 4 (* (select (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (store .cse12 .cse13 v_ArrVal_1074))) (store (store .cse9 .cse10 v_ArrVal_1075) .cse11 (+ (select .cse9 .cse11) 1)))) |c_~#queue~0.base|) .cse3) 4)) .cse8)) (<= (+ .cse14 4 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (select |c_#length| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (forall ((v_ArrVal_1075 Int) (v_ArrVal_1074 Int)) (<= 0 (+ |c_~#queue~0.offset| (* (select (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse15 (store .cse12 .cse13 v_ArrVal_1074))) (store (store .cse15 .cse10 v_ArrVal_1075) .cse11 (+ (select .cse15 .cse11) 1)))) |c_~#queue~0.base|) .cse3) 4)))) (forall ((v_ArrVal_1074 Int)) (<= (+ (* (select (store .cse5 .cse6 v_ArrVal_1074) .cse3) 4) |c_~#queue~0.offset| 8) .cse8)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ (* (select (let ((.cse16 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse17 (select .cse16 .cse3))) (store (store (store .cse16 .cse2 v_ArrVal_1070) .cse3 (+ .cse17 1)) (+ (* .cse17 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse3) 4) |c_~#queue~0.offset| 8) .cse8)))) (forall ((v_ArrVal_1074 Int)) (<= 0 (+ (* (select (store .cse5 .cse6 v_ArrVal_1074) .cse3) 4) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* 4 (select (let ((.cse18 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse10 v_ArrVal_1070) .cse11 .cse19)) |c_~#queue~0.base|))) (store .cse18 (+ (* (select .cse18 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1074)) .cse3)) |c_~#queue~0.offset| 4))) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1070 Int)) (<= (+ (* 4 (select (let ((.cse20 (select (store |c_#memory_int#2| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse12 .cse10 v_ArrVal_1070) .cse11 .cse19)) |c_~#queue~0.base|))) (store .cse20 (+ (* (select .cse20 .cse3) 4) |c_~#queue~0.offset|) v_ArrVal_1074)) .cse3)) |c_~#queue~0.offset| 8) .cse8)) (<= 0 .cse13)))))) is different from false [2024-11-13 13:19:18,175 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int#2| |c_~#queue~0.base|)) (.cse3 (+ |c_~#queue~0.offset| 1604))) (let ((.cse0 (select .cse5 .cse3))) (let ((.cse7 (* .cse0 4))) (let ((.cse2 (+ 1608 |c_~#queue~0.offset|)) (.cse8 (select |c_#length| |c_~#queue~0.base|)) (.cse6 (+ .cse7 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= 0 (+ (* (select (let ((.cse1 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse4 (select .cse1 .cse3))) (store (store (store .cse1 .cse2 v_ArrVal_1070) .cse3 (+ .cse4 1)) (+ (* .cse4 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse3) 4) |c_~#queue~0.offset| 4))))) (<= 0 .cse6) (<= (+ .cse7 |c_~#queue~0.offset| 4) .cse8) (forall ((v_ArrVal_1074 Int)) (<= (+ (* (select (store .cse5 .cse6 v_ArrVal_1074) .cse3) 4) |c_~#queue~0.offset| 8) .cse8)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|) (forall ((v_ArrVal_1074 Int) (v_ArrVal_1068 Int) (v_ArrVal_1070 Int)) (<= (+ (* (select (let ((.cse9 (store .cse5 (+ |c_~#queue~0.offset| (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_51|)) v_ArrVal_1068))) (let ((.cse10 (select .cse9 .cse3))) (store (store (store .cse9 .cse2 v_ArrVal_1070) .cse3 (+ .cse10 1)) (+ (* .cse10 4) |c_~#queue~0.offset| 4) v_ArrVal_1074))) .cse3) 4) |c_~#queue~0.offset| 8) .cse8)))) (forall ((v_ArrVal_1074 Int)) (<= 0 (+ (* (select (store .cse5 .cse6 v_ArrVal_1074) .cse3) 4) |c_~#queue~0.offset| 4)))))))) is different from false [2024-11-13 13:19:49,153 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] [2024-11-13 13:19:53,159 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] [2024-11-13 13:19:57,165 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] [2024-11-13 13:20:01,171 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] [2024-11-13 13:20:05,178 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] [2024-11-13 13:20:13,833 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] [2024-11-13 13:20:17,837 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] [2024-11-13 13:20:21,854 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] [2024-11-13 13:20:25,860 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] [2024-11-13 13:20:59,322 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] [2024-11-13 13:21:03,330 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] [2024-11-13 13:21:07,337 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] [2024-11-13 13:21:11,345 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] [2024-11-13 13:21:33,583 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] [2024-11-13 13:21:37,748 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] [2024-11-13 13:21:42,144 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] [2024-11-13 13:22:08,875 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] [2024-11-13 13:22:12,885 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] [2024-11-13 13:22:16,892 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] [2024-11-13 13:22:20,898 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] [2024-11-13 13:23:03,009 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] [2024-11-13 13:23:07,017 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] [2024-11-13 13:23:11,022 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] [2024-11-13 13:23:15,217 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] [2024-11-13 13:23:19,223 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] [2024-11-13 13:23:23,229 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] [2024-11-13 13:23:27,972 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] [2024-11-13 13:23:31,981 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] [2024-11-13 13:23:36,198 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] [2024-11-13 13:23:51,809 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] [2024-11-13 13:23:56,016 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] [2024-11-13 13:24:00,046 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] [2024-11-13 13:24:05,451 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] [2024-11-13 13:24:09,577 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] [2024-11-13 13:24:13,585 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] [2024-11-13 13:24:37,831 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] [2024-11-13 13:24:41,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.07s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:25:37,110 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] [2024-11-13 13:25:41,117 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] [2024-11-13 13:25:45,204 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] [2024-11-13 13:25:49,214 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] [2024-11-13 13:25:53,219 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] [2024-11-13 13:25:57,230 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] [2024-11-13 13:26:02,059 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] [2024-11-13 13:26:06,064 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] [2024-11-13 13:26:10,070 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] [2024-11-13 13:26:14,200 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] [2024-11-13 13:26:18,213 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] [2024-11-13 13:26:22,372 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] [2024-11-13 13:26:26,952 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] [2024-11-13 13:26:28,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.24s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:26:32,528 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] [2024-11-13 13:26:36,294 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:26:40,699 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] [2024-11-13 13:26:44,713 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] [2024-11-13 13:26:46,979 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:26:51,549 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] [2024-11-13 13:26:53,453 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2024-11-13 13:26:57,974 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] [2024-11-13 13:27:23,850 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]