./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 30e01a73 Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ --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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:40:50,995 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:40:51,065 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-23 21:40:51,070 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:40:51,071 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:40:51,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:40:51,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:40:51,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:40:51,098 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:40:51,098 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:40:51,099 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:40:51,100 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:40:51,100 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:40:51,101 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:40:51,102 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:40:51,102 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:40:51,103 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:40:51,103 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:40:51,104 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:40:51,105 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:40:51,105 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:40:51,106 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:40:51,106 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:40:51,107 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:40:51,107 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:40:51,108 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:40:51,108 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:40:51,109 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:40:51,109 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:40:51,110 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:40:51,110 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:40:51,110 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:40:51,111 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:40:51,111 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-23 21:40:51,112 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-23 21:40:51,112 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:40:51,112 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:40:51,112 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:40:51,113 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:40:51,113 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2023-11-23 21:40:51,419 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:40:51,455 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:40:51,458 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:40:51,460 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:40:51,460 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:40:51,461 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-23 21:40:54,546 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:40:54,976 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:40:54,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-23 21:40:55,006 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/974cca79c/7649e9eda6104a8ca9adcf3f7a3d289f/FLAGe1aec16fa [2023-11-23 21:40:55,025 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/974cca79c/7649e9eda6104a8ca9adcf3f7a3d289f [2023-11-23 21:40:55,032 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:40:55,034 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:40:55,038 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:40:55,038 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:40:55,044 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:40:55,046 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,048 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1db34178 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55, skipping insertion in model container [2023-11-23 21:40:55,048 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,126 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:40:55,600 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:40:55,614 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:40:55,694 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:40:55,731 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:40:55,731 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:40:55,739 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:40:55,740 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55 WrapperNode [2023-11-23 21:40:55,740 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:40:55,742 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:40:55,742 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:40:55,742 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:40:55,750 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,790 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,844 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 168 [2023-11-23 21:40:55,852 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:40:55,853 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:40:55,853 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:40:55,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:40:55,862 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,862 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,866 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,867 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,877 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,879 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,891 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,893 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,897 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-23 21:40:55,898 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-23 21:40:55,898 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-23 21:40:55,899 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-23 21:40:55,899 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (1/1) ... [2023-11-23 21:40:55,914 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:40:55,927 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/z3 [2023-11-23 21:40:55,945 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-23 21:40:55,983 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-23 21:40:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-23 21:40:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-23 21:40:56,001 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-23 21:40:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-23 21:40:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-23 21:40:56,002 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-23 21:40:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-23 21:40:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-23 21:40:56,003 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-23 21:40:56,003 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-23 21:40:56,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-23 21:40:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-23 21:40:56,004 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-23 21:40:56,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-23 21:40:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-23 21:40:56,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-23 21:40:56,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-23 21:40:56,008 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-23 21:40:56,186 INFO L241 CfgBuilder]: Building ICFG [2023-11-23 21:40:56,189 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-23 21:40:56,664 INFO L282 CfgBuilder]: Performing block encoding [2023-11-23 21:40:56,975 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-23 21:40:56,976 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-23 21:40:56,977 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:40:56 BoogieIcfgContainer [2023-11-23 21:40:56,978 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-23 21:40:56,980 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-23 21:40:56,981 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-23 21:40:56,984 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-23 21:40:56,984 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 09:40:55" (1/3) ... [2023-11-23 21:40:56,985 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2397807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:40:56, skipping insertion in model container [2023-11-23 21:40:56,986 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:40:55" (2/3) ... [2023-11-23 21:40:56,987 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2397807d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 09:40:56, skipping insertion in model container [2023-11-23 21:40:56,987 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:40:56" (3/3) ... [2023-11-23 21:40:56,989 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_tso.oepc.i [2023-11-23 21:40:57,012 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-23 21:40:57,012 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-23 21:40:57,012 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-23 21:40:57,078 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-23 21:40:57,125 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-23 21:40:57,162 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-23 21:40:57,162 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:40:57,168 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 136 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-23 21:40:57,168 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-23 21:40:57,173 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-23 21:40:57,183 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-23 21:40:57,190 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2d8327af, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-23 21:40:57,191 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-23 21:40:57,194 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-23 21:40:57,194 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-23 21:40:57,194 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-23 21:40:57,195 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:57,195 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:40:57,196 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:57,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:57,201 INFO L85 PathProgramCache]: Analyzing trace with hash 14612, now seen corresponding path program 1 times [2023-11-23 21:40:57,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:57,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [59587570] [2023-11-23 21:40:57,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:57,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:57,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:57,618 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:57,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:57,619 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [59587570] [2023-11-23 21:40:57,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [59587570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:40:57,623 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840514135] [2023-11-23 21:40:57,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:57,633 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:40:57,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:57,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:40:57,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:40:57,718 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:40:57,721 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:57,722 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:57,722 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:40:57,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:40:59,206 INFO L124 PetriNetUnfolderBase]: 3508/6059 cut-off events. [2023-11-23 21:40:59,207 INFO L125 PetriNetUnfolderBase]: For 63/63 co-relation queries the response was YES. [2023-11-23 21:40:59,234 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11044 conditions, 6059 events. 3508/6059 cut-off events. For 63/63 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45399 event pairs, 2752 based on Foata normal form. 270/5715 useless extension candidates. Maximal degree in co-relation 11029. Up to 3825 conditions per place. [2023-11-23 21:40:59,290 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-23 21:40:59,290 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 69 transitions, 224 flow [2023-11-23 21:40:59,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:40:59,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:40:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-23 21:40:59,306 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-23 21:40:59,307 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-23 21:40:59,308 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-23 21:40:59,310 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:40:59,312 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-23 21:40:59,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:59,325 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:59,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:59,328 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 148 transitions. [2023-11-23 21:40:59,329 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 69 transitions, 224 flow [2023-11-23 21:40:59,340 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 21:40:59,346 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-23 21:40:59,348 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-23 21:40:59,353 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-23 21:40:59,354 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-23 21:40:59,354 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:59,355 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:40:59,355 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-23 21:40:59,355 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-23 21:40:59,356 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:40:59,357 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:40:59,357 INFO L85 PathProgramCache]: Analyzing trace with hash 14613, now seen corresponding path program 1 times [2023-11-23 21:40:59,357 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:40:59,357 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1507585832] [2023-11-23 21:40:59,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:40:59,358 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:40:59,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:40:59,555 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:40:59,555 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:40:59,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1507585832] [2023-11-23 21:40:59,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1507585832] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:40:59,557 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:40:59,557 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:40:59,557 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614020020] [2023-11-23 21:40:59,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:40:59,559 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:40:59,559 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:40:59,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:40:59,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:40:59,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:40:59,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:40:59,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:40:59,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:40:59,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:00,844 INFO L124 PetriNetUnfolderBase]: 3508/6053 cut-off events. [2023-11-23 21:41:00,844 INFO L125 PetriNetUnfolderBase]: For 135/135 co-relation queries the response was YES. [2023-11-23 21:41:00,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11171 conditions, 6053 events. 3508/6053 cut-off events. For 135/135 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45268 event pairs, 3506 based on Foata normal form. 0/5445 useless extension candidates. Maximal degree in co-relation 11159. Up to 4847 conditions per place. [2023-11-23 21:41:00,913 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 27 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-23 21:41:00,913 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 60 transitions, 190 flow [2023-11-23 21:41:00,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:00,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:00,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-23 21:41:00,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-23 21:41:00,921 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-23 21:41:00,921 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-23 21:41:00,922 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:00,922 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-23 21:41:00,925 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:00,926 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:00,927 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:00,928 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 138 transitions. [2023-11-23 21:41:00,928 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 60 transitions, 190 flow [2023-11-23 21:41:00,944 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 60 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:00,946 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-23 21:41:00,947 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-23 21:41:00,947 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-23 21:41:00,948 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-23 21:41:00,949 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:00,952 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:00,953 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:41:00,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-23 21:41:00,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:00,954 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:00,955 INFO L85 PathProgramCache]: Analyzing trace with hash 435745706, now seen corresponding path program 1 times [2023-11-23 21:41:00,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:00,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [360307632] [2023-11-23 21:41:00,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:00,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:00,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:01,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:01,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:01,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [360307632] [2023-11-23 21:41:01,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [360307632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:01,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:01,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:01,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1161612830] [2023-11-23 21:41:01,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:01,079 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:01,079 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:01,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:01,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:01,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:41:01,107 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:01,107 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:01,107 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:41:01,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:02,330 INFO L124 PetriNetUnfolderBase]: 3510/6011 cut-off events. [2023-11-23 21:41:02,330 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-23 21:41:02,358 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11001 conditions, 6011 events. 3510/6011 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 369. Compared 44667 event pairs, 2797 based on Foata normal form. 0/5403 useless extension candidates. Maximal degree in co-relation 10990. Up to 3825 conditions per place. [2023-11-23 21:41:02,405 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-23 21:41:02,405 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 67 transitions, 220 flow [2023-11-23 21:41:02,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:02,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:02,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-23 21:41:02,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-23 21:41:02,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-23 21:41:02,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-23 21:41:02,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:02,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-23 21:41:02,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:02,412 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:02,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:02,413 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 146 transitions. [2023-11-23 21:41:02,413 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 67 transitions, 220 flow [2023-11-23 21:41:02,415 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:02,418 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-23 21:41:02,418 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-23 21:41:02,420 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-23 21:41:02,420 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-23 21:41:02,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:02,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:02,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-23 21:41:02,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-23 21:41:02,421 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:02,422 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:02,422 INFO L85 PathProgramCache]: Analyzing trace with hash 435745707, now seen corresponding path program 1 times [2023-11-23 21:41:02,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:02,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [723719049] [2023-11-23 21:41:02,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:02,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:02,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:02,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:02,549 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:02,550 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [723719049] [2023-11-23 21:41:02,550 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [723719049] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:02,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:02,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:02,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485023952] [2023-11-23 21:41:02,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:02,552 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:02,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:02,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:02,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:02,585 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:41:02,586 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:02,586 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:02,586 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:41:02,587 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:03,733 INFO L124 PetriNetUnfolderBase]: 3508/6052 cut-off events. [2023-11-23 21:41:03,734 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-23 21:41:03,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11171 conditions, 6052 events. 3508/6052 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 370. Compared 45486 event pairs, 2220 based on Foata normal form. 3/5449 useless extension candidates. Maximal degree in co-relation 11161. Up to 3820 conditions per place. [2023-11-23 21:41:03,783 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-23 21:41:03,783 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 66 transitions, 216 flow [2023-11-23 21:41:03,784 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:03,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:03,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-23 21:41:03,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-23 21:41:03,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-23 21:41:03,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-23 21:41:03,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:03,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-23 21:41:03,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:03,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:03,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:03,789 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 148 transitions. [2023-11-23 21:41:03,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 66 transitions, 216 flow [2023-11-23 21:41:03,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 66 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:03,799 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-23 21:41:03,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-23 21:41:03,801 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-23 21:41:03,801 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-23 21:41:03,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:03,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:03,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:03,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-23 21:41:03,802 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:03,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:03,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1909602867, now seen corresponding path program 1 times [2023-11-23 21:41:03,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:03,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373333035] [2023-11-23 21:41:03,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:03,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:03,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:03,880 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:03,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:03,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373333035] [2023-11-23 21:41:03,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1373333035] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:03,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:03,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:03,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377081349] [2023-11-23 21:41:03,882 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:03,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:03,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:03,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:03,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:03,914 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:41:03,914 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:03,914 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:03,914 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:41:03,915 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:04,891 INFO L124 PetriNetUnfolderBase]: 3530/6032 cut-off events. [2023-11-23 21:41:04,892 INFO L125 PetriNetUnfolderBase]: For 137/137 co-relation queries the response was YES. [2023-11-23 21:41:04,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11188 conditions, 6032 events. 3530/6032 cut-off events. For 137/137 co-relation queries the response was YES. Maximal size of possible extension queue 368. Compared 45040 event pairs, 2286 based on Foata normal form. 0/5454 useless extension candidates. Maximal degree in co-relation 11178. Up to 3827 conditions per place. [2023-11-23 21:41:04,954 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-23 21:41:04,954 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 65 transitions, 216 flow [2023-11-23 21:41:04,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:04,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:04,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-23 21:41:04,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-23 21:41:04,956 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-23 21:41:04,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-23 21:41:04,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:04,957 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-23 21:41:04,957 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:04,958 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:04,959 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:04,959 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 146 transitions. [2023-11-23 21:41:04,959 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 65 transitions, 216 flow [2023-11-23 21:41:04,963 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:04,965 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-23 21:41:04,965 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-23 21:41:04,966 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-23 21:41:04,966 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-23 21:41:04,967 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:04,967 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:04,967 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:04,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-23 21:41:04,968 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:04,968 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:04,968 INFO L85 PathProgramCache]: Analyzing trace with hash 1909602868, now seen corresponding path program 1 times [2023-11-23 21:41:04,969 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:04,969 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253714] [2023-11-23 21:41:04,969 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:04,969 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:04,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:05,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:05,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:05,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253714] [2023-11-23 21:41:05,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:05,073 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:05,073 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:05,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [51048845] [2023-11-23 21:41:05,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:05,074 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:05,074 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:05,074 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:05,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:05,097 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:41:05,098 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:05,098 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:05,098 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:41:05,099 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:06,202 INFO L124 PetriNetUnfolderBase]: 3508/6022 cut-off events. [2023-11-23 21:41:06,203 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-23 21:41:06,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11153 conditions, 6022 events. 3508/6022 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 371. Compared 45588 event pairs, 1608 based on Foata normal form. 15/5468 useless extension candidates. Maximal degree in co-relation 11143. Up to 3790 conditions per place. [2023-11-23 21:41:06,267 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 34 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-23 21:41:06,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 64 transitions, 212 flow [2023-11-23 21:41:06,268 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:06,268 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:06,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-23 21:41:06,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.736318407960199 [2023-11-23 21:41:06,269 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-23 21:41:06,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-23 21:41:06,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:06,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-23 21:41:06,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:06,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:06,272 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:06,272 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 148 transitions. [2023-11-23 21:41:06,272 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 64 transitions, 212 flow [2023-11-23 21:41:06,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 64 transitions, 208 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:06,277 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-23 21:41:06,277 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-23 21:41:06,280 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-23 21:41:06,280 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-23 21:41:06,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:06,281 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:06,281 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:06,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-23 21:41:06,282 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:06,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:06,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1909603959, now seen corresponding path program 1 times [2023-11-23 21:41:06,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:06,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696744743] [2023-11-23 21:41:06,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:06,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:06,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:06,432 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:06,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:06,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696744743] [2023-11-23 21:41:06,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696744743] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:06,433 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:06,433 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-23 21:41:06,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442559048] [2023-11-23 21:41:06,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:06,434 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:06,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:06,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:06,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:06,436 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-23 21:41:06,437 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:06,437 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:06,437 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-23 21:41:06,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:07,376 INFO L124 PetriNetUnfolderBase]: 2754/4605 cut-off events. [2023-11-23 21:41:07,376 INFO L125 PetriNetUnfolderBase]: For 117/117 co-relation queries the response was YES. [2023-11-23 21:41:07,398 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8661 conditions, 4605 events. 2754/4605 cut-off events. For 117/117 co-relation queries the response was YES. Maximal size of possible extension queue 300. Compared 32767 event pairs, 492 based on Foata normal form. 0/4501 useless extension candidates. Maximal degree in co-relation 8651. Up to 3064 conditions per place. [2023-11-23 21:41:07,426 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 39 selfloop transitions, 2 changer transitions 2/71 dead transitions. [2023-11-23 21:41:07,426 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 71 transitions, 248 flow [2023-11-23 21:41:07,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:07,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:07,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2023-11-23 21:41:07,428 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7860696517412935 [2023-11-23 21:41:07,428 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 158 transitions. [2023-11-23 21:41:07,428 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 158 transitions. [2023-11-23 21:41:07,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:07,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 158 transitions. [2023-11-23 21:41:07,430 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.666666666666664) internal successors, (158), 3 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:07,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:07,432 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:07,432 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 158 transitions. [2023-11-23 21:41:07,432 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 71 transitions, 248 flow [2023-11-23 21:41:07,434 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 71 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:07,435 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-23 21:41:07,435 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-23 21:41:07,437 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-23 21:41:07,437 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-23 21:41:07,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:07,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:07,438 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:07,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-23 21:41:07,438 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:07,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:07,439 INFO L85 PathProgramCache]: Analyzing trace with hash 2137617208, now seen corresponding path program 1 times [2023-11-23 21:41:07,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:07,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116572575] [2023-11-23 21:41:07,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:07,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:07,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:07,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:07,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:07,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116572575] [2023-11-23 21:41:07,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116572575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:07,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:07,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:07,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704470052] [2023-11-23 21:41:07,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:07,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:07,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:07,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:07,523 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:07,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:41:07,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:07,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:07,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:41:07,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:08,209 INFO L124 PetriNetUnfolderBase]: 2532/4356 cut-off events. [2023-11-23 21:41:08,209 INFO L125 PetriNetUnfolderBase]: For 249/249 co-relation queries the response was YES. [2023-11-23 21:41:08,227 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8248 conditions, 4356 events. 2532/4356 cut-off events. For 249/249 co-relation queries the response was YES. Maximal size of possible extension queue 266. Compared 30875 event pairs, 1191 based on Foata normal form. 0/4177 useless extension candidates. Maximal degree in co-relation 8237. Up to 2985 conditions per place. [2023-11-23 21:41:08,250 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-23 21:41:08,250 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 202 flow [2023-11-23 21:41:08,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:08,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:08,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-23 21:41:08,252 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-23 21:41:08,252 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-23 21:41:08,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-23 21:41:08,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:08,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-23 21:41:08,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:08,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:08,255 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:08,255 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 143 transitions. [2023-11-23 21:41:08,255 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 202 flow [2023-11-23 21:41:08,256 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:08,257 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-23 21:41:08,258 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-23 21:41:08,258 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-23 21:41:08,259 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-23 21:41:08,259 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:08,259 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:08,259 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:08,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-23 21:41:08,260 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:08,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:08,260 INFO L85 PathProgramCache]: Analyzing trace with hash 2137617209, now seen corresponding path program 1 times [2023-11-23 21:41:08,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:08,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1617228278] [2023-11-23 21:41:08,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:08,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:08,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:08,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:08,350 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:08,350 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1617228278] [2023-11-23 21:41:08,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1617228278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:08,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:08,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-23 21:41:08,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [398207734] [2023-11-23 21:41:08,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:08,352 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-23 21:41:08,352 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:08,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-23 21:41:08,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-23 21:41:08,370 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:41:08,371 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:08,371 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:08,371 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:41:08,371 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:09,029 INFO L124 PetriNetUnfolderBase]: 2457/4293 cut-off events. [2023-11-23 21:41:09,029 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-23 21:41:09,048 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7968 conditions, 4293 events. 2457/4293 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 30845 event pairs, 735 based on Foata normal form. 36/4174 useless extension candidates. Maximal degree in co-relation 7958. Up to 2874 conditions per place. [2023-11-23 21:41:09,068 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 31 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-23 21:41:09,069 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 59 transitions, 196 flow [2023-11-23 21:41:09,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-23 21:41:09,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-23 21:41:09,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 145 transitions. [2023-11-23 21:41:09,070 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7213930348258707 [2023-11-23 21:41:09,070 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 145 transitions. [2023-11-23 21:41:09,071 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 145 transitions. [2023-11-23 21:41:09,071 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:09,071 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 145 transitions. [2023-11-23 21:41:09,072 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.333333333333336) internal successors, (145), 3 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:09,072 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:09,073 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:09,073 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 145 transitions. [2023-11-23 21:41:09,073 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 59 transitions, 196 flow [2023-11-23 21:41:09,074 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 59 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:09,075 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-23 21:41:09,076 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-23 21:41:09,076 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-23 21:41:09,077 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-23 21:41:09,077 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:09,077 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:09,077 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:09,078 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-23 21:41:09,078 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:09,078 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:09,078 INFO L85 PathProgramCache]: Analyzing trace with hash -1656893694, now seen corresponding path program 1 times [2023-11-23 21:41:09,079 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:09,079 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [132324649] [2023-11-23 21:41:09,079 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:09,079 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:09,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:09,917 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:09,918 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:09,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [132324649] [2023-11-23 21:41:09,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [132324649] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:09,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:09,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:41:09,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [941661999] [2023-11-23 21:41:09,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:09,923 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-23 21:41:09,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:09,924 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-23 21:41:09,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2023-11-23 21:41:10,182 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 67 [2023-11-23 21:41:10,183 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:10,183 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:10,183 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 67 [2023-11-23 21:41:10,183 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:11,040 INFO L124 PetriNetUnfolderBase]: 2474/4202 cut-off events. [2023-11-23 21:41:11,040 INFO L125 PetriNetUnfolderBase]: For 132/132 co-relation queries the response was YES. [2023-11-23 21:41:11,053 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7907 conditions, 4202 events. 2474/4202 cut-off events. For 132/132 co-relation queries the response was YES. Maximal size of possible extension queue 258. Compared 28995 event pairs, 972 based on Foata normal form. 108/4160 useless extension candidates. Maximal degree in co-relation 7896. Up to 2874 conditions per place. [2023-11-23 21:41:11,070 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 35 selfloop transitions, 4 changer transitions 10/72 dead transitions. [2023-11-23 21:41:11,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 72 transitions, 254 flow [2023-11-23 21:41:11,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:41:11,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:41:11,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 274 transitions. [2023-11-23 21:41:11,072 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5842217484008528 [2023-11-23 21:41:11,072 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 274 transitions. [2023-11-23 21:41:11,073 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 274 transitions. [2023-11-23 21:41:11,073 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:11,073 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 274 transitions. [2023-11-23 21:41:11,074 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 39.142857142857146) internal successors, (274), 7 states have internal predecessors, (274), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:11,075 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:11,076 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:11,076 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 7 states and 274 transitions. [2023-11-23 21:41:11,076 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 72 transitions, 254 flow [2023-11-23 21:41:11,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 72 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:11,079 INFO L231 Difference]: Finished difference. Result has 64 places, 48 transitions, 112 flow [2023-11-23 21:41:11,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=48} [2023-11-23 21:41:11,080 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-23 21:41:11,080 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 48 transitions, 112 flow [2023-11-23 21:41:11,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 33.888888888888886) internal successors, (305), 9 states have internal predecessors, (305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:11,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:11,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:11,081 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-23 21:41:11,082 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:11,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:11,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1656892311, now seen corresponding path program 1 times [2023-11-23 21:41:11,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:11,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1097471246] [2023-11-23 21:41:11,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:11,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:11,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:11,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:11,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:11,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1097471246] [2023-11-23 21:41:11,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1097471246] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:11,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:11,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-23 21:41:11,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1527950894] [2023-11-23 21:41:11,271 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:11,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-23 21:41:11,271 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:11,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-23 21:41:11,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-23 21:41:11,281 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:11,282 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 48 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:11,282 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:11,282 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:11,282 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:12,496 INFO L124 PetriNetUnfolderBase]: 8029/11968 cut-off events. [2023-11-23 21:41:12,496 INFO L125 PetriNetUnfolderBase]: For 95/95 co-relation queries the response was YES. [2023-11-23 21:41:12,529 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23260 conditions, 11968 events. 8029/11968 cut-off events. For 95/95 co-relation queries the response was YES. Maximal size of possible extension queue 740. Compared 80928 event pairs, 869 based on Foata normal form. 320/11973 useless extension candidates. Maximal degree in co-relation 23249. Up to 7057 conditions per place. [2023-11-23 21:41:12,569 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 51 selfloop transitions, 6 changer transitions 1/78 dead transitions. [2023-11-23 21:41:12,570 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 78 transitions, 300 flow [2023-11-23 21:41:12,570 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-23 21:41:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-23 21:41:12,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-23 21:41:12,571 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-23 21:41:12,571 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-23 21:41:12,572 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-23 21:41:12,572 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:12,572 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-23 21:41:12,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:12,574 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:12,574 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:12,574 INFO L175 Difference]: Start difference. First operand has 64 places, 48 transitions, 112 flow. Second operand 4 states and 192 transitions. [2023-11-23 21:41:12,574 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 78 transitions, 300 flow [2023-11-23 21:41:12,575 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 78 transitions, 288 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-23 21:41:12,577 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 147 flow [2023-11-23 21:41:12,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-23 21:41:12,578 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-23 21:41:12,578 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 147 flow [2023-11-23 21:41:12,578 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.75) internal successors, (147), 4 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:12,578 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:12,579 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:12,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-23 21:41:12,579 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:12,579 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:12,579 INFO L85 PathProgramCache]: Analyzing trace with hash -1760485494, now seen corresponding path program 1 times [2023-11-23 21:41:12,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:12,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [294506952] [2023-11-23 21:41:12,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:12,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:12,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:12,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:12,906 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:12,906 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [294506952] [2023-11-23 21:41:12,906 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [294506952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:12,906 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:12,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-23 21:41:12,907 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358870357] [2023-11-23 21:41:12,907 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:12,907 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-23 21:41:12,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:12,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-23 21:41:12,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-23 21:41:12,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:12,918 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:12,918 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:12,918 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:12,919 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:13,910 INFO L124 PetriNetUnfolderBase]: 6173/9296 cut-off events. [2023-11-23 21:41:13,911 INFO L125 PetriNetUnfolderBase]: For 2252/2252 co-relation queries the response was YES. [2023-11-23 21:41:13,951 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21138 conditions, 9296 events. 6173/9296 cut-off events. For 2252/2252 co-relation queries the response was YES. Maximal size of possible extension queue 565. Compared 60260 event pairs, 369 based on Foata normal form. 296/9358 useless extension candidates. Maximal degree in co-relation 21125. Up to 4681 conditions per place. [2023-11-23 21:41:13,993 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 65 selfloop transitions, 10 changer transitions 1/96 dead transitions. [2023-11-23 21:41:13,994 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 96 transitions, 418 flow [2023-11-23 21:41:13,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-23 21:41:13,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-23 21:41:13,997 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-23 21:41:13,998 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7253731343283583 [2023-11-23 21:41:13,998 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-23 21:41:13,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-23 21:41:13,998 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:13,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-23 21:41:14,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:14,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:14,004 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:14,004 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-23 21:41:14,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 96 transitions, 418 flow [2023-11-23 21:41:14,008 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 96 transitions, 407 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-23 21:41:14,010 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 199 flow [2023-11-23 21:41:14,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-23 21:41:14,015 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-23 21:41:14,015 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 199 flow [2023-11-23 21:41:14,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:14,018 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:14,018 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:14,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-23 21:41:14,018 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:14,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:14,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1682151375, now seen corresponding path program 1 times [2023-11-23 21:41:14,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:14,022 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592552575] [2023-11-23 21:41:14,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:14,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:14,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:14,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:14,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592552575] [2023-11-23 21:41:14,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [592552575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:14,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:14,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-23 21:41:14,408 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294402365] [2023-11-23 21:41:14,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:14,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:41:14,409 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:14,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:41:14,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:41:14,423 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:14,423 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:14,424 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:14,424 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:14,424 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:15,398 INFO L124 PetriNetUnfolderBase]: 3825/5780 cut-off events. [2023-11-23 21:41:15,399 INFO L125 PetriNetUnfolderBase]: For 4281/4281 co-relation queries the response was YES. [2023-11-23 21:41:15,417 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14748 conditions, 5780 events. 3825/5780 cut-off events. For 4281/4281 co-relation queries the response was YES. Maximal size of possible extension queue 244. Compared 33450 event pairs, 221 based on Foata normal form. 208/5811 useless extension candidates. Maximal degree in co-relation 14733. Up to 1801 conditions per place. [2023-11-23 21:41:15,447 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 77 selfloop transitions, 14 changer transitions 1/112 dead transitions. [2023-11-23 21:41:15,447 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 112 transitions, 546 flow [2023-11-23 21:41:15,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:41:15,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:41:15,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-23 21:41:15,451 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-23 21:41:15,451 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-23 21:41:15,452 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-23 21:41:15,452 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:15,452 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-23 21:41:15,454 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:15,456 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:15,457 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:15,457 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-23 21:41:15,457 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 112 transitions, 546 flow [2023-11-23 21:41:15,487 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 112 transitions, 516 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-23 21:41:15,490 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 249 flow [2023-11-23 21:41:15,490 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-11-23 21:41:15,491 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-23 21:41:15,492 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 249 flow [2023-11-23 21:41:15,492 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.333333333333336) internal successors, (218), 6 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:15,492 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:15,493 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:15,493 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-23 21:41:15,493 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:15,494 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:15,494 INFO L85 PathProgramCache]: Analyzing trace with hash 115411121, now seen corresponding path program 1 times [2023-11-23 21:41:15,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:15,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513745433] [2023-11-23 21:41:15,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:15,495 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:15,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:15,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:15,974 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:15,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513745433] [2023-11-23 21:41:15,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513745433] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:15,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:15,975 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:41:15,975 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045116956] [2023-11-23 21:41:15,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:15,976 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:41:15,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:15,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:41:15,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:41:15,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:15,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:15,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:15,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:15,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:16,778 INFO L124 PetriNetUnfolderBase]: 2457/3644 cut-off events. [2023-11-23 21:41:16,779 INFO L125 PetriNetUnfolderBase]: For 4477/4477 co-relation queries the response was YES. [2023-11-23 21:41:16,795 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10229 conditions, 3644 events. 2457/3644 cut-off events. For 4477/4477 co-relation queries the response was YES. Maximal size of possible extension queue 173. Compared 18895 event pairs, 173 based on Foata normal form. 88/3576 useless extension candidates. Maximal degree in co-relation 10213. Up to 1088 conditions per place. [2023-11-23 21:41:16,813 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 18 changer transitions 1/108 dead transitions. [2023-11-23 21:41:16,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 108 transitions, 540 flow [2023-11-23 21:41:16,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-23 21:41:16,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-23 21:41:16,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-23 21:41:16,816 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844349680170576 [2023-11-23 21:41:16,817 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-23 21:41:16,818 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-23 21:41:16,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:16,818 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-23 21:41:16,820 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:16,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:16,822 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:16,823 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 249 flow. Second operand 7 states and 321 transitions. [2023-11-23 21:41:16,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 108 transitions, 540 flow [2023-11-23 21:41:16,872 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 108 transitions, 494 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-23 21:41:16,875 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 259 flow [2023-11-23 21:41:16,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-11-23 21:41:16,877 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-23 21:41:16,877 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 259 flow [2023-11-23 21:41:16,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:16,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:16,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:16,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-23 21:41:16,878 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:16,879 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:16,879 INFO L85 PathProgramCache]: Analyzing trace with hash -2132142282, now seen corresponding path program 1 times [2023-11-23 21:41:16,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:16,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244895704] [2023-11-23 21:41:16,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:16,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:17,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:17,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:17,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:17,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244895704] [2023-11-23 21:41:17,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244895704] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:17,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:17,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:41:17,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1804357855] [2023-11-23 21:41:17,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:17,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:41:17,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:17,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:41:17,805 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:41:17,848 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:17,849 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 259 flow. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:17,849 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:17,849 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:17,849 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:19,270 INFO L124 PetriNetUnfolderBase]: 4947/7785 cut-off events. [2023-11-23 21:41:19,271 INFO L125 PetriNetUnfolderBase]: For 3407/3653 co-relation queries the response was YES. [2023-11-23 21:41:19,315 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18108 conditions, 7785 events. 4947/7785 cut-off events. For 3407/3653 co-relation queries the response was YES. Maximal size of possible extension queue 399. Compared 49544 event pairs, 1084 based on Foata normal form. 16/7524 useless extension candidates. Maximal degree in co-relation 18091. Up to 3708 conditions per place. [2023-11-23 21:41:19,334 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 41 selfloop transitions, 5 changer transitions 44/122 dead transitions. [2023-11-23 21:41:19,334 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 122 transitions, 592 flow [2023-11-23 21:41:19,334 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:41:19,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:41:19,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2023-11-23 21:41:19,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6623134328358209 [2023-11-23 21:41:19,337 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 355 transitions. [2023-11-23 21:41:19,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 355 transitions. [2023-11-23 21:41:19,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:19,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 355 transitions. [2023-11-23 21:41:19,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 44.375) internal successors, (355), 8 states have internal predecessors, (355), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:19,341 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:19,342 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:19,342 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 259 flow. Second operand 8 states and 355 transitions. [2023-11-23 21:41:19,342 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 122 transitions, 592 flow [2023-11-23 21:41:19,445 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 122 transitions, 486 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-23 21:41:19,448 INFO L231 Difference]: Finished difference. Result has 76 places, 63 transitions, 206 flow [2023-11-23 21:41:19,448 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=206, PETRI_PLACES=76, PETRI_TRANSITIONS=63} [2023-11-23 21:41:19,449 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2023-11-23 21:41:19,449 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 63 transitions, 206 flow [2023-11-23 21:41:19,449 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:19,449 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:19,450 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:19,450 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-23 21:41:19,450 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:19,451 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:19,451 INFO L85 PathProgramCache]: Analyzing trace with hash 592167444, now seen corresponding path program 2 times [2023-11-23 21:41:19,451 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:19,451 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [882948318] [2023-11-23 21:41:19,452 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:19,452 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:19,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:20,347 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:20,348 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:20,348 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [882948318] [2023-11-23 21:41:20,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [882948318] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:20,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:20,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-23 21:41:20,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662913233] [2023-11-23 21:41:20,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:20,354 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-23 21:41:20,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:20,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-23 21:41:20,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-23 21:41:20,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-23 21:41:20,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 63 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:20,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:20,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-23 21:41:20,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:21,639 INFO L124 PetriNetUnfolderBase]: 4686/7425 cut-off events. [2023-11-23 21:41:21,639 INFO L125 PetriNetUnfolderBase]: For 2363/2387 co-relation queries the response was YES. [2023-11-23 21:41:21,670 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17376 conditions, 7425 events. 4686/7425 cut-off events. For 2363/2387 co-relation queries the response was YES. Maximal size of possible extension queue 395. Compared 49155 event pairs, 764 based on Foata normal form. 20/7058 useless extension candidates. Maximal degree in co-relation 17358. Up to 3293 conditions per place. [2023-11-23 21:41:21,686 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 60 selfloop transitions, 9 changer transitions 12/113 dead transitions. [2023-11-23 21:41:21,686 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 113 transitions, 516 flow [2023-11-23 21:41:21,687 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:41:21,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:41:21,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 346 transitions. [2023-11-23 21:41:21,689 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6455223880597015 [2023-11-23 21:41:21,689 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 346 transitions. [2023-11-23 21:41:21,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 346 transitions. [2023-11-23 21:41:21,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:21,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 346 transitions. [2023-11-23 21:41:21,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 43.25) internal successors, (346), 8 states have internal predecessors, (346), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:21,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:21,694 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:21,694 INFO L175 Difference]: Start difference. First operand has 76 places, 63 transitions, 206 flow. Second operand 8 states and 346 transitions. [2023-11-23 21:41:21,694 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 113 transitions, 516 flow [2023-11-23 21:41:21,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 113 transitions, 506 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-23 21:41:21,700 INFO L231 Difference]: Finished difference. Result has 80 places, 67 transitions, 246 flow [2023-11-23 21:41:21,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=200, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=246, PETRI_PLACES=80, PETRI_TRANSITIONS=67} [2023-11-23 21:41:21,701 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 6 predicate places. [2023-11-23 21:41:21,701 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 67 transitions, 246 flow [2023-11-23 21:41:21,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.42857142857143) internal successors, (255), 7 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:21,701 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:21,701 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:21,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-23 21:41:21,702 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:21,702 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:21,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1536674518, now seen corresponding path program 3 times [2023-11-23 21:41:21,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:21,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1383575873] [2023-11-23 21:41:21,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:21,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:21,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:22,167 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:22,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:22,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1383575873] [2023-11-23 21:41:22,168 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1383575873] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:22,168 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:22,168 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-23 21:41:22,168 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963717528] [2023-11-23 21:41:22,168 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:22,169 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-23 21:41:22,169 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:22,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-23 21:41:22,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-23 21:41:22,177 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-23 21:41:22,178 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 67 transitions, 246 flow. Second operand has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:22,178 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:22,178 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-23 21:41:22,178 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:23,617 INFO L124 PetriNetUnfolderBase]: 5877/10099 cut-off events. [2023-11-23 21:41:23,617 INFO L125 PetriNetUnfolderBase]: For 2790/2868 co-relation queries the response was YES. [2023-11-23 21:41:23,695 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22551 conditions, 10099 events. 5877/10099 cut-off events. For 2790/2868 co-relation queries the response was YES. Maximal size of possible extension queue 627. Compared 77575 event pairs, 1401 based on Foata normal form. 16/9457 useless extension candidates. Maximal degree in co-relation 22530. Up to 3344 conditions per place. [2023-11-23 21:41:23,709 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 1 changer transitions 35/101 dead transitions. [2023-11-23 21:41:23,710 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 101 transitions, 475 flow [2023-11-23 21:41:23,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-23 21:41:23,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-23 21:41:23,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2023-11-23 21:41:23,713 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6791044776119403 [2023-11-23 21:41:23,713 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 273 transitions. [2023-11-23 21:41:23,713 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 273 transitions. [2023-11-23 21:41:23,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:23,714 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 273 transitions. [2023-11-23 21:41:23,715 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:23,717 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:23,718 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:23,718 INFO L175 Difference]: Start difference. First operand has 80 places, 67 transitions, 246 flow. Second operand 6 states and 273 transitions. [2023-11-23 21:41:23,718 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 101 transitions, 475 flow [2023-11-23 21:41:23,722 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 460 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-23 21:41:23,724 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 204 flow [2023-11-23 21:41:23,725 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=204, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-11-23 21:41:23,725 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2023-11-23 21:41:23,726 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 204 flow [2023-11-23 21:41:23,726 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.5) internal successors, (237), 6 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:23,726 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:23,726 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:23,727 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-23 21:41:23,727 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:23,727 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:23,728 INFO L85 PathProgramCache]: Analyzing trace with hash 75470070, now seen corresponding path program 4 times [2023-11-23 21:41:23,728 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:23,728 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725147016] [2023-11-23 21:41:23,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:23,728 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:23,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-23 21:41:26,367 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-23 21:41:26,367 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-23 21:41:26,367 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725147016] [2023-11-23 21:41:26,368 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725147016] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-23 21:41:26,368 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-23 21:41:26,368 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2023-11-23 21:41:26,368 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1881400387] [2023-11-23 21:41:26,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-23 21:41:26,369 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-23 21:41:26,369 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-23 21:41:26,369 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-23 21:41:26,370 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2023-11-23 21:41:26,405 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-23 21:41:26,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 60 transitions, 204 flow. Second operand has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:26,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-23 21:41:26,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-23 21:41:26,407 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-23 21:41:27,555 INFO L124 PetriNetUnfolderBase]: 2871/4957 cut-off events. [2023-11-23 21:41:27,555 INFO L125 PetriNetUnfolderBase]: For 363/497 co-relation queries the response was YES. [2023-11-23 21:41:27,595 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10697 conditions, 4957 events. 2871/4957 cut-off events. For 363/497 co-relation queries the response was YES. Maximal size of possible extension queue 278. Compared 32361 event pairs, 824 based on Foata normal form. 22/4592 useless extension candidates. Maximal degree in co-relation 10674. Up to 1739 conditions per place. [2023-11-23 21:41:27,603 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 33 selfloop transitions, 3 changer transitions 29/101 dead transitions. [2023-11-23 21:41:27,603 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 101 transitions, 441 flow [2023-11-23 21:41:27,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-23 21:41:27,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-23 21:41:27,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 362 transitions. [2023-11-23 21:41:27,607 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6753731343283582 [2023-11-23 21:41:27,607 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 362 transitions. [2023-11-23 21:41:27,607 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 362 transitions. [2023-11-23 21:41:27,608 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-23 21:41:27,608 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 362 transitions. [2023-11-23 21:41:27,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.25) internal successors, (362), 8 states have internal predecessors, (362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:27,614 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:27,614 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:27,615 INFO L175 Difference]: Start difference. First operand has 84 places, 60 transitions, 204 flow. Second operand 8 states and 362 transitions. [2023-11-23 21:41:27,615 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 101 transitions, 441 flow [2023-11-23 21:41:27,625 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 101 transitions, 424 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-23 21:41:27,627 INFO L231 Difference]: Finished difference. Result has 84 places, 60 transitions, 208 flow [2023-11-23 21:41:27,628 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=193, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=208, PETRI_PLACES=84, PETRI_TRANSITIONS=60} [2023-11-23 21:41:27,628 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 10 predicate places. [2023-11-23 21:41:27,629 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 60 transitions, 208 flow [2023-11-23 21:41:27,629 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 38.666666666666664) internal successors, (464), 12 states have internal predecessors, (464), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-23 21:41:27,629 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-23 21:41:27,630 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:27,630 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-23 21:41:27,630 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-23 21:41:27,631 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-23 21:41:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash -904974886, now seen corresponding path program 5 times [2023-11-23 21:41:27,631 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-23 21:41:27,631 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1329885998] [2023-11-23 21:41:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-23 21:41:27,632 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-23 21:41:27,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:27,722 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-23 21:41:27,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-23 21:41:27,885 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-23 21:41:27,885 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-23 21:41:27,889 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-23 21:41:27,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-23 21:41:27,892 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-23 21:41:27,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-23 21:41:27,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-23 21:41:27,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-23 21:41:27,893 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-23 21:41:27,894 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-23 21:41:27,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-23 21:41:27,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-23 21:41:27,895 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-23 21:41:27,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-23 21:41:27,896 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-23 21:41:27,903 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-23 21:41:27,903 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-23 21:41:28,006 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated [2023-11-23 21:41:28,009 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-23 21:41:28,010 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-23 21:41:28,011 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-23 21:41:28,030 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:41:28,031 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-23 21:41:28,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 09:41:28 BasicIcfg [2023-11-23 21:41:28,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-23 21:41:28,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-23 21:41:28,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-23 21:41:28,049 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-23 21:41:28,049 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 09:40:56" (3/4) ... [2023-11-23 21:41:28,051 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-23 21:41:28,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-23 21:41:28,054 INFO L158 Benchmark]: Toolchain (without parser) took 33019.55ms. Allocated memory was 127.9MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 93.4MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 494.0MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,054 INFO L158 Benchmark]: CDTParser took 0.46ms. Allocated memory is still 127.9MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:41:28,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 702.95ms. Allocated memory is still 127.9MB. Free memory was 92.9MB in the beginning and 68.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,055 INFO L158 Benchmark]: Boogie Procedure Inliner took 110.57ms. Allocated memory is still 127.9MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,055 INFO L158 Benchmark]: Boogie Preprocessor took 44.71ms. Allocated memory is still 127.9MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,056 INFO L158 Benchmark]: RCFGBuilder took 1079.63ms. Allocated memory was 127.9MB in the beginning and 180.4MB in the end (delta: 52.4MB). Free memory was 63.6MB in the beginning and 108.5MB in the end (delta: -44.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,056 INFO L158 Benchmark]: TraceAbstraction took 31067.77ms. Allocated memory was 180.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 107.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 455.2MB. Max. memory is 16.1GB. [2023-11-23 21:41:28,056 INFO L158 Benchmark]: Witness Printer took 4.25ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-23 21:41:28,059 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.46ms. Allocated memory is still 127.9MB. Free memory is still 100.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 702.95ms. Allocated memory is still 127.9MB. Free memory was 92.9MB in the beginning and 68.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 110.57ms. Allocated memory is still 127.9MB. Free memory was 68.6MB in the beginning and 65.7MB in the end (delta: 2.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 44.71ms. Allocated memory is still 127.9MB. Free memory was 65.7MB in the beginning and 63.6MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 1079.63ms. Allocated memory was 127.9MB in the beginning and 180.4MB in the end (delta: 52.4MB). Free memory was 63.6MB in the beginning and 108.5MB in the end (delta: -44.9MB). Peak memory consumption was 24.2MB. Max. memory is 16.1GB. * TraceAbstraction took 31067.77ms. Allocated memory was 180.4MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 107.6MB in the beginning and 1.2GB in the end (delta: -1.1GB). Peak memory consumption was 455.2MB. Max. memory is 16.1GB. * Witness Printer took 4.25ms. Allocated memory is still 1.8GB. Free memory is still 1.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre3 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L727] 0 _Bool x$flush_delayed; [L728] 0 int x$mem_tmp; [L729] 0 _Bool x$r_buff0_thd0; [L730] 0 _Bool x$r_buff0_thd1; [L731] 0 _Bool x$r_buff0_thd2; [L732] 0 _Bool x$r_buff0_thd3; [L733] 0 _Bool x$r_buff0_thd4; [L734] 0 _Bool x$r_buff1_thd0; [L735] 0 _Bool x$r_buff1_thd1; [L736] 0 _Bool x$r_buff1_thd2; [L737] 0 _Bool x$r_buff1_thd3; [L738] 0 _Bool x$r_buff1_thd4; [L739] 0 _Bool x$read_delayed; [L740] 0 int *x$read_delayed_var; [L741] 0 int x$w_buff0; [L742] 0 _Bool x$w_buff0_used; [L743] 0 int x$w_buff1; [L744] 0 _Bool x$w_buff1_used; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L858] 0 pthread_t t993; [L859] FCALL, FORK 0 pthread_create(&t993, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L860] 0 pthread_t t994; [L861] FCALL, FORK 0 pthread_create(&t994, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L862] 0 pthread_t t995; [L863] FCALL, FORK 0 pthread_create(&t995, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L864] 0 pthread_t t996; [L865] FCALL, FORK 0 pthread_create(&t996, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L774] 2 x$w_buff1 = x$w_buff0 [L775] 2 x$w_buff0 = 2 [L776] 2 x$w_buff1_used = x$w_buff0_used [L777] 2 x$w_buff0_used = (_Bool)1 [L778] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L18] COND FALSE 2 !(!expression) [L778] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L779] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L780] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L781] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L782] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L783] 2 x$r_buff1_thd4 = x$r_buff0_thd4 [L784] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L833] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L754] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=1] [L757] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L760] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L761] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L762] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L763] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L764] 1 x$r_buff1_thd1 = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L810] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L811] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L812] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L813] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L814] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=1, y=1, z=1] [L790] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L791] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L792] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L793] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L794] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L836] 4 x = x$w_buff0_used && x$r_buff0_thd4 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd4 ? x$w_buff1 : x) [L837] 4 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$w_buff0_used [L838] 4 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$w_buff1_used [L839] 4 x$r_buff0_thd4 = x$w_buff0_used && x$r_buff0_thd4 ? (_Bool)0 : x$r_buff0_thd4 [L840] 4 x$r_buff1_thd4 = x$w_buff0_used && x$r_buff0_thd4 || x$w_buff1_used && x$r_buff1_thd4 ? (_Bool)0 : x$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L767] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L843] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L867] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L869] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L869] RET 0 assume_abort_if_not(main$tmp_guard0) [L871] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L872] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L873] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L874] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L875] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L878] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L879] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L880] 0 x$flush_delayed = weak$$choice2 [L881] 0 x$mem_tmp = x [L882] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L883] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L884] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L885] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L886] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L887] 0 x$r_buff0_thd0 = weak$$choice2 ? x$r_buff0_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff0_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0)) [L888] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L889] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) [L890] 0 x = x$flush_delayed ? x$mem_tmp : x [L891] 0 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t993={5:0}, t994={6:0}, t995={7:0}, t996={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L893] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix037_tso.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff0_thd4=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$r_buff1_thd4=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=2, y=1, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 856]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 863]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 865]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 30.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 21.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1120 SdHoareTripleChecker+Valid, 3.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 940 mSDsluCounter, 266 SdHoareTripleChecker+Invalid, 2.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 226 mSDsCounter, 80 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2499 IncrementalHoareTripleChecker+Invalid, 2579 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 80 mSolverCounterUnsat, 40 mSDtfsCounter, 2499 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 98 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 80 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 1.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=259occurred in iteration=14, InterpolantAutomatonStates: 86, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.9s SatisfiabilityAnalysisTime, 7.2s InterpolantComputationTime, 410 NumberOfCodeBlocks, 410 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 349 ConstructedInterpolants, 0 QuantifiedInterpolants, 2796 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-23 21:41:28,107 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ --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 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-30e01a7 [2023-11-23 21:41:31,195 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-23 21:41:31,329 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-23 21:41:31,339 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-23 21:41:31,344 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-23 21:41:31,398 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-23 21:41:31,400 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-23 21:41:31,401 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-23 21:41:31,402 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-23 21:41:31,408 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-23 21:41:31,409 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-23 21:41:31,410 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-23 21:41:31,410 INFO L153 SettingsManager]: * Use SBE=true [2023-11-23 21:41:31,413 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-23 21:41:31,413 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-23 21:41:31,414 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-23 21:41:31,414 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-23 21:41:31,415 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-23 21:41:31,415 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-23 21:41:31,417 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-23 21:41:31,417 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-23 21:41:31,418 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-23 21:41:31,418 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-23 21:41:31,419 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-23 21:41:31,420 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-23 21:41:31,420 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-23 21:41:31,421 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-23 21:41:31,421 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-23 21:41:31,422 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-23 21:41:31,423 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-23 21:41:31,424 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-23 21:41:31,425 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-23 21:41:31,425 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-23 21:41:31,426 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-23 21:41:31,426 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-23 21:41:31,426 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-23 21:41:31,427 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-23 21:41:31,427 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-23 21:41:31,427 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-23 21:41:31,428 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-23 21:41:31,429 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-23 21:41:31,429 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-23 21:41:31,429 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ 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 -> 526eb61a43a151355b0c30c3cdf9498dba5b0f807210313241440694b1deb106 [2023-11-23 21:41:31,957 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-23 21:41:31,990 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-23 21:41:31,995 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-23 21:41:31,997 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-23 21:41:31,998 INFO L274 PluginConnector]: CDTParser initialized [2023-11-23 21:41:31,999 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/../../sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-23 21:41:35,500 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-23 21:41:35,899 INFO L384 CDTParser]: Found 1 translation units. [2023-11-23 21:41:35,905 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/sv-benchmarks/c/pthread-wmm/mix037_tso.oepc.i [2023-11-23 21:41:35,925 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/5a31446ed/3cc45e9996c44d8fab85abfd9421bd03/FLAG2fda3dffb [2023-11-23 21:41:35,944 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_2cfb997f-6408-4e16-b2d1-febacb3d2d35/bin/uautomizer-verify-zZY32mL2XJ/data/5a31446ed/3cc45e9996c44d8fab85abfd9421bd03 [2023-11-23 21:41:35,947 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-23 21:41:35,949 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-23 21:41:35,951 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-23 21:41:35,951 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-23 21:41:35,959 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-23 21:41:35,960 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:35" (1/1) ... [2023-11-23 21:41:35,962 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5cc94094 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:35, skipping insertion in model container [2023-11-23 21:41:35,962 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 09:41:35" (1/1) ... [2023-11-23 21:41:36,032 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-23 21:41:36,678 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:41:36,699 INFO L202 MainTranslator]: Completed pre-run [2023-11-23 21:41:36,889 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-23 21:41:36,961 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:41:36,962 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-23 21:41:36,970 INFO L206 MainTranslator]: Completed translation [2023-11-23 21:41:36,970 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:36 WrapperNode [2023-11-23 21:41:36,971 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-23 21:41:36,973 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-23 21:41:36,973 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-23 21:41:36,973 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-23 21:41:36,983 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:36" (1/1) ... [2023-11-23 21:41:37,020 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:36" (1/1) ... [2023-11-23 21:41:37,086 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 169 [2023-11-23 21:41:37,086 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-23 21:41:37,087 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-23 21:41:37,087 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-23 21:41:37,087 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-23 21:41:37,097 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:36" (1/1) ... [2023-11-23 21:41:37,098 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 09:41:36" (1/1) ...